Lecture 3

Eugene E. Tyrtyshnikov
Additional contact information
Eugene E. Tyrtyshnikov: Russian Academy of Sciences, Institute of Numerical Mathematics

A chapter in A Brief Introduction to Numerical Analysis, 1997, pp 21-29 from Springer

Abstract: Abstract 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?

Keywords: Condition Number; Spectral Radius; Piecewise Linear Function; Nonsingular Matrix; Jordan Block (search for similar items in EconPapers)
Date: 1997
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-8176-8136-4_3

Ordering information: This item can be ordered from
http://www.springer.com/9780817681364

DOI: 10.1007/978-0-8176-8136-4_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().