MFMartin Franců
Martin Franců
*This is an algorithmically generated author record based on publicly available information.
Research Subjects
Martin Franců has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Gord Sinnamon
Department of Mathematics, Western University, London, Canada
2 shared publications - Ron Kerman
Department of Mathematics and Statistics, Brock University, St. Catharines, Canada
2 shared publications
Latest Publications
- 16 August 2017
- Published by Institute of Mathematics, Czech Academy of Sciences
- Vol. 67 (4) , 1071-1093
A new algorithm for approximating the least concave majorant
Institute of Mathematics of the Czech Academy of Sciences
- 16 August 2017
- Published by Institute of Mathematics, Czech Academy of Sciences
- Vol. 67 (4) , 1071-1093
A new algorithm for approximating the least concave majorant
Institute of Mathematics of the Czech Academy of Sciences
- Open Access
A New Algorithm for Approximating the Least Concave Majorant
The least concave majorant, $\hat F$, of a continuous function $F$ on a closed interval, $I$, is defined by \[ \hat F (x) = \inf \left\{ G(x): G \geq F, G \mbox{ concave}\right\},\; x \in I. \] We present here 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.Open AccessA New Algorithm for Approximating the Least Concave Majorant
The least concave majorant, $\hat F$, of a continuous function $F$ on a closed interval, $I$, is defined by \[ \hat F (x) = \inf \left\{ G(x): G \geq F, G \mbox{ concave}\right\},\; x \in I. \] We present here 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. - 5 September 2016
- Published by Wiley in Mathematische Nachrichten
- Vol. 290 (7) , 1033-1052
Higher‐order Sobolev‐type embeddings on Carnot–Carathéodory spaces
- 5 September 2016
- Published by Wiley in Mathematische Nachrichten
- Vol. 290 (7) , 1033-1052
Higher‐order Sobolev‐type embeddings on Carnot–Carathéodory spaces