On the monotonicity of higher-order interval iterations for bounding the inverse matrix (Q1114304)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the monotonicity of higher-order interval iterations for bounding the inverse matrix |
scientific article; zbMATH DE number 4084850
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the monotonicity of higher-order interval iterations for bounding the inverse matrix |
scientific article; zbMATH DE number 4084850 |
Statements
On the monotonicity of higher-order interval iterations for bounding the inverse matrix (English)
0 references
1988
0 references
The article deals with modifications of a higher-order interval Schultz method for improving an initial inclusion for the inverse of a matrix. It is proved that the methods are strictly monotone in both bounds if this is the case for the first iteration step. A necessary and sufficient condition for the existence of such an initial inclusion is given as well as an easy-to-compute formula for it.
0 references
monotonicity
0 references
matrix inversion
0 references
bounds for the inverse matrix
0 references
higher- order interval Schultz method
0 references
0.93219197
0 references
0.89680547
0 references
0.8960428
0 references
0.8929774
0 references
0.88281983
0 references
