Solving symmetric arrowhead and special tridiagonal linear systems by fast approximate inverse preconditioning

DOI10.1023/A:1021630031889zbMath1015.65015OpenAlexW1519987350MaRDI QIDQ1868503

George A. Gravvanis

Publication date: 27 April 2003

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

computational complexityconvergencenumerical resultspreconditioningapproximate factorizationarrowhead matrixapproximate inversesparallel iterative methodsbordered diagonal matrixCholeski-type factorizationspecial tridiagonal systems

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05) Finite difference methods for boundary value problems involving PDEs (65N06) Complexity and performance of numerical algorithms (65Y20)

Related Items (6)

LINEAR SYSTEMS OF DIFFERENTIAL EQUATIONS IN ARROWHEAD FORM ⋮ Inversion and pseudoinversion of block arrowhead matrices ⋮ An analytical method as a preconditioning modeling for systems of linear equations ⋮ An explicit formula for the inverse of arrowhead and doubly arrow matrices ⋮ A new family of \((I+S)\)-type preconditioner with some applications ⋮ An efficient method for computing the inverse of arrowhead matrices

This page was built for publication: Solving symmetric arrowhead and special tridiagonal linear systems by fast approximate inverse preconditioning