aalto1 untyped-item.component.html

Wilkinson’s Bus: Weak Condition Numbers, with an Application to Singular Polynomial Eigenproblems

Loading...
Thumbnail Image

Access rights

openAccess
publishedVersion

URL

Journal Title

Journal ISSN

Volume Title

A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä

Major/Subject

Mcode

Degree programme

Language

en

Pages

35

Series

Foundations of Computational Mathematics, Volume 20, issue 6, pp. 1439-1473

Abstract

We propose a new approach to the theory of conditioning for numerical analysis problems for which both classical and stochastic perturbation theories fail to predict the observed accuracy of computed solutions. To motivate our ideas, we present examples of problems that are discontinuous at a given input and even have infinite stochastic condition number, but where the solution is still computed to machine precision without relying on structured algorithms. Stimulated by the failure of classical and stochastic perturbation theory in capturing such phenomena, we define and analyse a weak worst-case and a weak stochastic condition number. This new theory is a more powerful predictor of the accuracy of computations than existing tools, especially when the worst-case and the expected sensitivity of a problem to perturbations of the input is not finite. We apply our analysis to the computation of simple eigenvalues of matrix polynomials, including the more difficult case of singular matrix polynomials. In addition, we show how the weak condition numbers can be estimated in practice.

Description

Other note

Citation

Lotz, M & Noferini, V 2020, 'Wilkinson’s Bus : Weak Condition Numbers, with an Application to Singular Polynomial Eigenproblems', Foundations of Computational Mathematics, vol. 20, no. 6, pp. 1439-1473. https://doi.org/10.1007/s10208-020-09455-y

Endorsement

Review

Supplemented By

Referenced By