Chapter 1

Floating Point Computer Arythmetic

Krystyna STYš and Tadeusz STYš

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.

Total Pages: 1-26 (26)

Purchase Chapter  Book Details

RELATED BOOKS

.Advanced Mathematical Applications in Data Science.
.Markov Chain Process (Theory and Cases).
.Advances in Special Functions of Fractional Calculus: Special Functions in Fractional Calculus and Their Applications in Engineering.
.On Generalized Growth rates of Integer Translated Entire and Meromorphic Functions.