Piecewise linear Chebyshev approximation of planar curves
From MaRDI portal
Publication:4743655
DOI10.1080/00207728308926468zbMath0506.65008OpenAlexW2052079017MaRDI QIDQ4743655
Publication date: 1983
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207728308926468
numerical resultsplanar curvesChebyshev error normparametric linear programming techniquespiecewise linear Chebyshev approximation
Numerical mathematical programming methods (65K05) Linear programming (90C05) Best approximation, Chebyshev systems (41A50) Algorithms for approximation of functions (65D15)
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal segmented approximations
- Uniform piecewise polynomial approximation with variable joints
- Computational methods for best spline function approximation
- Chebyshev approximation by spline functions with free knots
- Characteristic properties of the segmented rational minmax approximation problem
- On the approximation of curves by line segments using dynamic programming
- Polygonal approximation by the minimax method
- Functional approximation of planar curves via adaptive segmentation
- Two Algorithms for Piecewise-Linear Continuous Approximation of Functions of One Variable
- On the Best Linear Chebyshev Approximation
- Optimal Curve Fitting With Piecewise Linear Functions
- Curve Fitting with Piecewise Polynomials
- Waveform Segmentation Through Functional Approximation
This page was built for publication: Piecewise linear Chebyshev approximation of planar curves