The rate of convergence of conjugate gradients
Numerische Mathematik
Introduction to Parallel & Vector Solution of Linear Systems
Introduction to Parallel & Vector Solution of Linear Systems
Iterative solution methods
Parallel Preconditioning with Sparse Approximate Inverses
SIAM Journal on Scientific Computing
Preconditioning Methods: Theory and Applications
Preconditioning Methods: Theory and Applications
Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
A three-dimensional explicit preconditioned solver
Computers & Mathematics with Applications
An inversion algorithm for a banded matrix
Computers & Mathematics with Applications
Performance models for the Spike banded linear system solver
Scientific Programming
Hi-index | 0.00 |
A class of finite difference schemes in conjunction with approximate inverse banded matrix techniques based on the concept of LU-type factorization procedures is introduced for computing fast explicit approximate inverses. Explicit preconditioned iterative schemes in conjunction with approximate inverse matrix techniques are presented for the efficient solution of banded linear systems. A theorem on the rate of convergence and estimates of the computational complexity required to reduce the L∞-norm of the error is presented. Applications of the method on linear and non-linear systems are discussed and numerical results are given.