A fast algorithm of the minimal norm least square solution for Loewner-type linear system

被引：0

作者：

Lu, Quan ^{[1
]}

Tong, Qiu-juan ^{[1
]}

Xu, Zhong ^{[1
]}

机构：

[1] Northwestern Polytech Univ, Dept Appl Math, Xian 710072, Peoples R China

来源：

Advances in Matrix Theory and Applications | 2006年

关键词：

Loewner-type matrix; minimal norm least square solutions; triangular factorization; fast algorithms;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In this paper, a fast algorithm of the minimal norm least square solution for linear system which coefficients m x n Loewner-type matrix is given. Its computation complexity is O(mn) + O(n(2)), but that usual of it is O(mn(2)) + O(n(3)).

引用

页码：234 / 237

页数：4

共 8 条

[1] [Anonymous], MATH ZEIT
[2] BELEVITCH V, 1970, PHILIPS RES REP, V25, P337
[3] Donoghue W. F., 1974, Die Grundlehren der mathematischen Wissenschaften, V207
[4] HANKEL AND LOEWNER MATRICES
FIEDLER, M
[J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 1984, 58 (APR) : 75 - 95
[5] Recursive solution of Lowner-Vandermonde systems of equations .1.
Rost, K
Vavrin, Z
[J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 1996, 233 : 51 - 65
[6] ROST K, 1995, LINEAR ALGEBRA APPL, V223, P597
[7] INVERSES OF LOWNER MATRICES
VAVRIN, Z
[J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 1984, 63 (DEC) : 227 - 236
[8] ZHONGXU KY, 1999, FAST ALGORITHM TOEPL

← 1 →