Computing minimal interpolants in C^1,1(R^d)

DOI10.4171/RMI/927MaRDI QIDQ520710zbMATH OpenFDO

Authors Ariel Herbert-Voss, Matthew J. Hirn, Frederick McCollum

Publication date 5 April 2017

Published in Revista Matemática Iberoamericana (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1411.5668

zbMATH Keywords

InterpolationWhitney extension

Mathematics Subject Classification ID

Special properties of functions of several variables, Hölder conditions, etc. (26B35) Interpolation in approximation theory (41A05) Numerical interpolation (65D05)

Abstract: We consider the following interpolation problem. Suppose one is given a finite set $Esubsetmathbb{R}^d$, a function $f:EightarrowmathbbR$, and possibly the gradients of $f$ at the points of $E$. We want to interpolate the given information with a function $Fin{C}^{1,1}(mathbb{R}^d)$ with the minimum possible value of $mathrmLip(ablaF)$. We present practical, efficient algorithms for constructing an $F$ such that $mathrmLip(ablaF)$ is minimal, or for less computational effort, within a small dimensionless constant of being minimal.

Review text

In this paper the authors study an algorithm for computing interpolations of data consisting of a subset \(E\) of \(\mathbb R^d\) and either a real function \(f\) on \(E\) with function \(F\) whose derivatives are Lipschitz such that \(\mathrm{Lip}(\mathrm{grad}(F))\) is minimal. This is a very efficient algorithm.

Recommendations

• Minimum norm interpolation in the \(\ell_1(\mathbb{N})\) space
• Finite interpolation with minimum uniform norm in \(\mathbb{C}^n\)
• scientific article; zbMATH DE number 4157169
• Computing minimal interpolation bases
• On interpolation problems in C^N
• Minimal interpolation in spaces of analytic functions
• Complex interpolation, minimal methods and compact operators
• On the solution of the minimal rational interpolation problem
• A continuous minimax problem for calculating minimum norm polynomial interpolation points on the sphere
• scientific article; zbMATH DE number 3985818

Cites work

• Extension of functions satisfying Lipschitz conditions
• Fast/slow diffusion and growing sandpiles
• Minimization problems for the functional \(\displaystyle{\sup_x}\, F(x,f(x),f'(x))\). I, II
• Power Diagrams: Properties, Algorithms and Applications
• The quickhull algorithm for convex hulls

Cited in

(10)

• Explicit formulas for \(C^{1,1}\) and \(C_{\operatorname{conv}}^{1, \omega}\) extensions of 1-jets in Hilbert and superreflexive spaces
• \(C^{1, \omega }\) extension formulas for $1$-jets on Hilbert spaces
• Interpolation of Lipschitz functions
• Explicit formulas for \(C^{1,1}\) Glaeser-Whitney extensions of \(1\)-Taylor fields in Hilbert spaces
• Nearly optimal interpolation of data in \(C^2 (\mathbb{R}^2)\). I.
• The jet of an interpolant on a finite set
• Interpolation by linear programming. I
• Univariate range-restricted \(C^2\) interpolation algorithms
• A new algorithm for a recursive construction of the minimal interpolation space
• Lipschitz continuity of \(H^{\infty}\) interpolation

Describes a project that uses

Uses Software

• Qhull

This page was built for publication: Computing minimal interpolants in \(C^{1,1}(\mathbb{R}^d)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q520710)