An algebraic multilevel iterative method of incomplete factorization for Stieltjes matrices
A more general formulation is given to a multilevel iterative method of incomplete factorization that was proposed earlier for solving five-point systems of equations with symmetric positive definite \(M\)-matrices. The quality of a preconditioner is improved with the use of special matrix polynomials, which recursively relate the preconditioners of two adjacent levels. The upper and lower bounds for the degrees of polynomials are determined from the conditions that an optimal order of computational complexity is preserved and an optimal rate of convergence is achieved.
- scientific article; zbMATH DE number 1438880
- Algebraic multilevel iteration method for Stieltjes matrices
- A survey of a class of algebraic multilevel iteration methods for positive definite symmetric matrices
- Algebraic multilevel iterative preconditioning methods for h-matrices
- An algebraic preconditioning method for M‐matrices: linear versus non‐linear multilevel iteration
This page was built for publication: An algebraic multilevel iterative method of incomplete factorization for Stieltjes matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1571188)