On the complexity of computing error bounds
From MaRDI portal
Publication:5944040
zbMath0997.65074MaRDI QIDQ5944040
James W. Demmel, Gregorio Malajovich, B. Diament
Publication date: 5 November 2002
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Theory of matrix inversion and generalized inverses (15A09) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Numerical computation of matrix norms, conditioning, scaling (65F35) Complexity and performance of numerical algorithms (65Y20)
Related Items (5)
Highly accurate verified error bounds for Krylov type linear system solvers ⋮ Finding the orthogonal projection of a point onto an affine subspace ⋮ The average condition number of most tensor rank decomposition problems is infinite ⋮ Probabilistic condition number estimates for real polynomial systems. I: A broader family of distributions ⋮ Subspace Iteration Randomization and Singular Value Problems
Uses Software
This page was built for publication: On the complexity of computing error bounds
