Approximation complexity for piecewise monotone functions and real data

DOI10.1016/0898-1221(94)90065-5zbMath0794.41006OpenAlexW2037879814MaRDI QIDQ1323607

V. Pereyra

Publication date: 5 September 1994

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(94)90065-5

zbMATH Keywords

complexityapproximation errorbest piecewise monotone approximation

Mathematics Subject Classification ID

Rate of convergence, degree of approximation (41A25)

Related Items (1)

An optimal linear time algorithm for quasi-monotonic segmentation1

Cites Work

• Best quasi-convex uniform approximation
• Best piecewise monotone uniform approximation
• An O(n) algorithm for least squares quasi-convex approximation
• Isotone optimization. I
• Moduli of Monotonicity with Applications to Monotone Polynomial Approximation
• Seven Kinds of Convexity

This page was built for publication: Approximation complexity for piecewise monotone functions and real data