On the preconditioning of the block tridiagonal linear system of equations

DOI10.1007/s12190-008-0082-zzbMath1157.65367OpenAlexW1994693020MaRDI QIDQ949346

Davod Khojasteh Salkuyeh

Publication date: 21 October 2008

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

Full work available at URL: https://doi.org/10.1007/s12190-008-0082-z

zbMATH Keywords

algorithmsnumerical resultsKrylov subspace methodspentadiagonal matricesblock tridiagonal matricesblock ILU preconditionerinverse factorsblock ILU factorization

Mathematics Subject Classification ID

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

Related Items (1)

A note on parallel preconditioning for all-at-once evolutionary PDEs

Cites Work

• On computing of block ILU preconditioner for block tridiagonal systems
• On approximate factorization methods for block matrices suitable for vector and parallel processors
• A comparative study of sparse approximate inverse preconditioners
• A sparse approximate inverse preconditioner for parallel preconditioning of general sparse matrices
• Preconditioning techniques for large linear systems: A survey
• BILUS: A block version of ILUS factorization.
• Block Preconditioning for the Conjugate Gradient Method
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• Factorized Sparse Approximate Inverse Preconditionings I. Theory
• A Framework for Block ILU Factorizations Using Block-Size Reduction
• A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
• Iterative Solution Methods
• A Flexible Inner-Outer Preconditioned GMRES Algorithm

This page was built for publication: On the preconditioning of the block tridiagonal linear system of equations