Interpolation of data by smooth non-negative functions

2016/03/07 by Fefferman, Charles, Israel, Arie, Luli, Garving K. · 1 citation
#Classical Analysis and ODEs (math.CA) #FOS: Mathematics #Numerical Analysis (math.NA) #Optimization and Control (math.OC)

paper · doi:10.48550/arxiv.1603.02330

Abstract

We prove a finiteness principle for interpolation of data by nonnegative Cm functions. Our result raises the hope that one can start to understand constrained interpolation problems in which e.g. the interpolating function F is required to be nonnegative.

Cited by

• A constructive approach to strengthen algebraic descriptions of function and operator classes

Related

• Nonnegative C²(ℝ²) interpolation
• Test Functions in Constrained Interpolation
• Finiteness Principles for Smooth Selection
• The interpolation problem: When can you pass a curve of a given type through N random points in space?
• Rigidity, boundary interpolation and reproducing kernels