The aim of this paper is to give a very brief introduction to the emerging area of validated numerics. This is a rapidly growing field of research faced with the challenge of interfacing computer science and pure mathematics. Most validated numerics is based on interval analysis, which allows its users to account for both rounding and discretization errors in computer-aided proofs. We will illustrate the strengths of these techniques by converting the well-known bisection method into a efficient, validated root finder.
|Title of host publication||European Congress of Mathematics|
|Subtitle of host publication||Stockholm, June 27 – July 2, 2004|
|Place of Publication||Sweden|
|Publisher||European Mathematical Society|
|Number of pages||10|
|Publication status||Published - Jun 2005|