J4

• 数学 • 上一篇    下一篇

Loewner型方程组极小范数最小二乘解的快速算法

仝秋娟1,2, 刘三阳1, 陆 全3   

  1. 1. 西安电子科技大学 理学院, 西安 710071; 2. 西安邮电学院 应用数理系, 西安 710062;3. 西北工业大学 应用数学系, 西安 710072
  • 收稿日期:2007-09-12 修回日期:1900-01-01 出版日期:2008-09-26 发布日期:2008-09-26
  • 通讯作者: 刘三阳

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

摘要: 通过构造特殊分块矩阵及其三角分解给出了求秩为n 的m×n阶Loewner型矩阵为系数阵的线性方程组极小范数最小二乘解的快速算法, 该算法的计算复杂度为O(mn)+O(n2), 而一般方法的计算复杂度为O(mn2)+O(n3) .

关键词: Loewner型矩阵, 极小范数最小二乘解, 三角分解, 快速算法

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

中图分类号: 

  • O241.6