pith. sign in

arxiv: 1902.07264 · v1 · pith:OXKGIEMUnew · submitted 2019-02-19 · 🧮 math.NA · cs.NA

Interpolation of scattered data in mathbb{R}³ using minimum L_p-norm networks, 1<p<infty

classification 🧮 math.NA cs.NA
keywords inftyproblemdatainterpolationmathbbnetworksnielsonnorm
0
0 comments X
read the original abstract

We consider the extremal problem of interpolation of scattered data in $\mathbb{R}^3$ by smooth curve networks with minimal $L_p$-norm of the second derivative for $1<p<\infty$. 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<\infty$ were announced without proof in (Vlachkova (1992)). Here we present a complete characterization of the solution for $1<p<\infty$. Numerical experiments are visualized and presented to illustrate and support our results.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.