Steve Smale and the Geometry of Ill-Conditioning

James Demmel

Chapter 30 in From Topology to Computation: Proceedings of the Smalefest, 1993, pp 305-316 from Springer

Abstract: Abstract The work of Steve Smale and his colleagues on average case analysis of algorithms [30, 31] and modeling real computations [3, 32] introduced methods and models not previously used in numerical analysis and complexity theory. In particular, the use of integral geometry to bound the sizes of sets of problems where algorithms “go bad” and the introduction of a model of real computation to clearly formulate complexity questions have inspired a great deal of other work. In this chapter, we will survey past results and open problems in three areas: the probability that a random numerical problem is difficult, the complexity of condition estimation, and the use of regularization to solve ill-posed or ill-conditioned problems; we will define all these terms below.

Keywords: Condition Number; Complete Intersection; Matrix Inversion; Multiple Root; Integral Geometry (search for similar items in EconPapers)
Date: 1993
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-1-4612-2740-3_30

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

DOI: 10.1007/978-1-4612-2740-3_30

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 ().