### Abstract

We study functions F ε C^{m}(ℝ^{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 ⊂ ℝ^{n}. We provide an efficient algorithm to compute a convex polyhedron Γ_{f}(S, M), such that Γ_{f}(S, cM) ⊂ Γ_{f}(S, M) ⊂ Γ_{f}(S, CM), where c and C depend only on m and n.

Original language | English (US) |
---|---|

Pages (from-to) | 355-360 |

Number of pages | 6 |

Journal | Revista Matematica Iberoamericana |

Volume | 27 |

Issue number | 1 |

DOIs | |

State | Published - 2011 |

### All Science Journal Classification (ASJC) codes

- Mathematics(all)

### Keywords

- Algorithm
- Interpolation
- Jet
- Whitney extension theorem

## Fingerprint Dive into the research topics of 'The Jet of an Interpolant on a Finite Set'. Together they form a unique fingerprint.

## Cite this

Fefferman, C., & Israel, A. (2011). The Jet of an Interpolant on a Finite Set.

*Revista Matematica Iberoamericana*,*27*(1), 355-360. https://doi.org/10.4171/RMI/639