Uniform partition and the best least-squares piecewise polynomial approximation

DOI10.1017/S0004972700029725zbMath0722.41029OpenAlexW1964209377MaRDI QIDQ3209588

François Dubeau

Publication date: 1991

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0004972700029725

zbMATH Keywords

best least-squares piecewise polynomial approximation

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Approximation by polynomials (41A10)

Cites Work

• Unnamed Item
• Approximation of Curves by Line Segments
• On the approximation of curves by line segments using dynamic programming
• Note on "Approximation of Curves by Line Segments"
• Polygonal approximation by the minimax method
• Two Algorithms for Piecewise-Linear Continuous Approximation of Functions of One Variable
• Optimal Curve Fitting With Piecewise Linear Functions
• Further remarks on line segment curve-fitting using dynamic programming

This page was built for publication: Uniform partition and the best least-squares piecewise polynomial approximation