Article Contents
Article Contents

# Interpolation by linear programming I

• Given $m , n \geq 2$ and $\epsilon > 0$, we compute afunction taking prescribed values at $N$ given points of $\mathbb{R}^n$,and having $C^m$norm as small as possible up to a factor $1 + \epsilon$. Ourcomputation reduces matters to a linear programming problem.
Mathematics Subject Classification: 65D05, 65D17.

 Citation:

•  [1] C. Fefferman, The $C^m$ norm of a function with prescribed jets II, Revista Mathemática Iberoamericana, 25 (2009), 275-421. [2] C. Fefferman, "Interpolation by Linear Programming II,'' (to appear). [3] E. LeGruyer, Minimal Lipschitz extensions to differentiable functions defined on a Hilbert space, Geometric and Functional Analysis, 19 (2009), 1101-1118.doi: 10.1007/s00039-009-0027-1.
Open Access Under a Creative Commons license