A Rapid Numerical Algorithm to Compute Matrix Inversion

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.


Introduction
Let us consider the square matrix A N×N with real or complex elements which is nonsingular.It is well known that its inverse is available and could be found by the direct methods such as LU or QR decompositions, see for example 1 .When the matrix inverse is computed, the method of choice should be probably Gaussian elimination with partial pivoting GEPP .The resulting residual bounds and possible backward errors may be much smaller in this case, see 2 subsection on the "Use and abuse of the matrix inverse" .
An effective tool to compute approximate inverses of the matrix A is to use iterationtype methods for this purpose which are based on matrix multiplications and are of great interest and accuracy when implementing on parallel machines.In fact, one way is to construct iterative methods of high order of convergence to find matrix inversion numerically for all types of matrices especially for ill-conditioned ones .
A clear use of such schemes is that one may apply them to find A −1 and then, by an easy matrix-vector multiplication, compute the solution of the linear system of the equations Ax b.However another use is in constructing approximate inverse preconditioners; that is, International Journal of Mathematics and Mathematical Sciences a very robust approximate preconditioner can easily be constructed using one, two, or three steps of such iterative methods, and the resulting left preconditioned systems would be Ax b, 1.1 wherein A P −1 A, b P −1 b, and P −1 ≈ A −1 .Such obtained approximate inverse preconditioners could be robust competitors to the classical or modern methods such as AINV or FAPINV; see for example 3, 4 .The approximate inverse AINV and the factored approximate inverse FAPINV are two known algorithms in the field of preconditioning of linear systems of equations.Both of these algorithms compute a sparse approximate inverse of matrix A in the factored form and are based on computing two sets of vectors which are A biconjugate.
In this paper, in order to challenge with very ill-conditioned matrices or to find the preconditioner P −1 in less number of iterations and having high accuracy, we will propose an efficient iterative method for finding A −1 numerically.Theoretical analysis and numerical experiments show that the new method is more effective than the existing ones in the case of constructing approximate inverse preconditioners.
The rest of the paper is organized as follows.Section 2 is devoted to a brief review of the available literature.The main contribution of this paper is given in Section 3. Subsequently, the method is examined in Section 4. Finally, concluding remarks are presented in Section 5.

Background
Several methods of various orders were proposed for approximating rectangular or square matrix inverses, such as those according to the minimum residual iterations 5 and Hotelling-Bodewig algorithm 6 .
The Hotelling-Bodewig algorithm 6 is defined as where I is the identity matrix.Note that throughout this paper we consider matrices of the same dimension unless it is stated obviously.In 2011, Li et al. in 7 presented the following third-order method: and also proposed another third-order iterative method for approximating A −1 as comes next It is intersecting to mention that the method 2.2 can be found in the Chapter 5 of 8 .

International Journal of Mathematics and Mathematical Sciences 3
As an another method from the existing literature, Krishnamurthy and Sen suggested the following sixth-order iteration method 8 for the above purpose: where n 0, 1, 2, . . . .
For further reading refer to 9, 10 .

An Accurate Seventh-Order Method
This section contains a new high-order algorithm for finding A −1 numerically.In order to deal with very ill-conditioned linear systems, to find efficient preconditioners rapidly, or to find robust approximate inverses, we suggest the following matrix multiplication-based iterative method: for any n 0, 1, 2, . .., wherein I is the identity matrix, and the sequence of iterates {V n } n ∞ n 0 converges to A −1 for a good initial guess.
Theorem 3.1.Assume that A a i,j N×N be an invertible matrix with real or complex elements.If the initial guess V 0 satisfies then the iteration 3.1 converges to A −1 with at least seventh convergence order.
Proof.In order to prove the convergence behavior of 3.1 , we assume that I − AV 0 < 1, E 0 I − AV 0 , and E n I − AV n .We then have International Journal of Mathematics and Mathematical Sciences

3.3
Hence, it is now and according to the above simplifications easily to have Furthermore, since E 0 < 1, and where 3.5 tends to zero when n → ∞.That is to say when n → ∞, and thus for 3.6 , we obtain

3.7
We must now illustrate the seventh order of convergence for 3.1 due to the obtained theoretical discussions that 3.1 converges under the assumption made in Theorem 3.1 to A −1 .To do this aim, we denote ε n V n − A −1 , as the error matrix in the iterative procedure 3.1 .We have

3.10
Using 3.10 , we attain which simplifies by taking norm from both sides 12 and consequently

3.13
This shows that the method 3.1 converges to A −1 with at least seventh order of convergence.This concludes the proof.
Remark 3.2.For the above Theorem 3.1, we can conclude some points as follows.
1 From 3.4 , one knows that the condition 3.2 may be weakened.In fact, we only need that the spectral radius of AV 0 be less than one for the convergence of the above new method 3.1 .In this case, the choice of V 0 may be obtained according to the estimate formulas for the spectral radius ρ AV 0 see, e.g., 11 2 In some experiments and to reduce the computational cost, we may solve the matrix multiplications, based on the vector and parallel processors.
3 Finally, for the choice of V 0 , there exist many of different forms.We will describe this problem after Theorem 3.3 based on some literatures.
We now give a property about the scheme 3.1 .This property shows that {V n } n ∞ n 0 of 3.1 may be applied to not only the left preconditioned linear system V n Ax V n b but also to the right preconditioned linear system AV n y b, where y V n x.Theorem 3.3.Let again A a i,j N×N be a nonsingular real or complex matrix.If holds, for all n 1, 2, . . . .

International Journal of Mathematics and Mathematical Sciences
Proof.The mathematical induction is taken into account herein.First, since AV 0 V 0 A, we have

3.16
Equation 3.16 shows that when n 1, 3.15 is true.At the moment, suppose that AV n V n A is true, and then a straightforward calculation using 3.16 shows that, for all n ≥ 1,

3.17
This concludes the proof.
Note that according to the literatures 7, 9, 12, 13 and to find an initial value V 0 to preserve the convergence order of such iterative methods, we need to fulfill at least the condition given in Remark 3.2.or Theorem 3.1.We list some ways for this purpose in what follows.
WAY 1 If a matrix is strictly diagonally dominant, then choose V 0 as V 0 diag 1/a 11 , 1/a 22 , . . ., 1/a nn , where a ii are the diagonal elements of A.
WAY 2 For the matrix A, choose V 0 as V 0 A T / A 1 A ∞ , wherein T stands for transpose, A 1 max j {Σ n i 1 |a ij |} and A ∞ max i {Σ n j 1 |a ij |}.WAY 3 If the ways 1-2 fail, then use V 0 αI, where I is the identity matrix, and α ∈ R should adaptively be determined such that I − αA < 1.

Numerical Testing
In this section, experiments are presented to demonstrate the capability of the suggested method.For solving a square linear system of equations of the general form Ax b, wherein A ∈ C N×N , we can now propose the following efficient algorithm: x n 1 V n 1 b while n 0, 1, 2, . . . .
The programming package MATHEMATICA 8, 14, 15 , has been used in this section.For numerical comparisons, we have used the methods 2.1 , 2.2 , the sixth-order method of Krishnamurthy and Sen 2.4 , and the new algorithm 3.1 .
As noted in Section 1, such high order schemes are so much fruitful in providing robust preconditioners to the linear systems.In fact, we believe that only one full iteration of the scheme 3.1 for even large sparse systems and by defining SparseArray mat to reduce the computational load of matrix multiplications is enough to find acceptable preconditioners to the linear systems.Anyhow, using parallel computations with simple commands for this purpose in MATHEMATICA 8 may reduce the computational burden much more.

Test Problem 1
Consider the linear system Ax b, wherein A is the large sparse complex matrix defined by n = 1000; The dimension of this matrix is 1000 with complex elements in its structure.The right hand side vector is considered to be b 1, 1, . . ., 1 T .Although page limitations do not allow us to provide the full form of such matrices, the structure of such matrices can easily be drawn.Figure 1 illustrates the plot and also the array plot of this matrix.Now, we expect to find robust approximate inverses for A in less iterations by the high-order iterative methods.Furthermore, as we described in the previous sections, the approximate inverses could be considered for left or right preconditioned systems.
Table 1 clearly shows the efficiency of the proposed iterative method 3.1 in finding approximate inverses by manifesting the number of iterations and the obtained residual norm.When working with sparse matrices, an important factor which affects clearly on the computational cost of the iterative method is the number of nonzeros elements.The considered sparse complex matrix A, in test problem 1, has 3858 nonzero elements at the beginning.We list the number of nonzero elements for different iteration matrix multiplication-based schemes in Table 1.It is obvious that the new scheme is much better than 2.1 and 2.2 , but when comparing to 2.4 its number of nonzero elements are higher; however, this is completely satisfactory due to the better numerical results we have obtained for the residual norm.In fact, if one let the 2.4 to cycle more in order to reach the residual norm which is correct up to seven decimal places, then the obtained nonzero elements will be more than the corresponding one of 3.1 .
At this time, if the user is satisfied of the obtained residual norm for solving the large sparse linear system then can be stopped, else, one can use the attained approximate inverse as a left or right preconditioner and solve the resulting preconditioned linear system with  The right hand side vector is again considered to be b 1, 1, . . ., 1 T .Figure 2 illustrates the plot and array plot of this matrix.Due to the fact that, for dense matrices, such plots will not be illustrative, we have drawn the 3-D plots of the coefficient dense matrix using the zeroorder interpolation in test problem 2, alongside its approximate inverse obtained from the method 3.1 after 11 iterations in Figure 3.We further expect to have a similar identity-like behavior for the multiplication of A to its approximate inverse, and this is clear in part c of Figure 3.
Table 2 shows the number of iterations and the obtained residual norm for different methods in order to reveal the efficiency of the proposed iteration.There is a clear reduction in computational steps for the proposed method 3.1 in contrast to the other existing wellknown methods of various orders in the literature.Table 2 further confirms the use of such iterative inverse finders in order to find robust approximate inverse preconditioners again.Since, the condition number of the coefficient matrix in Test Problem 2 is 18137.2,which is quite high for a 40 × 40 matrix.But as can be furnished in Table 2, the obtained condition number of the preconditioned matrix after the specified number of iterations is very small.
We should here note that the computational time requiring for implementing all the methods in Tables 1 and 2 for the Test Problems 1 and 2 is less than one second, and due to this we have not listed them herein.For the second test proplem, we have used V 0 A T / A 1 A ∞

Concluding Remarks
In the present paper, the author along with the helpful suggestions of the reviewers has developed an iterative method in inverse finding of matrices.Note that such high orderiterative methods are so efficient for very ill-conditioned linear systems or to find robust approximate inverse preconditioners.We have shown analytically that the suggested method 3.1 , reaches the seventh order of convergence.Moreover, the efficacy of the new scheme was illustrated numerically in Section 4 by applying to a sparse matrix and an ill-conditioned dense matrix.All the numerical results confirm the theoretical aspects and show the efficiency of 3.1 .

9 6 I − AV n 8 9
I − AV n 7 .3.8 Equation 3.8 yields in International Journal of Mathematics and Mathematical Sciences 5

Figure 2 :
Figure 2: The matrix plot a and the array plot b of the coefficient complex matrix in test problem 2.

Figure 3 :
Figure 3: The 3D plot of the structure of the coefficient matrix a in the Test Problem 2, its approximate inverse b by the method 3.1 and their multiplication to obtain a similar output to the identity matrix c .

Table 2 :
Results of comparisons for the test problem 2 with condition number 18137.2.