J4

• 数学 • Previous Articles     Next Articles

Fast Algorithm of Minimal Norm Least Squares Solutionfor Loewnertype Linear System

TONG Qiujuan1,2, LIU Sanyang1, LU Quan3   

  1. 1. School of Sciences, Xidian University, Xi’an 710071, China;2. Department of Applied Mathematics and Physics, Xi’an University of Post and Telecommunications, Xi’an 710062, China;3. Department of Applied Mathematics, Northwestern Polytechnical University, Xi’an 710072, China
  • Received:2007-09-12 Revised:1900-01-01 Online:2008-09-26 Published:2008-09-26
  • Contact: LIU Sanyang

Abstract: A new fast algorithm of the minimal norm least squares solution for the linear system whose coefficient matrix is an m×n Loewnertype matrix with full column rank is given by forming a special block matrix and researching its triangular factorization. Its computation complexity is O(mn)+O(n2), but that of usual algorithms is O(mn2)+O(n3).

Key words: Loewnertype matrix, minimal norm least squares solution, triangular factorization, fast algorithm

CLC Number: 

  • O241.6