Factored sparse approximate inverse of block tridiagonal and block pentadiagonal matrices
biharmonic equationblock algorithmsblock pentadiagonal matricesblock tridiagonal matricesfactored approximate inversesfive-point finite difference discretizationKrylov subspace methodsLyapunov matrix equationsnine-point finite difference discretizationnumerical resultsparallel computationpreconditioning
Matrix equations and identities (15A24) Boundary value problems for higher-order elliptic equations (35J40) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational methods for sparse matrices (65F50) Finite difference methods for boundary value problems involving PDEs (65N06)
The authors develop recurrence formulas by using bordering technique for computing a factored sparse approximate inverse for block tridiagonal and block pentadiagonal matrices \(A\). If \(A\) is a symmetric, positive definite matrix or an \(M\)-matrix, then it is guaranteed that the approximate triangular factorization of \(A^{-1}\) exists. The application of the presented algorithms for preconditioning Lyapunov matrix equations is discussed. Furthermore, the methods are used to construct preconditioners for the biharmonic equation discretized by a standard central difference formula. The numerical results show the effectiveness of the new methods. The presented algorithms are well suited for parallel computers.
- 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
- A block version algorithm to approximate inverse factors
- A comparative study of sparse approximate inverse preconditioners
- A parallel additive preconditioner for conjugate gradient method for AX+XB=C
- A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
- A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
- Block Preconditioning for the Conjugate Gradient Method
- Convergence rate estimates for iterative solutions of the biharmonic equation
- Iterative Solution Methods
- On the Relations between ILUs and Factored Approximate Inverses
- Parallel iterative methods for sparse linear systems
- Preconditioning techniques for large linear systems: A survey
- 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
- 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
- On an effective solution of the Riemann problem for third order improperly elliptic equations
- Computing the block triangular form of a sparse matrix
- Approximate Inverse Techniques for Block-Partitioned Matrices
- Inversion of dynamic matrices of HDD head positioning system
- Stability of high-Reynolds-number flow in a collapsible channel
- On computing of block ILU preconditioner for block tridiagonal systems
- On the preconditioning of the block tridiagonal linear system of 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)
