On the robustness of modified incomplete factorization methods

DOI10.1080/00207169208804099MaRDI QIDQ4021060zbMATH OpenOpenAlexFDO

Authors 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

robustnessconvergence accelerationfinite differencelower boundfinite elementparameter optimizationnumerical testssecond order ellipticdiagonally dominant Stieltjes matrixperturbed modified incomplete factorization method

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Boundary value problems for second-order elliptic equations (35J25) Finite difference methods for boundary value problems involving PDEs (65N06) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)

Recommendations

• Robust incomplete factorization for nonsymmetric matrices
• An Analysis of the Robustness of Some Incomplete Factorizations
• Publication:3198793
• scientific article; zbMATH DE number 1286374
• Incomplete factorization methods and its application
• Effectiveness and robustness revisited for a preconditioning technique based on structured incomplete factorization
• Modification and compensation strategies for threshold-based incomplete factorizations
• Modified incomplete orthogonal factorization methods using Givens rotations
• scientific article; zbMATH DE number 434788

Cites work

• scientific article; zbMATH DE number 440637 (Why is no real title available?)
• scientific article; zbMATH DE number 440684 (Why is no real title available?)
• scientific article; zbMATH DE number 4174228 (Why is no real title available?)
• scientific article; zbMATH DE number 4190984 (Why is no real title available?)
• scientific article; zbMATH DE number 3138903 (Why is no real title available?)
• scientific article; zbMATH DE number 3854346 (Why is no real title available?)
• A class of first order factorization methods
• A generalized SSOR method
• Approximate factorizations with S/P consistently ordered M-factors
• Conditioning analysis of modified block incomplete factorizations
• Conditioning analysis of positive definite matrices by approximate factorizations
• Incomplete factorizations of singular linear systems
• Lower eigenvalue bounds for pencils of matrices
• On the rate of convergence of the preconditioned conjugate gradient method
• The effect of ordering on preconditioned conjugate gradients
• Upper eigenvalue bounds for pencils of matrices

Cited in

(3)

• Conditioning of Stieltjes matrices by S/P consistently ordered approximate factorizations
• Robustness of the Inner–Outer Factorization and of the Spectral Factorization for FIR Data
• An Analysis of the Robustness of Some Incomplete Factorizations

This page was built for publication: On the robustness of modified incomplete factorization methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4021060)