ON THE RATE OF CONVERGENCE AND COMPLEXITY OF NORMALIZED IMPLICIT PRECONDITIONING FOR SOLVING FINITE DIFFERENCE EQUATIONS IN THREE SPACE VARIABLES
DOI10.1142/S0219876204000174zbMath1083.65102MaRDI QIDQ5695060
George A. Gravvanis, Konstantinos M. Giannoutakis
Publication date: 11 October 2005
Published in: International Journal of Computational Methods (Search for Journal in Brave)
computational complexity; rate of convergence; numerical results; elliptic boundary value problems; conjugate gradient-type methods; implicit preconditioning methods; finite difference discretization method; approximate sparse factorization procedures; parse symmetric positive definite diagonally dominant matrix; self-adjoint partial differential equation
65F50: Computational methods for sparse matrices
35J25: Boundary value problems for second-order elliptic equations
65N12: Stability and convergence of numerical methods for boundary value problems involving PDEs
65F35: Numerical computation of matrix norms, conditioning, scaling
65N06: Finite difference methods for boundary value problems involving PDEs
65F05: Direct numerical methods for linear systems and matrix inversion
