
doi: 10.1155/2012/134653
The aim of the present work is to suggest and establish a numerical algorithm based on matrix multiplications for computing approximate inverses. It is shown theoretically that the scheme possesses seventh-order convergence, and thus it rapidly converges. Some discussions on the choice of the initial value to preserve the convergence rate are given, and it is also shown in numerical examples that the proposed scheme can easily be taken into account to provide robust preconditioners.
preconditioners, Iterative numerical methods for linear systems, numerical examples, algorithm, convergence, approximate inverses, QA1-939, Preconditioners for iterative methods, Theory of matrix inversion and generalized inverses, Mathematics, matrix inversion
preconditioners, Iterative numerical methods for linear systems, numerical examples, algorithm, convergence, approximate inverses, QA1-939, Preconditioners for iterative methods, Theory of matrix inversion and generalized inverses, Mathematics, matrix inversion
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 20 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
