Article
Keywords:
least concave majorant; level function; spline approximation
Summary:
The least concave majorant, $\hat F$, of a continuous function $F$ on a closed interval, $I$, is defined by \[ \hat F (x) = \inf \{ G(x)\colon G \geq F,\ G \text { concave}\},\quad x \in I. \] We present an algorithm, in the spirit of the Jarvis March, to approximate the least concave majorant of a differentiable piecewise polynomial function of degree at most three on $I$. Given any function $F \in \mathcal {C}^4(I)$, it can be well-approximated on $I$ by a clamped cubic spline $S$. We show that $\hat S$ is then a good approximation to $\hat F$. \endgraf We give two examples, one to illustrate, the other to apply our algorithm.
References:
[1] Brudnyĭ, Y. A., Krugljak, N. Y.:
Interpolation Functors and Interpolation Spaces. Vol. 1. North-Holland Mathematical Library 47, Amsterdam (1991).
MR 1107298 |
Zbl 0743.46082
[6] Härdle, W., Kerkyacharian, G., Picard, D., Tsybakov, A.:
Wavelets, Approximation, and Statistical Applications. Lecture Notes in Statistics 129, Springer, Berlin (1998).
DOI 10.1007/978-1-4612-2222-4 |
MR 1618204 |
Zbl 0899.62002
[9] Lorentz, G. G.:
Bernstein Polynomials. Mathematical Expositions, no. 8. University of Toronto Press X, Toronto (1953).
MR 0057370 |
Zbl 0051.05001