A fast segmentation algorithm for piecewise polynomial numeric function generators

DOI10.1016/j.cam.2011.02.033zbMath1218.65026OpenAlexW2134976914MaRDI QIDQ548302

Tsutomu Sasao, C. L. Frenzen, Njuguna Macaria, Jon T. Butler

Publication date: 28 June 2011

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2011.02.033

zbMATH Keywords

numerical approximationsegmentation algorithmpiecewise linear approximationpiecewise polynomial approximationnumeric function generators

Mathematics Subject Classification ID

Computer science aspects of computer-aided design (68U07) Computation of special functions and constants, construction of tables (65D20)

Related Items (1)

On the number of segments needed in a piecewise linear approximation

Uses Software

• SLEEF

Cites Work

• Unnamed Item
• On the number of segments needed in a piecewise linear approximation
• Numerical Function Generators Using LUT Cascades
• Reciprocation, square root, inverse square root, and some elementary functions using small multipliers
• The Evolution of Babbage's Calculating Engines

This page was built for publication: A fast segmentation algorithm for piecewise polynomial numeric function generators