Convergence of Rump's method for inverting arbitrarily ill-conditioned matrices

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS

卷:205

Article

Oishi, Shin'ichi ; Tanabe, Kunio ; Ogita, Takeshi ; Rump, Siegfried M.

关键词: matrix inversion;    ill-conditioned matrix;    accurate dot product;    precondition;   

DOI  :  10.1016/j.cam.2006.05.022

来源: Elsevier

【 摘 要 】

In this paper, the problem of inverting regular matrices with arbitrarily large condition number is treated in double precision defined by IEEE 754 floating point standard. In about 1984, Rump derived a method for inverting arbitrarily ill-conditioned matrices. The method requires the possibility to calculate a dot product in higher precision. Rump's method is of theoretical interest. Rump made it clear that inverting an arbitrarily ill-conditioned matrix in single or double precision does not produce meaningless numbers, but contains a lot of information in it. Rump's method uses such inverses as preconditioners. Numerical experiments exhibit that Rump's method converges rapidly for various matrices with large condition numbers. Why Rump's method is so efficient for inverting arbitrarily ill-conditioned matrices is a little mysterious. Thus, to prove its convergence is an interesting problem in numerical error analysis. In this article, a convergence theorem is presented for a variant of Rump's method. (C) 2006 Elsevier B.V. All rights reserved.

【 授权许可】

Free