Factored sparse approximate inverse of block tridiagonal and block pentadiagonal matrices
DOI10.1016/J.AMC.2006.05.204zbMATH Open1120.65038OpenAlexW1998825514MaRDI QIDQ879472FDOQ879472
Authors: 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
Recommendations
- On computing of block ILU preconditioner for block tridiagonal systems
- Factorized sparse approximate inverses for preconditioning
- Approximate factoring of the inverse
- On the preconditioning of the block tridiagonal linear system of equations
- Finite-element based sparse approximate inverses for block-factorized preconditioners
Krylov subspace methodsnumerical resultspreconditioningparallel computationbiharmonic equationLyapunov matrix equationsblock tridiagonal matricesblock algorithmsblock pentadiagonal matricesfactored approximate inversesfive-point finite difference discretizationnine-point finite difference discretization
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Boundary value problems for higher-order elliptic equations (35J40) Finite difference methods for boundary value problems involving PDEs (65N06) Matrix equations and identities (15A24)
Cites Work
- Preconditioning techniques for large linear systems: A survey
- Parallel iterative methods for sparse linear systems
- Iterative Solution Methods
- A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
- A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
- On the Relations between ILUs and Factored Approximate Inverses
- A comparative study of sparse approximate inverse preconditioners
- Block Preconditioning for the Conjugate Gradient Method
- A parallel additive preconditioner for conjugate gradient method for \(AX+XB=C\)
- Convergence rate estimates for iterative solutions of the biharmonic equation
- A block version algorithm to approximate inverse factors
Cited In (11)
- Approximate Inverse Techniques for Block-Partitioned Matrices
- Approximate inverses of multidiagonal matrices and application to the block PCG method
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
- Computing the block triangular form of a sparse matrix
- Stability of high-Reynolds-number flow in a collapsible channel
- Inversion of dynamic matrices of HDD head positioning system
- On an effective solution of the Riemann problem for the second-order improperly elliptic equation in the rectangle
- A block version algorithm to approximate inverse factors
- On computing of block ILU preconditioner for block tridiagonal systems
- On the preconditioning of the block tridiagonal linear system of equations
- On an effective solution of the Riemann problem for third order improperly elliptic equations
This page was built for publication: Factored sparse approximate inverse of block tridiagonal and block pentadiagonal matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879472)
