Ten Digit Problems

Lloyd N. Trefethen ()
Additional contact information
Lloyd N. Trefethen: Oxford University Mathematical Institute

A chapter in An Invitation to Mathematics, 2011, pp 119-136 from Springer

Abstract: Abstract Most quantitative mathematical problems cannot be solved exactly, but there are powerful algorithms for solving many of them numerically to a specified degree of precision like ten digits or ten thousand. In this article three difficult problems of this kind are presented, and the story is told of the SIAM 100-Dollar, 100-Digit Challenge. The twists and turns along the way illustrate some of the flavor of algorithmic continuous mathematics.

Keywords: Exact Formula; Richardson Extrapolation; Perfect Score; Parking Problem; Brute Force Algorithm (search for similar items in EconPapers)
Date: 2011
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-3-642-19533-4_9

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

DOI: 10.1007/978-3-642-19533-4_9

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