Factored sparse approximate inverse of block tridiagonal and block pentadiagonal matrices
DOI10.1016/j.amc.2006.05.204zbMath1120.65038OpenAlexW1998825514MaRDI QIDQ879472
M. H. Koulaei, Faezeh Toutounian
Publication date: 14 May 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.05.204
numerical resultspreconditioningparallel computationbiharmonic equationKrylov subspace methodsblock algorithmsLyapunov matrix equationsblock tridiagonal matricesblock pentadiagonal matricesfactored approximate inversesfive-point finite difference discretizationnine-point finite difference discretization
Computational methods for sparse matrices (65F50) Boundary value problems for higher-order elliptic equations (35J40) Matrix equations and identities (15A24) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Finite difference methods for boundary value problems involving PDEs (65N06)
Related Items
Cites Work
- Unnamed Item
- Convergence rate estimates for iterative solutions of the biharmonic equation
- A comparative study of sparse approximate inverse preconditioners
- A parallel additive preconditioner for conjugate gradient method for \(AX+XB=C\)
- A block version algorithm to approximate inverse factors
- Preconditioning techniques for large linear systems: A survey
- Block Preconditioning for the Conjugate Gradient Method
- Iterative Solution Methods
- A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
- On the Relations between ILUs and Factored Approximate Inverses
- A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method