An Empirical Analysis of the Performance of Preconditioners for SPD Systems

DOI10.1145/2331130.2331132MaRDI QIDQ2989166zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 19 May 2017

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2331130.2331132

zbMATH Keywords

iterative solversnumerical softwarepreconditionerssparse linear systems

Mathematics Subject Classification ID

Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10) Computational methods for sparse matrices (65F50)

Recommendations

• Numerical performance of preconditioning techniques for the solution of complex sparse linear systems
• A numerical study of optimized sparse preconditioners
• Effective and robust preconditioning of general SPD matrices via structured incomplete factorization
• On SPD-preconditioned iterative methods applied to a stabilized Galerkin method
• scientific article; zbMATH DE number 176166
• Robust and Effective eSIF Preconditioning for General Dense SPD Matrices
• An efficient parallel implementation of the MSPAI preconditioner
• Numerical comparison of preconditionings for large sparse finite element problems
• The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems

Cited in

(4)

• Enhancing performance and robustness of ILU preconditioners by blocking and selective transposition
• A numerical evaluation of preprocessing and ILU-type preconditioners for the solution of unsymmetric sparse linear systems using iterative methods
• Using Performance Profiles to Evaluate Preconditioners for Iterative Methods
• \texttt{HSL\_MI28}: an efficient and robust limited-memory incomplete Cholesky factorization code

This page was built for publication: An Empirical Analysis of the Performance of Preconditioners for SPD Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989166)