Lecture 3

  • Eugene E. Tyrtyshnikov


Suppose that we are to compute f(x) at some x. We know that algorithms sometimes do not produce very accurate answers. When thinking this over, we should comprehend that not only might an algorithm be “bad” but it might be a problem itself. An important question: how far can f(x) change when x goes through small perturbations?


Condition Number Spectral Radius Piecewise Linear Function Nonsingular Matrix Jordan Block 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    For more detail, see J. W. Demmel. On condition numbers and the distance to the nearest ill-posed problem. Numer. Math. 51, 251–289 (1987).MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 1997

Authors and Affiliations

  • Eugene E. Tyrtyshnikov
    • 1
  1. 1.Institute of Numerical MathematicsRussian Academy of SciencesMoscowRussia

Personalised recommendations