Titlebook: Elementary Functions; Algorithms and Imple Jean-Michel Muller Textbook 2016Latest edition Springer Science+Business Media New York 2016 Ele

chassis

Extort

WAX

https://doi.org/10.1007/978-3-031-49234-1The shift-and-add algorithms presented in Chapters?. and?. allow us to obtain an .-bit approximation of the function being computed after about . iterations. This property makes most of these algorithms rather slow; their major interest lies in the simplicity of implementation, and in the small silicon area of designs.

輕而薄

拱形大橋

Life and Labour in Rural England, 1760–1850This chapter is devoted to the problems of preserving monotonicity and always getting correctly rounded results when implementing the elementary functions in floating-point arithmetic.

新字

arabesque

Introduction to Computer Arithmetic,The aim of this section is to provide the reader with some basic concepts of floating-point arithmetic, and to define notations that are used throughout the book.

Individual

The Classical Theory of Polynomial or Rational ApproximationsUsing a finite number of additions, subtractions, multiplications, and comparisons, the only functions of one variable that one can compute are ..

機(jī)制

HAIL

Polynomial EvaluationIn Chapters . and ., we have studied how a function can be approximated by a polynomial or a rational function. When actually implementing the approximation, one has to select the way to evaluate a polynomial in order to minimize the error and/or to maximize the speed.