摘要
通过构造特殊分块矩阵并研究其三角分解,给出求以秩为n的m×nLoewner型矩阵为系数阵的线性方程组极小范数最小二乘解的快速算法,该算法的计算复杂度为O(mn)+O(n2),而一般方法的计算复杂度为O(mn2)+O(n3).
By constructing a special block matrix and studying its triangular factorization,a new fast algorithm was given for finding minimal norm least squares solution to linear equation system,in which the coefficient was an m×n Loewner-type matrix with full column rank.Its computational complexity was O（mn）＋O（n2） while the computational complexity of general approach was O（mn2）＋O（n3）.
出处
《兰州理工大学学报》
CAS
北大核心
2010年第2期125-128,共4页
Journal of Lanzhou University of Technology
基金
国家自然科学基金(60574075
60674108)
陕西省教育厅资助项目(07JK374)
