Browse > Article
http://dx.doi.org/10.4134/CKMS.2013.28.2.407

ON A FAST ITERATIVE METHOD FOR APPROXIMATE INVERSE OF MATRICES  

Soleymani, Fazlollah (Department of Mathematics Islamic Azad University)
Publication Information
Communications of the Korean Mathematical Society / v.28, no.2, 2013 , pp. 407-418 More about this Journal
Abstract
This paper studies a computational iterative method to find accurate approximations for the inverse of real or complex matrices. The analysis of convergence reveals that the method reaches seventh-order convergence. Numerical results including the comparison with different existing methods in the literature will also be considered to manifest its superiority in different types of problems.
Keywords
Hotelling-Bodewig algorithm; ill-conditioned; approximate inverse; initial matrix;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 A. Ben-Israel and T. N. E. Greville, Generalized Inverses, Springer, 2nd edition, 2003.
2 W. Cao and B. Guo, Preconditioning for the p-version boundary element method in three dimension with tringaular elements, J. Korean Math. Soc. 41 (2004), no. 2, 345-368.   과학기술학회마을   DOI   ScienceOn
3 H. Chen and Y. Wang, A family of higher-order convergent iterative methods for computing the Moore-Penrose inverse, Appl. Math. Comput. 218 (2011), no. 8, 4012-4016.   DOI   ScienceOn
4 en.wikipedia.org/wiki/Invertible_matrix.
5 J. M. Garnett, A. Ben-Israel, and S. S. Yau, A hyperpower iterative method for computing matrix products involving the generalized inverse, SIAM J. Numer. Anal. 8 (1971), 104-109.   DOI   ScienceOn
6 I. Pavaloiu and E. Catina, Remarks on some Newton and Chebyshev-type methods for approximation eigenvalues and eigenvectors of matrices, Comput. Sci. J. Moldova 7 (1999), no. 1, 3-17.
7 S. M. Rump, Inversion of extremely ill-conditioned matrices in floating-point, Japan J. Indust. Appl. Math. 26 (2009), no. 2-3, 249-277.   DOI
8 H.-B. Li, T.-Z. Huang, Y. Zhang, X.-P. Liu, and T.-X. Gu, Chebyshev-type methods and preconditioning techniques, Appl. Math. Comput. 218 (2011), no. 2, 260-270.   DOI   ScienceOn
9 H. Hotelling, Analysis of a complerx statistocal variable into principal components, J. Educ. Psysh. 24 (1933), 498-520.   DOI
10 E. V. Krishnamurthy and S. K. Sen, Numerical Algorithms, Computations in science and engineering. Affiliated East-West Press Pvt. Ltd., New Delhi, 1986.
11 W. Li and Z. Li, A family of iterative methods for computing the approximate inverse of a square matrix and inner inverse of a non-square matrix, Appl. Math. Comput. 215 (2010), no. 9, 3433-3442.   DOI   ScienceOn
12 M. Monsalve and M. Raydan, A new inversion-free method for a rational matrix equation, Linear Algebra Appl. 433 (2010), no. 1, 64-71.   DOI   ScienceOn
13 Y. Nakatsukasa, Z. Bai, and F. Gygi, Optimizing Halley's iteration for computing the matrix polar decomposition, SIAM. J. Matrix Anal. Appl. 31 (2010), no. 5, 2700-2720.   DOI   ScienceOn
14 V. Pan and R. Schreiber, An improved Newton iteration for the generalized inverse of a matrix, with applications, SIAM J. Sci. Statist. Comput. 12 (1991), no. 5, 1109-1130.   DOI
15 A. Ben-Israel and D. Cohen, On iterative computation of generalized inverses and associated projections, SIAM J. Numer. Anal. 3 (1966), 410-419.   DOI   ScienceOn
16 G. Schulz, Iterative Berechnung der Reziproken matrix, Z. Angew. Math. Mech. 13 (1933), 57-59.   DOI
17 S. Wolfram, The Mathematica Book, 5th edition, Wolfram Media, 2003.
18 J. H. Yun, Comparison results for the preconditioned Gauss-Seidel methods, Commun. Korean Math. Soc. 27 (2012), no. 1, 207-215.   과학기술학회마을   DOI   ScienceOn