Summary: We study functions \(F \in C^m(\mathbb R^n)\) having norm less than a given constant \(M\), and agreeing with a given function \(f\) on a finite set \(E\). Let \(\Gamma_f (S,M)\) denote the convex set formed by taking the \((m-1)\)-jets of all such \(F\) at a given finite set \(S \subset\mathbb R^n\). We provide an efficient algorithm to compute a convex polyhedron \(\widetilde{\Gamma}_f (S,M)\), such that \[ \Gamma_f (S,cM)\subset \widetilde{\Gamma}_f (S,M)\subset \Gamma_f (S,CM), \] where \(c\) and \(C\) depend only on \(m\) and \(n\).
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
- First draft of a report on the EDVAC
- Fitting a \(C^m\)-smooth function to data. I.
- Fitting a C^m-smooth function to data. III.
- scientific article; zbMATH DE number 3283057 (Why is no real title available?)
- scientific article; zbMATH DE number 3329342 (Why is no real title available?)
This page was built for publication: The jet of an interpolant on a finite set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q533392)
