On the robustness of modified incomplete factorization methods
Publication:4021060
DOI10.1080/00207169208804099zbMath0766.65032OpenAlexW1984828294MaRDI QIDQ4021060
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
robustnessconvergence accelerationfinite elementnumerical testslower boundfinite differenceparameter optimizationsecond order ellipticdiagonally dominant Stieltjes matrixperturbed modified incomplete factorization method
Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Finite difference methods for boundary value problems involving PDEs (65N06)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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