The Jet of an Interpolant on a Finite Set

Charles Fefferman, Arie Israel
2011 Revista matemática iberoamericana  
We study functions F ∈ C m (R n ) having norm less than a given constant M, and agreeing with a given function f on a finite set E. Let Γ f (S, M) denote the convex set formed by taking the (m − 1)jets of all such F at a given finite set S ⊂ R n . We provide an efficient algorithm to compute a convex polyhedronΓ f (S, M), such that 2000 Mathematics Subject Classification: 49K24, 52A35.
doi:10.4171/rmi/639 fatcat:yiy5d3acwzcp3lzlveldtvuddi