Advertisement

Finite Precision Arithmetic

  • Walter Gander
  • Martin J. Gander
  • Felix Kwok
Chapter
  • 7.5k Downloads
Part of the Texts in Computational Science and Engineering book series (TCSE, volume 11)

Abstract

Finite precision arithmetic underlies all the computations performed numerically, e.g. in Matlab; only symbolic computations, e.g. Maple, are largely independent of finite precision arithmetic. Historically, when the invention of computers allowed a large number of operations to be performed in very rapid succession, nobody knew what the influence of finite precision arithmetic would be on this many operations: would small rounding errors sum up rapidly and destroy results? Would they statistically cancel? The early days of numerical analysis were therefore dominated by the study of rounding errors, and made this rapidly developing field not very attractive (see the quote above).

Keywords

Condition Number Machine Precision IEEE Standard Decimal Digit Single Precision 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Walter Gander
    • 1
  • Martin J. Gander
    • 2
  • Felix Kwok
    • 2
  1. 1.Departement InformatikETH ZürichZürichSwitzerland
  2. 2.Section de MathématiquesUniversité de GenèveGenèveSwitzerland

Personalised recommendations