Further remarks on line segment curve-fitting using dynamic programming

DOI10.1145/368637.368753MaRDI QIDQ5722561zbMATH OpenOpenAlexFDO

Authors B. Gluss

Publication date 1962

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/368637.368753

zbMATH Keywords

numerical analysis

Cited in

(6)

• Uniform piecewise polynomial approximation with variable joints
• An algorithm for continuous piecewise linear bounding of discrete time series data
• Approximation and allocation
• On the approximation of trajectories and its applications to control systems optimization problems
• Segmental differential approximation and the 'black box' problem
• Uniform partition and the best least-squares piecewise polynomial approximation

This page was built for publication: Further remarks on line segment curve-fitting using dynamic programming

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