Computing minimal interpolants in
Ariel Herbert-Voss
Harvard University, Cambridge, USAMatthew J. Hirn
Michigan State University, East Lansing, USAFrederick McCollum
New York University, USA
![Computing minimal interpolants in $C^{1,1}(\mathbb R^d)$ cover](/_next/image?url=https%3A%2F%2Fcontent.ems.press%2Fassets%2Fpublic%2Fimages%2Fserial-issues%2Fcover-rmi-volume-33-issue-1.png&w=3840&q=90)
Abstract
We consider the following interpolation problem. Suppose one is given a finite set , a function , and possibly the gradients of at the points of . We want to interpolate the given information with a function with the minimum possible value of Lip. We present practical, efficient algorithms for constructing an such that Lip is minimal, or for less computational effort, within a small dimensionless constant of being minimal.
Cite this article
Ariel Herbert-Voss, Matthew J. Hirn, Frederick McCollum, Computing minimal interpolants in . Rev. Mat. Iberoam. 33 (2017), no. 1, pp. 29–66
DOI 10.4171/RMI/927