On the Complexity of Computing Error Bounds
Copyright policy )On the Complexity of Computing Error Bounds
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.
- Federal University of Rio de Janeiro Brazil
- University of California, Berkeley United States
Complexity and performance of numerical algorithms, Numerical computation of matrix norms, conditioning, scaling, error bound, Norms of matrices, numerical range, applications of functional analysis to matrix theory, Theory of matrix inversion and generalized inverses, inverse matrix, complexity, matrix inversion, norm estimate, condition number
Complexity and performance of numerical algorithms, Numerical computation of matrix norms, conditioning, scaling, error bound, Norms of matrices, numerical range, applications of functional analysis to matrix theory, Theory of matrix inversion and generalized inverses, inverse matrix, complexity, matrix inversion, norm estimate, condition number
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).14 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!