A Characterization Theorem for the Best L 1 Piecewise Monotonic Data Approximation Problem

DOI10.1007/978-3-319-31317-7_7zbMATH Open1378.41004OpenAlexW2527953366MaRDI QIDQ5359535

Ioannis C. Demetriou

Publication date: 25 September 2017

Published in: Contributions in Mathematics and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-31317-7_7

zbMATH Keywords

dynamic programming procedurerandom errorsunivariate datadata approximation problem

Mathematics Subject Classification ID

Dynamic programming (90C39) Interpolation in approximation theory (41A05) Approximation with constraints (41A29) Algorithms for approximation of functions (65D15)

Uses Software

• L1PMA

This page was built for publication: A Characterization Theorem for the Best L 1 Piecewise Monotonic Data Approximation Problem

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