No Arabic abstract
Given $ -infty< lambda < Lambda < infty $, $ E subset mathbb{R}^n $ finite, and $ f : E to [lambda,Lambda] $, how can we extend $ f $ to a $ C^m(mathbb{R}^n) $ function $ F $ such that $ lambdaleq F leq Lambda $ and $ ||F||_{C^m(mathbb{R}^n)} $ is within a constant multiple of the least possible, with the constant depending only on $ m $ and $ n $? In this paper, we provide the solution to the problem for the case $ m = 2 $. Specifically, we construct a (parameter-dependent, nonlinear) $ C^2(mathbb{R}^n) $ extension operator that preserves the range $[lambda,Lambda]$, and we provide an efficient algorithm to compute such an extension using $ O(Nlog N) $ operations, where $ N = #(E) $.
Let $ E subset mathbb{R}^2 $ be a finite set, and let $ f : E to [0,infty) $. In this paper, we address the algorithmic aspects of nonnegative $C^2$ interpolation in the plane. Specifically, we provide an efficient algorithm to compute a nonnegative $C^2(mathbb{R}^2)$ extension of $ f $ with norm within a universal constant factor of the least possible. We also provide an efficient algorithm to approximate the trace norm.
In this paper, we prove two improv
In this paper, we present a different proof on the discrete Fourier restriction. The proof recovers Bourgains level set result on Strichartz estimates associated with Schrodinger equations on torus. Some sharp estimates on $L^{frac{2(d+2)}{d}}$ norm of certain exponential sums in higher dimensional cases are established. As an application, we show that some discrete multilinear maximal functions are bounded on $L^2(mathbb Z)$.
In this paper, we consider a discrete restriction associated with KdV equations. Some new Strichartz estimates are obtained. We also establish the local well-posedness for the periodic generalized Korteweg-de Vries equation with nonlinear term $ F(u)p_x u$ provided $Fin C^5$ and the initial data $phiin H^s$ with $s>1/2$.
We propose a class of Pade interpolation problems whose solutions are expressible in terms of determinants of hypergeometric series.