A block version of left-looking AINV preconditioner with one by one or two by two block pivots

DOI10.1016/j.amc.2019.01.012zbMath1429.65060OpenAlexW2914336422WikidataQ128504941 ScholiaQ128504941MaRDI QIDQ2009267

Amin Rafiei, Matthias Bollhöfer, Fayssal Benkhaldoun

Publication date: 27 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2019.01.012

zbMATH Keywords

multilevel nested dissection reorderingmaximum weighted matchingblock version of Gaussian elimination processILUT preconditionerleft-looking AINV

Mathematics Subject Classification ID

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

Uses Software

• symrcm

Cites Work

• Left-looking version of AINV preconditioner with complete pivoting strategy
• Preconditioning Highly Indefinite and Nonsymmetric Matrices
• A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
• Orderings for Factorized Sparse Approximate Inverse Preconditioners
• The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
• Fine-Grained Parallel Incomplete LU Factorization
• Strategies for Scaling and Pivoting for Sparse Symmetric Indefinite Problems
• Stabilized and block approximate inverse preconditioners for problems in solid and structural mechanics
• Benchmarking optimization software with performance profiles.
• Unnamed Item
• Unnamed Item

This page was built for publication: A block version of left-looking AINV preconditioner with one by one or two by two block pivots