A Survey of Error Analysis

Summary

Rounding error is just one kind of error, and an easier kind to analyze than some others, and error and uncertainty in data is a more important kind, and not so easy to estimate nor analyze; here is where error analysts are currently busiest.

Keywords

Round-off error, Rounding, Computer science, Error analysis, Error detection and correction

References

No references recorded for this paper.

Cited by

Functional stability analysis of numerical algorithmsThomas Harvey Rowan — 1990
Opérateurs et engins de calcul en virgule flottante et leur application à la simulation en temps réel sur FPGATarek Ould Bachir — 2013
CS 279 Annotated Course BibliographyDavid Bindel, Judy Hu — 2001
Remarks on the complexity of roundoff analysisWebb Miller — 1974
Experiments with data perturbations to study condition numbers and numerical stabilityJocelyne Erhel — 1993
An Improved Algorithm for Crossdating Tree-Ring SeriesMartin A. R. Munro — 1984
On iterative algorithms for the polar decomposition of a matrix and the matrix sign functionAndrzej Kiełbasiński, Paweł Zieliński, Krystyna Ziętak — 2015
Foundations of Acoustic Methods Used in Non-Destructive Inspection of Laminated MaterialsА. В. Кононов — 2003
Introduction to Interval AnalysisRamon E. Moore, R. Baker Kearfott, Michael J. Cloud — 2009
Surface approximations in geometric modelingJung‐Hong Chuang, Christoph M. Hoffmann — 1990
Interval Mathematics: Proceedings of the International Symposium Karlsruhe, West Germany, May 20–24, 1975Karl Nickel — 1975
Self-Alignment Schemes for the Implementation of Addition-Related Floating-Point OperatorsTarek Ould‐Bachir, Jean‐Pierre David — 2013
Accurate Sum and Dot ProductTakeshi Ogita, Siegfried M. Rump, Shin’ichi Oishi — 2005
Test for (IN) equality, subtraction, proof of correctnessCharles B. Dunham — 1986
Performance of Gauss implicit Runge-Kutta methods on separable Hamiltonian systemsV. Antohe, I. Gladwell — 2003
Computational complexity and numerical stabilityWebb Miller — 1974
The INTEL® 8087 numeric data processorJ. Palmer — 1980
Toward mechanical verification of properties of roundoff error propagationWebb Miller — 1973
The Construction of Numerical Subroutine LibrariesWilliam J. Cody — 1974
Accurate Floating-Point Summation Part I: Faithful RoundingSiegfried M. Rump, Takeshi Ogita, Shin’ichi Oishi — 2008

Related papers

A floating-point technique for extending the available precisionT.J. Dekker — 1971
Rounding errors in algebraic processesWilkinson, James Hardy — 1964
INVERSE PROBLEMS NEWSLETTERNicholas J. Higham — 1999
The Art of Computer ProgrammingDonald E. Knuth — 1968
Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric PredicatesJonathan Richard Shewchuk — 1997
The algebraic eigenvalue problemJ. H. Wilkinson — 1965
Floating-point computationPat H. Sterbenz — 1973
Accurate Sum and Dot ProductTakeshi Ogita, Siegfried M. Rump, Shin’ichi Oishi — 2005
On properties of floating point arithmetics: numerical stability and the cost of accurate computationsDouglas M. Priest — 1992
IEEE Standard for Binary Floating Point ArithmeticAnsi Ieee — 1985