Two Algorithms for Piecewise-Linear Continuous Approximation of Functions of One Variable

DOI10.1109/T-C.1974.223961MaRDI QIDQ4770519zbMATH OpenFDO

Authors Ivan Tomek

Publication date 1974

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/T-C.1974.223961

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Pattern recognition, speech recognition (68T10)

Cited in

(15)

• Best piecewise constant approximation of a function of single variable
• INTEGER analysis of two-dimensional polygonal objects
• Data point selection for piecewise linear curve approximation
• Piecewise linear bounding of univariate nonlinear functions and resulting mixed integer linear programming-based solution methods
• The abstract domain of trapezoid step functions
• Asymptotically tight conic approximations for chance-constrained AC optimal power flow
• An optimal control approach to day-to-day congestion pricing for stochastic transportation networks
• Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production
• Piece wise linear least–squares approximation of planar curves
• Uniform partition and the best least-squares piecewise polynomial approximation
• Piecewise linear L₁approximation of planar curves†
• Polygonal approximation of planar curves in theL₁norm
• Piecewise linear Chebyshev approximation of planar curves
• On generalized predictive compression of continuous-time signal samples
• LinA: a faster approach to piecewise linear approximations using corridors and its application to mixed-integer optimization

This page was built for publication: Two Algorithms for Piecewise-Linear Continuous Approximation of Functions of One Variable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4770519)