论文信息 - A new method for solving ill-conditioned linear systems

A new method for solving ill-conditioned linear systems

An accurate numerical method is established for matrix inversion. It is shown theoretically that the scheme possesses the high order of convergence of seven. Subsequently, the method is taken into account for solving linear systems of equations. The accuracy of the contributed iterative method is clarified on solving numerical examples when the coecient matrices are ill-conditioned. All of the computations are performed on a PC using several programs written in Mathematica 7.

Fazlollah Soleymani | F. Soleymani

[1] Edmond Chow,et al. Approximate Inverse Preconditioners via Sparse-Sparse Iterations , 1998, SIAM J. Sci. Comput..

[2] S. S. Prabhu,et al. Optimal iterative schemes for computing the Moore-Penrose matrix inverse , 1976 .

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

[4] Stephen Wolfram,et al. The Mathematica Book , 1996 .

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

[6] S. Atluri,et al. On Solving the Ill-Conditioned System Ax=b: General-Purpose Conditioners Obtained From the Boundary-Collocation Solution of the Laplace Equation, Using Trefftz Expansions With Multiple Length Scales , 2009 .

[7] Takashi Nodera,et al. A new scheme of computing the approximate inverse preconditioner for the reduced linear systems , 2007 .

[8] 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..

[9] Victor Y. Pan,et al. Newton-Like Iteration Based on a Cubic Polynomial for Structured Matrices , 2004, Numerical Algorithms.

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

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