Finding the "truncated" polynomial that is closest to a function

Details Finding the "truncated" polynomial that is closest to a function Finding the "truncated" polynomial that is closest to a function

2003-07-04

arxiv.org/abs/cs/0307009v1

Computer Science

Mathematical Software

14 pages, 1 figure

Scientific paper

When implementing regular enough functions (e.g., elementary or special functions) on a computing system, we frequently use polynomial approximations. In most cases, the polynomial that best approximates (for a given distance and in a given interval) a function has coefficients that are not exactly representable with a finite number of bits. And yet, the polynomial approximations that are actually implemented do have coefficients that are represented with a finite - and sometimes small - number of bits: this is due to the finiteness of the floating-point representations (for software implementations), and to the need to have small, hence fast and/or inexpensive, multipliers (for hardware implementations). We then have to consider polynomial approximations for which the degree-$i$ coefficient has at most $m_i$ fractional bits (in other words, it is a rational number with denominator $2^{m_i}$). We provide a general method for finding the best polynomial approximation under this constraint. Then, we suggest refinements than can be used to accelerate our method.

Affiliated with

Also associated with

No associations

Rating

Finding the "truncated" polynomial that is closest to a function does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Finding the "truncated" polynomial that is closest to a function, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finding the "truncated" polynomial that is closest to a function will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-513388