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)

Mathematics Subject Classification ID

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

Cited in

(14)

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

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)