An efficient parallel implementation of the MSPAI preconditioner

DOI10.1016/J.PARCO.2009.12.007MaRDI QIDQ991107zbMATH OpenOpenAlexFDO

Authors J. Martínez

Publication date 2 September 2010

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.parco.2009.12.007

zbMATH Keywords

regularizationsparse matricesiterative methodsparallel computingpreconditionersdictionary

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Computer system organization (68M99)

Recommendations

• Smoothing and regularization with modified sparse approximate inverses
• Parallel Preconditioning with Sparse Approximate Inverses
• Publication:4860196
• A sparse approximate inverse preconditioner for parallel preconditioning of general sparse matrices
• FSAIPACK: a software package for high-performance factored sparse approximate inverse preconditioning

Cites work

• scientific article; zbMATH DE number 3791529 (Why is no real title available?)
• scientific article; zbMATH DE number 592770 (Why is no real title available?)
• scientific article; zbMATH DE number 1033192 (Why is no real title available?)
• scientific article; zbMATH DE number 1552294 (Why is no real title available?)
• scientific article; zbMATH DE number 936298 (Why is no real title available?)
• A comparative study of sparse approximate inverse preconditioners
• Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
• Approximate sparsity patterns for the inverse of a matrix and preconditioning
• Direct Methods for Sparse Linear Systems
• Frobenius norm minimization and probing for preconditioning
• Parallel Preconditioning with Sparse Approximate Inverses
• Sparse Approximate Inverses and Target Matrices
• The Interface Probing Technique in Domain Decomposition

Cited in

(12)

• A hybrid recursive multilevel incomplete factorization preconditioner for solving general linear systems
• Improving approximate inverses based on Frobenius norm minimization
• Towards Monte Carlo preconditioning approach and hybrid Monte Carlo algorithms for matrix computations
• Smoothing and regularization with modified sparse approximate inverses
• An Empirical Analysis of the Performance of Preconditioners for SPD Systems
• On Monte Carlo and quasi-Monte Carlo for matrix computations
• M-IHS: an accelerated randomized preconditioning method avoiding costly matrix decompositions
• A full parallel preconditioner for a class of M-matrices
• MSPAI
• On the Preconditioned Quasi-Monte Carlo Algorithm for Matrix Computations
• Preconditioning parametrized linear systems
• Banded target matrices and recursive FSAI for parallel preconditioning

Describes a project that uses

Uses Software

• ParaSails
• CSparse

This page was built for publication: An efficient parallel implementation of the MSPAI preconditioner

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