Abstract
In recent decades, condition numbers have joined forces with probabilistic analysis to give rise to a form of condition-based analysis of algorithms. In this paper we survey how this analysis is done via a number of examples. We precede this catalogue of examples with short primers on both condition numbers and probabilistic analyses.
Publisher
Cambridge University Press (CUP)
Subject
General Mathematics,Numerical Analysis
Reference51 articles.
1. On condition numbers and the distance to the nearest ill-posed problem
2. D. Armentano , C. Beltrán , P. Bürgisser , F. Cucker and M. Shub (2015b), A stable, polynomial-time algorithm for the eigenpair problem. Preprint. arXiv:1505.03290
3. D. Armentano , C. Beltrán , P. Bürgisser , F. Cucker and M. Shub (2015a), ‘Condition length and complexity for the solution of polynomial systems’, accepted by J. Found. Comput. Math.
4. On estimating the condition of eigenvalues and eigenvectors
5. Smoothed analysis of κ(A)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献