Related papers: Fitting a Sobolev function to data

The paper describes the splines $Q_{n,k}(x,a)$, which for an arbitrary point $a\in(0;1)$ and an arbitrary function $y\in\mathring{W}^n_p[0;1]$ set the relations $y^{(k)}(a)=\int_0^1 y^{(n)}(x)Q^{(n)}_{n,k}(x,a)dx$. The relation of the…

We denote by $\ell(n)$ the minimal length of an addition chain leading to $n$ and we define the counting function $$ F(m,r):=\#\left\{n\in[2^m, 2^{m+1}):\ell(n)\le m+r\right\}, $$ where $m$ is a positive integer and $r\ge 0$ is a real…

Let $\Omega $ be an open subset of $\mathbb{R}^{N}$, and let $p,\, q:\Omega \rightarrow \left[ 1,\infty \right] $ be measurable functions. We give a necessary and sufficient condition for the embedding of the variable exponent space…

In this article, we give probabilistic versions of Sobolev embeddings on any Riemannian manifold $(M,g)$. More precisely, we prove that for natural probability measures on $L^2(M)$, almost every function belong to all spaces $L^p(M)$,…

We introduce a non-linear criterion which allows us to determine when a function can be written as a sum of functions belonging to homogeneous fractional spaces: for $\ell \in \mathbb{N}^*$, $s_i\in (0, 1)$ and $p_i \in [1, +\infty)$, $u :…

Submodular function minimization is a key problem in a wide variety of applications in machine learning, economics, game theory, computer vision, and many others. The general solver has a complexity of $O(n^3 \log^2 n . E +n^4 {\log}^{O(1)}…

Building on existing $hp$-adaptive algorithms driven by equilibrated-flux estimators from [ESAIM Math. Model. Numer. Anal. 57 (2023), 329--366] and the references therein, we propose a novel $h$-adaptive algorithm for a fixed polynomial…

We develop an algorithm for computing the solution of a large system of linear ordinary differential equations (ODEs) with polynomial inhomogeneity. This is equivalent to computing the action of a certain matrix function on the vector…

Here, a natural extension of Sobolev spaces is defined for a Finsler structure $F$ and it is shown that the set of all real $C^{\infty}$ functions with compact support on a forward geodesically complete Finsler manifold $(M, F)$, is dense…

We show well-posedness of the $p$-Laplace evolution equation on $\mathbb{R}^d$ with square integrable random initial data for arbitrary $1<p<\infty$ and arbitrary space dimension $d\in\mathbb{N}$. The noise term on the right-hand side of…

This paper reformulates the problem of finding a longest common increasing subsequence of the two given input sequences in a very succinct way. An extremely simple linear space algorithm based on the new formula can find a longest common…

We detail a simple procedure (easily convertible to an algorithm) for constructing from quasi-uniform samples of $f$ a sequence of linear spline functions converging to the monotone rearrangement of $f$, in the case where $f$ is an almost…

We consider the series expansion of the $L^p$-Hardy inequality of \cite{BFT2}, in the particular case where the distance is taken from an interior point of a bounded domain in $\mathbb{R}^n$ and $1<p\neq n$. For $p<n$ we improve it by…

Given $m \in \mathbb{N} \setminus \{0\}$ and a compact Riemannian manifold $\mathcal{N}$, we construct for every map $u$ in the critical Sobolev space $W^{m/(m + 1), m + 1} (\mathbb{S}^m, \mathcal{N})$, a map $U : \mathbb{B}^{m + 1} \to…

In this paper we completely solve the problem of finding the (upper) approximation order with respect to the Kolmogorov, Gel'fand, and linear widths for the embedding of the Sobolev spaces $W^{\alpha,p}$ and $W_{0}^{\alpha,p}$ in the…

For each $p>2$ we give intrinsic characterizations of the restriction of the homogeneous Sobolev space $L^1_p(R^2)$ to an arbitrary finite subset $E$ of $R^2$. The trace criterion is expressed in terms of certain weighted oscillations of…

Maximization of submodular functions under various constraints is a fundamental problem that has been studied extensively. A powerful technique that has emerged and has been shown to be extremely effective for such problems is the…

Integer programs with m constraints are solvable in pseudo-polynomial time in $\Delta$, the largest coefficient in a constraint, when m is a fixed constant. We give a new algorithm with a running time of $O(\sqrt{m}\Delta)^{2m} + O(nm)$,…

In order to construct regularizations of continuous linear functionals acting on Sobolev spaces such as $W_0^{1,q}(\Omega)$, where $1<q<\infty$ and $\Omega$ is a Lipschitz domain, we propose a projection method in negative Sobolev spaces…

This paper proposes a novel localized Fourier extension method for approximating non-periodic functions via domain segmentation. By partitioning the computational domain into subregions with uniform discretization scales, the method…