Discrete Piecewise Monotonic Approximation by a Strictly Convex Distance Function

DOI10.2307/2153327zbMath0824.41019OpenAlexW1990970684MaRDI QIDQ4325721

I. C. Demetriou

Publication date: 3 April 1995

Full work available at URL: https://doi.org/10.2307/2153327

zbMATH Keywords

dynamic programmingdata smoothingisotonic distance functionpiecewise monotonic approximation

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Approximation with constraints (41A29)

Related Items (5)

A binary search algorithm for univariate data approximation and estimation of extrema by piecewise monotonic constraints ⋮ Separation theorems for the extrema of best piecewise monotonic approximations to successive data ⋮ A theorem for piecewise convex-concave data approximation. ⋮ An adaptive algorithm for least squares piecewise monotonic data fitting ⋮ Signs of divided differences yield least squares data fitting with constrained monotonicity or convexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Least Squares Smoothing of Univariate Data to achieve Piecewise Monotonicity
• A Characterization Theorem for the Discrete Best Monotonic Approximation Problem

This page was built for publication: Discrete Piecewise Monotonic Approximation by a Strictly Convex Distance Function