Fast enclosure for the minimum norm least squares solution of the matrix equation AXB = C

被引：1

作者：

Miyajima, Shinya ^{[1
]}

机构：

[1] Gifu Univ, Fac Engn, Gifu 5011193, Japan

来源：

NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS | 2015年 / 22卷 / 03期

关键词：

matrix equation; least squares solution; Moore-Penrose inverse; numerical enclosure; verified computation; UNDERDETERMINED LINEAR-SYSTEMS; BOUNDS; RANKS;

D O I：

10.1002/nla.1971

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Fast algorithms for enclosing the minimum norm least squares solution of the matrix equation AXB = C are proposed. To develop these algorithms, theories for obtaining error bounds of numerical solutions are established. The error bounds obtained by these algorithms are verified in the sense that all the possible rounding errors have been taken into account. Techniques for accelerating the enclosure and obtaining smaller error bounds are introduced. Numerical results show the properties of the proposed algorithms. Copyright (c) 2015 John Wiley & Sons, Ltd.

引用

页码：548 / 563

页数：16

共 25 条

[1]

[Anonymous], 2002, Accuracy and stability of numerical algorithms

[2]

[Anonymous], 1999, Developments in reliable computing, DOI DOI 10.1007/978-94-017-1247-7

[3] Interval systems [x]=[a][x]+[b] and the powers of interval matrices in complex interval arithmetics [J].