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

Abstract

We consider the extremal problem of interpolation of convex scattered data in R3 by smooth edge convex curve networks with minimal Lp-norm of the second derivative for 1<p≤∞. The problem for p=2 was set and solved by Andersson et al. (1995). Vlachkova (2019) extended the results in (Andersson et al., 1995) and solved the problem for 1<p<∞. The minimum edge convex Lp-norm network for 1<p<∞ is obtained from the solution to a system of nonlinear equations with coefficients determined by the data. The solution in the case 1<p<∞ is unique for strictly convex data. The corresponding extremal problem for p=∞ remained open. Here we show that the extremal interpolation problem for p=∞ always has a solution. We give a characterization of this solution. We show that a solution to the problem for p=∞ can be found by solving a system of nonlinear equations in the case where it exists.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…