DeepAI AI Chat
Log In Sign Up

RLIBM-PROG: Progressive Polynomial Approximations for Fast Correctly Rounded Math Libraries

by   Mridul Aanjaneya, et al.
Rutgers University
Yale University

This paper presents a novel method for generating a single polynomial approximation that produces correctly rounded results for all inputs of an elementary function for multiple representations. The generated polynomial approximation has the nice property that the first few lower degree terms produce correctly rounded results for specific representations of smaller bitwidths, which we call progressive performance. To generate such progressive polynomial approximations, we approximate the correctly rounded result and formulate the computation of correctly rounded polynomial approximations as a linear program similar to our prior work on the RLibm project. To enable the use of resulting polynomial approximations in mainstream libraries, we want to avoid piecewise polynomials with large lookup tables. We observe that the problem of computing polynomial approximations for elementary functions is a linear programming problem in low dimensions, i.e., with a small number of unknowns. We design a fast randomized algorithm for computing polynomial approximations with progressive performance. Our method produces correct and fast polynomials that require a small amount of storage. A few polynomial approximations from our prototype have already been incorporated into LLVM's math library.


A Novel Approach to Generate Correctly Rounded Math Libraries for New Floating Point Representations

Given the importance of floating-point (FP) performance in numerous doma...

Dandelion: Certified Approximations of Elementary Functions

Elementary function operations such as sin and exp cannot in general be ...

RLIBM-32: High Performance Correctly Rounded Math Libraries for 32-bit Floating Point Representations

This paper proposes a set of techniques to develop correctly rounded mat...

Automatic Generation of Complete Polynomial Interpolation Hardware Design Space

Hardware implementations of complex functions regularly deploy piecewise...

Cubic spline approximation of the reliability polynomials of two dual hammock networks

The property of preserving the convexity and concavity of the Bernstein ...

Constructing Multilayer Perceptrons as Piecewise Low-Order Polynomial Approximators: A Signal Processing Approach

The construction of a multilayer perceptron (MLP) as a piecewise low-ord...