Skip to main content

Ten Digit Problems

  • Chapter

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   44.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Further Reading

  1. Folkmar Bornemann, Dirk Laurie, Stan Wagon, and Jörg Waldvogel, The SIAM 100-Digit Challenge: A Study in High-Accuracy Numerical Computing. SIAM, Philadelphia (2004)

    MATH  Google Scholar 

  2. Jonathan M. Borwein and David H. Bailey, Mathematics by Experiment: Plausible Reasoning in the 21st Century. AK Peters, Natick (2003)

    Google Scholar 

  3. W. Timothy Gowers, June Barrow-Green, and Imre Leader (editors), The Princeton Companion to Mathematics. Princeton University Press, Princeton (2008)

    MATH  Google Scholar 

  4. T. Wynn Tee and Lloyd N. Trefethen, A rational spectral collocation method with adaptively transformed Chebyshev grid points. SIAM Journal of Scientific Computing 28, 1798–1811 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  5. Lloyd N. Trefethen, Ten digit algorithms. Numerical Analysis Technical Report NA-05/13, Oxford University Computing Laboratory. http://www.comlab.ox.ac.uk/oucl/publications/natr/

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lloyd N. Trefethen .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Trefethen, L.N. (2011). Ten Digit Problems. In: Schleicher, D., Lackmann, M. (eds) An Invitation to Mathematics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19533-4_9

Download citation

Publish with us

Policies and ethics