On finding robust approximate inverses for large sparse matrices

This paper presents a method based on matrix-matrix multiplication concepts for determining the approximate (sparse) inverses of sparse matrices. The suggested method is a development on the well-known Schulz iteration and it can successfully be combined with iterative solvers and sparse approximation techniques as well. A detailed discussion on the convergence rate of this scheme is furnished. Results of numerical experiments are also reported to illustrate the performance of the proposed method.

[1]  J. Navarro-Pedreño.  Numerical Methods for Least Squares Problems , 1996 .

[2]  M. G. Zoia,et al.  An inversion formula for a matrix polynomial about a (unit) root , 2011 .

[3]  L. Grosz.  Preconditioning by incomplete block elimination , 2000, Numer. Linear Algebra Appl..

[4]  Xiaoji Liu,et al.  Successive Matrix Squaring Algorithm for Computing the Generalized Inverse AT,S(2) , 2012, J. Appl. Math..

[5]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[6]  Weiguo Li,et al.  A family of iterative methods for computing the approximate inverse of a square matrix and inner inverse of a non-square matrix , 2010, Appl. Math. Comput..

[7]  R. Coifman,et al.  Fast wavelet transforms and numerical algorithms I , 1991 .

[8]  A. Ostrowski.  Solution of equations and systems of equations , 1967 .

[9]  Michael Trott.  The Mathematica GuideBook for Numerics , 2005 .

[10]  G. Stewart,et al.  On the Numerical Properties of an Iterative Method for Computing the Moore–Penrose Generalized Inverse , 1974 .

[11]  E. V. Krishnamurthy,et al.  Numerical algorithms : computations in science and engineering , 2008 .

[12]  Zhengfan Li,et al.  An efficient solver for the three-dimensional capacitance of the interconnects in high speed digital circuit by the multiresolution method of moments , 1999 .

[13]  J. Traub.  Iterative Methods for the Solution of Equations , 1982 .

[14]  C. D. Meyer,et al.  Generalized inverses of linear transformations , 1979 .

[15]  Victor Y. Pan,et al.  An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications , 1991, SIAM J. Sci. Comput..

[16]  Yong Zhang,et al.  Chebyshev-type methods and preconditioning techniques , 2011, Appl. Math. Comput..

[17]  Liu Weiguo,et al.  A family of iterative methods for computing Moore–Penrose inverse of a matrix , 2013 .

[18]  Thomas Huckle,et al.  Smoothing and Regularization with Modified Sparse Approximate Inverses , 2010, J. Electr. Comput. Eng..

[19]  K. Sivakumar,et al.  A dominance notion for singular matrices with applications to nonnegative generalized inverses , 2012 .

[20]  Stan Wagon.  Mathematica in action , 1991 .

[21]  Predrag S. Stanimirovic,et al.  Successive matrix squaring algorithm for computing outer inverses , 2008, Appl. Math. Comput..

[22]  LU HAO,et al.  STAIR MATRICES AND THEIR GENERALIZATIONS WITH APPLICATIONS TO ITERATIVE METHODS I: A GENERALIZATION OF THE SUCCESSIVE OVERRELAXATION METHOD∗ , 1999 .

[23]  Yousef Saad,et al.  Iterative methods for sparse linear systems , 2003 .

[24]  G. Schulz.  Iterative Berechung der reziproken Matrix , 1933 .