English
Related papers

Related papers: Fitting a Sobolev function to data

200 papers

We develop fast algorithms for solving regression problems on graphs where one is given the value of a function at some vertices, and must find its smoothest possible extension to all vertices. The extension we compute is the absolutely…

Machine Learning · Computer Science 2015-07-01 Rasmus Kyng , Anup Rao , Sushant Sachdeva , Daniel A. Spielman

We obtain new characterizations of the Sobolev spaces $\dot W^{1,p}(\mathbb{R}^N)$ and the bounded variation space $\dot{BV}(\mathbb{R}^N)$. The characterizations are in terms of the functionals $\nu_{\gamma} (E_{\lambda,\gamma/p}[u])$…

Functional Analysis · Mathematics 2024-05-08 Haim Brezis , Andreas Seeger , Jean Van Schaftingen , Po-Lam Yung

For each $p>1$ and each positive integer $m$ we use divided differences to give intrinsic characterizations of the restriction of the Sobolev space $W^m_p(R)$ to an arbitrary closed subset of the real line.

Functional Analysis · Mathematics 2019-11-20 Pavel Shvartsman

We consider optimization problems in the fractional order Sobolev spaces $H^s(\Omega)$, $s\in (0,1)$, with sparsity promoting objective functionals containing $L^p$-pseudonorms, $p\in (0,1)$. Existence of solutions is proven. By means of a…

Optimization and Control · Mathematics 2023-06-30 Harbir Antil , Daniel Wachsmuth

To improve convergence results obtained using a framework for unsymmetric meshless methods due to Schaback (Preprint G\"ottingen 2006), we extend, in two directions, the Sobolev bound due to Arcang\'eli et al. (Numer Math 107, 181-211,…

Numerical Analysis · Mathematics 2009-05-14 Andrew Corrigan , John Wallin , Thomas Wanner

The question if a given partial solution to a problem can be extended reasonably occurs in many algorithmic approaches for optimization problems. For instance, when enumerating minimal dominating sets of a graph $G=(V,E)$, one usually…

Computational Complexity · Computer Science 2018-10-11 Katrin Casel , Henning Fernau , Mehdi Khosravian Ghadikolaei , Jérôme Monnot , Florian Sikora

The problem is considered as to whether a monotone function defined on a subset P of a Euclidean space can be strictly monotonically extended to the whole space. It is proved that this is the case if and only if the function is {\em…

Optimization and Control · Mathematics 2022-10-21 Pavel Chebotarev

Maximizing a non-negative, monontone, submodular function $f$ over $n$ elements under a cardinality constraint $k$ (SMCC) is a well-studied NP-hard problem. It has important applications in, e.g., machine learning and influence…

Data Structures and Algorithms · Computer Science 2024-02-05 Philip Cervenjak , Junhao Gan , Anthony Wirth

This is the first of two works concerning the Sobolev calculus on metric measure spaces and its applications. In this work, we focus on several notions of metric Sobolev space and on their equivalence. More precisely, we give a systematic…

Functional Analysis · Mathematics 2024-04-18 Luigi Ambrosio , Toni Ikonen , Danka Lučić , Enrico Pasqualetto

This paper is devoted to the study of a generalization of Sobolev spaces for small $L^{p}$ exponents, i.e. $0<p<1$. We consider spaces defined as abstract completions of certain classes of smooth functions with respect to weighted…

Classical Analysis and ODEs · Mathematics 2014-04-18 Gustav Behm , Aron Wennman

A new set of symmetric correction functions is presented for high-order flux reconstruction, that expands upon, while incorporating, all previous correction function sets and opens the possibility for improved performance. By considering FR…

Numerical Analysis · Mathematics 2019-03-11 Will Trojak

Assuming the Generalized Riemann Hypothesis, we design a deterministic algorithm that, given a prime p and positive integer m=o(sqrt(p)/(log p)^4), outputs an elliptic curve E over the finite field F_p for which the cardinality of E(F_p) is…

Number Theory · Mathematics 2017-01-03 Igor E. Shparlinski , Andrew V. Sutherland

This paper studies the \emph{subset sampling} problem. The input is a set $\mathcal{S}$ of $n$ records together with a function $\textbf{p}$ that assigns each record $v\in\mathcal{S}$ a probability $\textbf{p}(v)$. A query returns a random…

Data Structures and Algorithms · Computer Science 2023-07-24 Jinchao Huang , Sibo Wang

A well-known result is that any Lipschitz domain is an extension domain for $W^{s,p}$. This paper extends this result to Lipschitz subsets of compact Lipschitz submanifolds of $\mathbb{R}^n$. We adapt the construction of an extension…

Functional Analysis · Mathematics 2026-01-23 Philipp Weder

In this paper we fix $1\le p<\infty$ and consider $(\Om,d,\mu)$ be an unbounded, locally compact, non-complete metric measure space equipped with a doubling measure $\mu$ supporting a $p$-Poincar\'e inequality such that $\Om$ is a uniform…

Functional Analysis · Mathematics 2022-12-15 Ryan Gibara , Nageswari Shanmugalingam

Let $\Omega \subseteq \mathbb{R}^d$ be open and $D\subseteq \partial\Omega$ be a closed part of its boundary. Under very mild assumptions on $\Omega$, we construct a bounded Sobolev extension operator for the Sobolev space $\mathrm{W}^{k ,…

Classical Analysis and ODEs · Mathematics 2021-02-17 Sebastian Bechtel , Russell M. Brown , Robert Haller-Dintelmann , Patrick Tolksdorf

In this paper we study approximations of functions of Sobolev spaces $W^2_{p,\loc}(\Omega)$, $\Omega\subset\mathbb R^n$, by Lipschitz continuous functions. We prove that if $f\in W^2_{p,\loc}(\Omega)$, $1\leq p<\infty$, then there exists a…

Analysis of PDEs · Mathematics 2021-09-14 Paz Hashash , Alexander Ukhlov

Polynomial approximation is studied in the Sobolev space $W_p^r(w_{\alpha,\beta})$ that consists of functions whose $r$-th derivatives are in weighted $L^p$ space with the Jacobi weight function $w_{\alpha,\beta}$. This requires…

Classical Analysis and ODEs · Mathematics 2017-11-01 Yuan Xu

For a class of reducible Hamiltonian partial differential equations (PDEs) with arbitrary spatial dimensions, quantified by a quadratic polynomial with time-dependent coefficients, we present a comprehensive classification of long-term…

Analysis of PDEs · Mathematics 2025-05-08 Zhenguo Liang , Jiawen Luo , Zhiyan Zhao

Given a text $T$ of length $n$ and a pattern $P$ of length $m$, the approximate pattern matching problem asks for computation of a particular \emph{distance} function between $P$ and every $m$-substring of $T$. We consider a…

Data Structures and Algorithms · Computer Science 2019-07-24 Jan Studený , Przemysław Uznański