On the monotonicity of incomplete factorization

From MaRDI portal





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.











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)