A fast segmentation algorithm for piecewise polynomial numeric function generators
From MaRDI portal
(Redirected from Publication:548302)
Recommendations
- Piecewise arithmetic expressions of numeric functions and their application to design of numeric function generators
- scientific article; zbMATH DE number 3854290
- An algorithm for segment approximation
- On the number of segments needed in a piecewise linear approximation
- Highly accurate tables for elementary functions
Cites work
- scientific article; zbMATH DE number 1109070 (Why is no real title available?)
- Numerical Function Generators Using LUT Cascades
- On the number of segments needed in a piecewise linear approximation
- Reciprocation, square root, inverse square root, and some elementary functions using small multipliers
- The Evolution of Babbage's Calculating Engines
Cited in
(5)- Piecewise linear approximation with minimum number of linear segments and minimum error: a fast approach to tighten and warm start the hierarchical mixed Integer formulation
- On the number of segments needed in a piecewise linear approximation
- Using piecewise polynomials for faster potential function evaluation
- Binary segmentation for multivariate polynomials
- Piecewise arithmetic expressions of numeric functions and their application to design of numeric function generators
This page was built for publication: A fast segmentation algorithm for piecewise polynomial numeric function generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548302)