On the monotonicity of incomplete factorization (Q1824348)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4117740
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the monotonicity of incomplete factorization |
scientific article; zbMATH DE number 4117740 |
Statements
On the monotonicity of incomplete factorization (English)
0 references
1990
0 references
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.
0 references
monotonicity
0 references
Perron Frobenius theory
0 references
nonnegative matrices
0 references
spectral radius
0 references
iteration matrix
0 references
incomplete factorization
0 references
M-matrices
0 references
0 references
0.7717940211296082
0 references
0.7701658010482788
0 references
