Interpolation of scattered data in R^3 using minimum L_p-norm networks, 1<p<∞

02/19/2019
by   Krassimira Vlachkova, et al.
0

We consider the extremal problem of interpolation of scattered data in R^3 by smooth curve networks with minimal L_p-norm of the second derivative for 1<p<∞. The problem for p=2 was set and solved by Nielson (1983). Andersson et al. (1995) gave a new proof of Nielson's result by using a different approach. Partial results for the problem for 1<p<∞ were announced without proof in (Vlachkova (1992)). Here we present a complete characterization of the solution for 1<p<∞. Numerical experiments are visualized and presented to illustrate and support our results.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/22/2022

Edge convex smooth interpolation curve networks with minimum L_∞-norm of the second derivative

We consider the extremal problem of interpolation of convex scattered da...
research
06/17/2021

Uniform Convergence of Interpolators: Gaussian Width, Norm Bounds, and Benign Overfitting

We consider interpolation learning in high-dimensional linear regression...
research
07/15/2020

Convexifying Sparse Interpolation with Infinitely Wide Neural Networks: An Atomic Norm Approach

This work examines the problem of exact data interpolation via sparse (n...
research
06/19/2019

Transfinite mean value interpolation over polygons

Mean value interpolation is a method for fitting a smooth function to pi...
research
11/03/2017

On Automata Recognizing Birecurrent Sets

In this note we study automata recognizing birecurrent sets. A set of wo...
research
06/02/2019

On The Radon--Nikodym Spectral Approach With Optimal Clustering

Problems of interpolation, classification, and clustering are considered...
research
03/26/2020

A Topological Characterization of Modulo-p Arguments and Implications for Necklace Splitting

The classes PPA-p have attracted attention lately, because they are the ...

Please sign up or login with your details

Forgot password? Click here to reset