On the complexity of computing error bounds (Q5944040): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: mctoolbox / rank | |||
Normal rank | |||
Revision as of 18:44, 29 February 2024
scientific article; zbMATH DE number 1649118
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of computing error bounds |
scientific article; zbMATH DE number 1649118 |
Statements
On the complexity of computing error bounds (English)
0 references
5 November 2002
0 references
The authors study the cost of estimating the norm of an inverse matrix. They conjecture that finding even a coarse error bound is as costly as that of matrix inversion itself. Conversely, any fast condition estimate must sometimes mis-estimate by a sizable amount, specified quantitatively in the paper.
0 references
inverse matrix
0 references
norm estimate
0 references
complexity
0 references
condition number
0 references
error bound
0 references
matrix inversion
0 references
