A characterization theorem for the best L₁ piecewise monotonic data approximation problem

DOI10.1007/978-3-319-31317-7_7MaRDI QIDQ5359535zbMATH OpenOpenAlexFDO

Authors 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

data approximation problemdynamic programming procedurerandom errorsunivariate data

Mathematics Subject Classification ID

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

Recommendations

• A decomposition theorem for the least squares piecewise monotonic data approximation problem
• A Characterization Theorem for the Discrete Best Monotonic Approximation Problem
• A theorem for piecewise convex-concave data approximation.
• Best L1 piecewise monotonic data modelling
• A binary search algorithm for univariate data approximation and estimation of extrema by piecewise monotonic constraints

Cited in

(5)

• A theorem for piecewise convex-concave data approximation.
• An example of nondecomposition in data fitting by piecewise monotonic divided differences of order higher than two
• A decomposition theorem for the least squares piecewise monotonic data approximation problem
• A Characterization Theorem for the Discrete Best Monotonic Approximation Problem
• Best L1 piecewise monotonic data modelling

Describes a project that uses

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)