Block incomplete factorization preconditioners for a symmetric block-tridiagonal \(M\)-matrix
From MaRDI portal
Publication:1298802
DOI10.1016/S0377-0427(98)00078-8zbMath0930.65051OpenAlexW2075528970MaRDI QIDQ1298802
Publication date: 22 August 1999
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-0427(98)00078-8
splittingparallel computationsblock incomplete factorization preconditionerssymmetric block-tridiagonal \(M\)-matrix
Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- The block preconditioned conjugate gradient method on vector computers
- Incomplete block matrix factorization preconditioning methods. The ultimate answer?
- On approximate factorization methods for block matrices suitable for vector and parallel processors
- On computing INV block preconditionings for the conjugate gradient method
- A general incomplete block-matrix factorization method
- Vectorizable preconditioners for elliptic difference equations in three space dimensions
- An approach to nonlinear programming
- Block Preconditioning for the Conjugate Gradient Method
- On Sparse Block Factorization Iterative Methods
- Factorized Sparse Approximate Inverse Preconditionings I. Theory
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Iterative Solution Methods
- Parallel Preconditioning with Sparse Approximate Inverses
- Approximate Inverse Techniques for Block-Partitioned Matrices
- Methods of conjugate gradients for solving linear systems
