An efficient parallel implementation of the MSPAI preconditioner

DOI10.1016/j.parco.2009.12.007zbMath1204.68264OpenAlexW2076868612MaRDI QIDQ991107

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

regularizationiterative methodsparallel computingsparse matricespreconditionersdictionary

Mathematics Subject Classification ID

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

Related Items (8)

A hybrid recursive multilevel incomplete factorization preconditioner for solving general linear systems ⋮ Improving approximate inverses based on Frobenius norm minimization ⋮ On Monte Carlo and Quasi-Monte Carlo for Matrix Computations ⋮ On the Preconditioned Quasi-Monte Carlo Algorithm for Matrix Computations ⋮ Banded target matrices and recursive FSAI for parallel preconditioning ⋮ Towards Monte Carlo preconditioning approach and hybrid Monte Carlo algorithms for matrix computations ⋮ MSPAI ⋮ Preconditioning Parametrized Linear Systems

Uses Software

• ParaSails
• CSparse

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate sparsity patterns for the inverse of a matrix and preconditioning
• A comparative study of sparse approximate inverse preconditioners
• Direct Methods for Sparse Linear Systems
• The Interface Probing Technique in Domain Decomposition
• Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
• Parallel Preconditioning with Sparse Approximate Inverses
• Sparse Approximate Inverses and Target Matrices
• Frobenius norm minimization and probing for preconditioning

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