Abstract
In this chapter, propagation of round-off errors in floating point arithmetic operations of computers numbers is presented. The notions of the conditional number, stability and complexity of algorithms are introduced and illustrated by examples. The Horners scheme for evaluation of Polynomials is given to elucidate the optimal and well-conditioned algorithms when they are implemented in a computer system like Mathematica. The chapter ends with a set of questions.
Keywords: Computer numbers, Round-off errors.
Related Books
Boundary Element Methods for Heat Transfer with Phase Change Problems: Theory and Application
On Generalized Growth rates of Integer Translated Entire and Meromorphic Functions
Introductory Statistics
Advanced Mathematical Applications in Data Science
Advanced Calculus - Fundamentals of Mathematics
Advanced Numerical Methods for Complex Environmental Models: Needs and Availability
Advances in Time Series Forecasting
Advances in Time Series Forecasting
Current Developments in Mathematical Sciences
Current Developments in Mathematical Sciences