A new approach to compute sparse approximate inverse of an SPD matrix
نویسنده
چکیده
The accelerated overrelaxation (AOR) iterative method is a stationary iterative method for solving linear system of equations. In this paper, a generalization of the AOR iterative method is presented and its convergence properties are studied. Some numerical experiments are given to show the efficiency of the proposed method. AMS Mathematics Subject Classification: 65F10.
منابع مشابه
ILU and IUL factorizations obtained from forward and backward factored approximate inverse algorithms
In this paper, an efficient dropping criterion has been used to compute the IUL factorization obtained from Backward Factored APproximate INVerse (BFAPINV) and ILU factorization obtained from Forward Factored APproximate INVerse (FFAPINV) algorithms. We use different drop tolerance parameters to compute the preconditioners. To study the effect of such a dropping on the quality of the ILU ...
متن کاملOn Some New Developments in Approximate Inverse Preconditioning
Some new developments of conjugation-based sparse approximate inverse preconditioners are considered in application to problems of solid and structural mechanics. A block version of the AINV algorithm and its stabilized modification are presented. The stabilized AINV algorithm, which in exact arithmetic is breakdown-free for any SPD matrix, is found to result in robust preconditioners even in d...
متن کاملAn Efficient Schulz-type Method to Compute the Moore-Penrose Inverse
A new Schulz-type method to compute the Moore-Penrose inverse of a matrix is proposed. Every iteration of the method involves four matrix multiplications. It is proved that this method converge with fourth-order. A wide set of numerical comparisons shows that the average number of matrix multiplications and the average CPU time of our method are considerably less than those of other methods.
متن کاملA Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
Motivated by the paper [16], where the authors proposed a method to solve a symmetric positive definite (SPD) system Ax = b via a sparse-sparse iterative-based projection method, we extend this method to nonsymmetric linear systems and propose a modified method to construct a sparse approximate inverse preconditioner by using the Frobenius norm minimization technique in this paper. Numerical ex...
متن کاملMSP: A Class of Parallel Multistep Successive Sparse Approximate Inverse Preconditioning Strategies
We develop a class of parallel multistep successive preconditioning strategies to enhance efficiency and robustness of standard sparse approximate inverse preconditioning techniques. The key idea is to compute a series of simple sparse matrices to approximate the inverse of the original matrix. Studies are conducted to show the advantages of such an approach in terms of both improving precondit...
متن کامل