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) 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$. We give two examples, one to illustrate, the other to apply our algorithm., Martin Franců, Ron Kerman, Gord Sinnamon., and Obsahuje bibliografii
V práci je prezentovaná moderná paradigma darvinovskej evolúcie, ktorá ju chápe ako univerzálny optimalizačný algoritmus, aplikovateľný nielen v biologických vedách, ale aj v roznych oblastiach tak exaktných, ako aj sociálnych a behaviorálnych vied., Vladimír Kvasnička, Jiří Pospíchal., and Obsahuje bibliografii