On the monotonicity of incomplete factorization
The Meijerink, van der Vorst type incomplete decomposition uses a position set, where the factors must be zero, but their product may differ from the original matrix. The smaller this position set is, the more the product of incomplete factors resembles the original matrix. The aim of this paper is to discuss this type of monotonicity. It is shown using the Perron Frobenius theory of nonnegative matrices, that the spectral radius of the iteration matrix is a monotone function of the position set. On the other hand no matrix norm of the iteration matrix depends monotonically on the position set. Comparison is made with the modified incomplete factorization technique.
- A class of first order factorization methods
- A generalized SSOR method
- A survey of preconditioned iterative methods for linear systems of algebraic equations
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Comparisons of regular splittings of matrices
- Existence Criteria for Partial Matrix Factorizations in Iterative Methods
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- scientific article; zbMATH DE number 434783 (Why is no real title available?)
- An Analysis of the Robustness of Some Incomplete Factorizations
- On the Complexity of the Montes Ideal Factorization Algorithm
- Factorization of delta-monotone linear mappings
- A New Black Box Factorization Algorithm - the Non-monic Case
This page was built for publication: On the monotonicity of incomplete factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1824348)