On the solution of boundary value problems by using fast generalized approximate inverse banded matrix techniques

DOI10.1023/A:1023936410006zbMath1038.68153OpenAlexW1602144753MaRDI QIDQ1404297

George A. Gravvanis

Publication date: 21 August 2003

Published in: The Journal of Supercomputing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1023936410006

zbMATH Keywords

computational complexityrate of convergencepreconditioningbanded matrixparallel iterative methodsapproximate factorization proceduresapproximate inverse matrix techniques

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Symbolic computation and algebraic computation (68W30) Iterative numerical methods for linear systems (65F10)

Related Items (4)

A domain-decomposing parallel sparse linear system solver ⋮ Inversion and pseudoinversion of block arrowhead matrices ⋮ An inversion algorithm for a banded matrix ⋮ An efficient method for computing the inverse of arrowhead matrices

This page was built for publication: On the solution of boundary value problems by using fast generalized approximate inverse banded matrix techniques