A fast segmentation algorithm for piecewise polynomial numeric function generators

DOI10.1016/J.CAM.2011.02.033zbMATH Open1218.65026OpenAlexW2134976914MaRDI QIDQ548302FDOQ548302

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

piecewise linear approximationnumerical approximationpiecewise polynomial approximationnumeric function generatorssegmentation algorithm

Mathematics Subject Classification ID

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

Cites Work

• 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
• On the number of segments needed in a piecewise linear approximation
• Title not available (Why is that?)

Cited In (4)

• 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
• Binary segmentation for multivariate polynomials
• Using piecewise polynomials for faster potential function evaluation

Uses Software

• SLEEF

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)