A Spectral Projection Preconditioner for Solving Ill Conditioned Linear Systems
From MaRDI portal
Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Ill-posedness and regularization problems in numerical linear algebra (65F22) Computational methods for sparse matrices (65F50)
Abstract: We present a preconditioner based on spectral projection that is combined with a deflated Krylov subspace method for solving ill conditioned linear systems of equations. Our results show that the proposed algorithm requires many fewer iterations to achieve the convergence criterion for solving an ill conditioned problem than a Krylov subspace solver. In our numerical experiments, the solution obtained by the proposed algorithm is more accurate in terms of the norm of the distance to the exact solution of the linear system of equations.
This page was built for publication: A Spectral Projection Preconditioner for Solving Ill Conditioned Linear Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6277809)
