Title
Minimum Sobolev norm interpolation with trigonometric polynomials on the torus
Abstract
Let q ¿ 1 be an integer, y 1 , ¿ , y M ¿ - π , π ] q , and ¿ be the minimal separation among these points. Given the samples { f ( y j ) } j = 1 M of a smooth target function f of q variables, 2 π -periodic in each variable, we consider the problem of constructing a q-variate trigonometric polynomial of spherical degree O ( ¿ - 1 ) which interpolates the given data, remains bounded in the Sobolev norm (independent of ¿ or M) on - π , π ] q , and converges to the function f on the set where the data becomes dense. We prove that the solution of an appropriate optimization problem leads to such an interpolant. Numerical examples are given to demonstrate that this procedure overcomes the Runge phenomenon when interpolation at equidistant nodes on - 1 , 1 ] is constructed, and also provides a respectable approximation for bivariate grid data, which does not become dense on the whole domain.
Year
DOI
Venue
2013
10.1016/j.jcp.2013.03.041
J. Comput. Physics
Keywords
Field
DocType
sobolev norm,smooth target function,bivariate grid data,q-variate trigonometric polynomial,minimal separation,appropriate optimization problem,q variable,minimum sobolev norm interpolation,runge phenomenon,numerical example,equidistant node,multivariate interpolation
Integer,Discrete mathematics,Trigonometric polynomial,Mathematical optimization,Polynomial,Mathematical analysis,Runge's phenomenon,Interpolation,Sobolev space,Optimization problem,Mathematics,Bounded function
Journal
Volume
Issue
ISSN
249
C
0021-9991
Citations 
PageRank 
References 
6
0.53
4
Authors
3
Name
Order
Citations
PageRank
Shivkumar Chandrasekaran142540.54
K. R. Jayaraman260.53
Hrushikesh Narhar Mhaskar325761.07