English
Related papers

Related papers: Minimum Sobolev norm interpolation of derivative d…

200 papers

The approximate degree of a Boolean function f is the least degree of a real polynomial that approximates f pointwise to error at most 1/3. Approximate degree is known to be a lower bound on quantum query complexity. We resolve or nearly…

Quantum Physics · Physics 2019-08-20 Mark Bun , Robin Kothari , Justin Thaler

We study the problem of space and time efficient evaluation of a nonparametric estimator that approximates an unknown density. In the regime where consistent estimation is possible, we use a piecewise multivariate polynomial interpolation…

Statistics Theory · Mathematics 2020-11-11 Paxton Turner , Jingbo Liu , Philippe Rigollet

A Dirichlet-type problem is studied for an equation of even order with variable coefficients. A criterion for the uniqueness of a solution is given. The solution is built in the form of a Fourier series. When justifying the convergence of…

Analysis of PDEs · Mathematics 2021-06-01 B. Irgashev

We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…

Weighted least squares polynomial approximation uses random samples to determine projections of functions onto spaces of polynomials. It has been shown that, using an optimal distribution of sample locations, the number of samples required…

Numerical Analysis · Mathematics 2017-10-10 Abdul-Lateef Haji-Ali , Fabio Nobile , Raúl Tempone , Sören Wolfers

We study in this paper the function approximation error of multivariate linear extrapolation. The sharp error bound of linear interpolation already exists in the literature. However, linear extrapolation is used far more often in…

Optimization and Control · Mathematics 2026-05-20 Liyuan Cao , Zaiwen Wen , Ya-xiang Yuan

Conventional sampling and interpolation commonly rely on discrete measurements. In this paper, we develop a theoretical framework for extrapolation of signals in higher dimensions from knowledge of the continuous waveform on bounded…

Signal Processing · Electrical Eng. & Systems 2020-08-04 Cornelius Frankenbach , Pablo Martínez-Nuevo , Martin Møller , Walter Kellermann

A solution manifold is the collection of points in a $d$-dimensional space satisfying a system of $s$ equations with $s<d$. Solution manifolds occur in several statistical problems including hypothesis testing, curved-exponential families,…

Statistics Theory · Mathematics 2021-12-15 Yen-Chi Chen

For every $m\in\mathbb{N}$, we establish the convergence of the averaged distributions of the zeros of the $m$-th order derivatives $(f^n)^{(m)}$ of the iterated polynomials $f^n$ of a polynomial $f\in\mathbb{C}[z]$ of degree $>1$ towards…

Dynamical Systems · Mathematics 2024-01-10 Yûsuke Okuyama

In this paper, the $mn$-dimensional space of tensor-product polynomials of two variables, of degree at most $(m-1)+(n-1)$, is considered. A theory of two-variate polynomials is developed by establishing the algebra and basic algebraic…

General Mathematics · Mathematics 2017-12-29 Dharm Prakash Singh , Amit Ujlayan

In this paper we develop a new approach to the design of direct numerical methods for multidimensional problems of the calculus of variations. The approach is based on a transformation of the problem with the use of a new class of…

Optimization and Control · Mathematics 2019-03-04 M. V. Dolgopolik

The hypothesis that high dimensional data tend to lie in the vicinity of a low dimensional manifold is the basis of manifold learning. The goal of this paper is to develop an algorithm (with accompanying complexity guarantees) for fitting a…

Statistics Theory · Mathematics 2013-12-23 Charles Fefferman , Sanjoy Mitter , Hariharan Narayanan

The approximate degree of a Boolean function $f: \{-1, 1\}^n \to \{-1, 1\}$ is the minimum degree of a real polynomial that approximates $f$ to within error $1/3$ in the $\ell_\infty$ norm. In an influential result, Aaronson and Shi (J. ACM…

Computational Complexity · Computer Science 2015-03-27 Mark Bun , Justin Thaler

We consider the problem of discretizing one-dimensional, real-valued functions as graphs. The goal is to find a small set of points, from which we can approximate the remaining function values. The method for approximating the unknown…

Numerical Analysis · Mathematics 2023-06-01 John Paul Ward

A full interpolation theory for Sobolev functions with smoothness between 0 and 1 and vanishing trace on a part of the boundary of an open set is established. Geometric assumptions are of mostly measure theoretic nature and reach beyond…

Classical Analysis and ODEs · Mathematics 2021-02-23 Sebastian Bechtel , Moritz Egert

We prove that almost every level set of a Sobolev function in a planar domain consists of points, Jordan curves, or homeomorphic copies of an interval. For monotone Sobolev functions in the plane we have the stronger conclusion that almost…

Classical Analysis and ODEs · Mathematics 2020-10-30 Dimitrios Ntalampekos

Multiresolution analyses based upon interpolets, interpolating scaling functions introduced by Deslauriers and Dubuc, are particularly well-suited to physical applications because they allow exact recovery of the multiresolution…

Materials Science · Physics 2009-10-31 Ross A. Lippert , T. A. Arias , Alan Edelman

This work investigates finite differences and the use of interpolation models to obtain approximations to the first and second derivatives of a function. Here, it is shown that if a particular set of points is used in the interpolation…

Optimization and Control · Mathematics 2020-01-24 Ian D. Coope , Rachael Tappenden

Let $\Lambda \subset R$ be a strictly increasing sequence. For $r = 1,2$, we give a simple explicit expression for an equivalent norm on the trace spaces $W_p^r(R)|_\Lambda$, $L_p^r(R)|_\Lambda$ of the non-homogeneous and homogeneous…

Functional Analysis · Mathematics 2014-01-21 Daniel Estévez

The intention of this note is two-fold. First, we study integer optimization problems in standard form defined by $A \in\mathbb{Z}^{m\times{}n}$ and present an algorithm to solve such problems in polynomial-time provided that both the…

Optimization and Control · Mathematics 2016-04-01 Stephan Artmann , Friedrich Eisenbrand , Christoph Glanzer , Timm Oertel , Santosh Vempala , Robert Weismantel