On the robustness of modified incomplete factorization methods

DOI10.1080/00207169208804099zbMath0766.65032MaRDI QIDQ4021060

Yvan Notay

Publication date: 17 January 1993

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169208804099

zbMATH Keywords

robustness; convergence acceleration; finite element; numerical tests; lower bound; finite difference; parameter optimization; second order elliptic; diagonally dominant Stieltjes matrix; perturbed modified incomplete factorization method

Mathematics Subject Classification ID

35J25: Boundary value problems for second-order elliptic equations

65N30: Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs

65F10: Iterative numerical methods for linear systems

65F35: Numerical computation of matrix norms, conditioning, scaling

65N06: Finite difference methods for boundary value problems involving PDEs

Related Items

Conditioning of Stieltjes matrices by S/P consistently ordered approximate factorizations

Cites Work

• On the rate of convergence of the preconditioned conjugate gradient method
• Upper eigenvalue bounds for pencils of matrices
• Lower eigenvalue bounds for pencils of matrices
• Conditioning analysis of positive definite matrices by approximate factorizations
• Conditioning analysis of modified block incomplete factorizations
• Approximate factorizations with S/P consistently ordered M-factors
• Incomplete factorizations of singular linear systems
• The effect of ordering on preconditioned conjugate gradients
• A class of first order factorization methods
• A generalized SSOR method
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item