English
Related papers

Related papers: Polynomial Approximation in $ L^2 $ of the Double …

200 papers

We study the problem of sampling from a distribution $\mu$ with density $\propto e^{-V}$ for some potential function $V:\mathbb R^d\to \mathbb R$ with query access to $V$ and $\nabla V$. We start with the following standard assumptions: (1)…

Data Structures and Algorithms · Computer Science 2026-02-10 Yuchen He , Zhehan Lei , Jianan Shao , Chihao Zhang

In this paper, we first consider the graph of $(F_1,F_{2},\cdots,F_{n})$ on $\overline{\mathbb{D}}^{n},$ where $F_{j}(z)=\bar{z}^{m_{j}}_{j}+R_{j}(z),j=1,2,\cdots,n,$ which has non-isolated CR-singularities if $m_{j}>1$ for some…

Complex Variables · Mathematics 2022-10-14 Golam Mostafa Mondal

In this paper, we provide strong $L_2$-rates of approximation of the integral-type functionals of Markov processes by integral sums. We improve the method developed in [2]. Under assumptions on the process formulated only in terms of its…

Probability · Mathematics 2015-08-13 Iurii Ganychenko

We comment on recent results in the field of information based complexity, which state (in a number of different settings), that approximation of infinitely differentiable functions is intractable and suffers from the curse of…

Numerical Analysis · Mathematics 2013-04-04 Jan Vybiral

Motivated by the application of Lyapunov methods to partial differential equations (PDEs), we study functional inequalities of the form $f(I_1(u),\ldots,I_k(u))\geq 0$ where $f$ is a polynomial, $u$ is any function satisfying prescribed…

Optimization and Control · Mathematics 2022-01-04 Giovanni Fantuzzi

We investigate non-adaptive methods of deep ReLU neural network approximation in Bochner spaces $L_2({\mathbb U}^\infty, X, \mu)$ of functions on ${\mathbb U}^\infty$ taking values in a separable Hilbert space $X$, where ${\mathbb…

Numerical Analysis · Mathematics 2022-12-15 Dinh Dũng , Van Kien Nguyen , Duong Thanh Pham

We investigate asymptotic polynomial approximation for a class of weighted Bloch functions in the unit disc. Our main result is a structural theorem on asymptotic polynomial approximation in the unit disc, in the flavor of the classical…

Complex Variables · Mathematics 2024-03-14 Adem Limani

We study the polynomial approximation of symmetric multivariate functions and of multi-set functions. Specifically, we consider $f(x_1, \dots, x_N)$, where $x_i \in \mathbb{R}^d$, and $f$ is invariant under permutations of its $N$…

Numerical Analysis · Mathematics 2023-02-06 Markus Bachmayr , Geneviève Dusson , Christoph Ortner , Jack Thomas

Let $A$ be a countable and discrete subset of ${\Bbb R}^d$, $d \ge 2$, of positive upper Beurling density. Let $K$ denote a bounded symmetric convex set with a smooth boundary and everywhere non-vanishing Gaussian curvature. It is known…

Classical Analysis and ODEs · Mathematics 2023-01-24 Alex Iosevich , Azita Mayeli

We study the $\ell_1$-low rank approximation problem, where for a given $n \times d$ matrix $A$ and approximation factor $\alpha \geq 1$, the goal is to output a rank-$k$ matrix $\widehat{A}$ for which $$\|A-\widehat{A}\|_1 \leq \alpha…

Data Structures and Algorithms · Computer Science 2020-04-17 Zhao Song , David P. Woodruff , Peilin Zhong

We consider the problem of approximating an analytic function on a compact interval from its values at $M+1$ distinct points. When the points are equispaced, a recent result (the so-called impossibility theorem) has shown that the best…

Numerical Analysis · Mathematics 2018-04-09 Ben Adcock , Rodrigo Platte , Alexei Shadrin

This short note gives a sufficient condition for having the class of polynomials dense in the space of square integrable functions with respect to a finite measure dominated by the Lebesgue measure in the real line, here denoted by $L^2$.…

Classical Analysis and ODEs · Mathematics 2016-03-14 Rodrigo Labouriau

New sequences of orthogonal polynomials with respect to the weight functions $e^{-x} \rho_\nu(x),\ e^{- 1/x} x^{-1} \rho_{\nu} (x), \rho_{\nu}(x)= 2 x^{\nu/2} K_\nu(2\sqrt x),\ x >0, \nu \in \mathbb{R}$, where $K_\nu(z)$ is the modified…

Classical Analysis and ODEs · Mathematics 2019-02-19 Semyon Yakubovich

Lasserre [La] proved that for every compact set $K\subset\mathbb R^n$ and every even number $d$ there exists a unique homogeneous polynomial $g_0$ of degree $d$ with $K\subset G_1(g_0)=\{x\in\mathbb R^n:g_0(x)\leq 1\}$ minimizing $|G_1(g)|$…

Functional Analysis · Mathematics 2021-07-26 David Alonso-Gutiérrez , Bernardo González Merino , Rafael Villa

Given $k\in N$, a nonnegative function $f\in C^r[a,b]$, $r\ge 0$, an arbitrary finite collection of points $\big\{\alpha_i\big\}_{i\in J} \subset [a,b]$, and a corresponding collection of nonnegative integers $\big\{m_i\big\}_{i\in J}$ with…

Classical Analysis and ODEs · Mathematics 2023-05-04 German Dzyubenko , Kirill A. Kopotun

We study approximation properties of weighted $L^2$-orthogonal projectors onto the space of polynomials of degree less than or equal to $N$ on the unit disk where the weight is of the generalized Gegenbauer form $x \mapsto…

Numerical Analysis · Mathematics 2017-07-07 Leonardo E. Figueroa

Polynomial series approximations are a central theme in approximation theory due to their utility in an abundance of numerical applications. The two types of series, which are featured most prominently, are Taylor series expansions and…

General Mathematics · Mathematics 2025-09-08 Aleš Wodecki , Shenyuan Ma

We study the de la Vallee Poussin mean for exponential weights and give a polynomial approximation on real line. H. N. Mhasker proved the corresponding result for Freud-type weights. Our proof is valid for Erdos-type weights.

Classical Analysis and ODEs · Mathematics 2015-03-06 K. Itoh , R. Sakai , N. Suzuki

Let W: R to (0,1] be continuous. Bernstein's approximation problem, posed in 1924, deals with approximation by polynomials in the weighted uniform norm ||fW|| Linfinity(R) . The qualitative form of this problem was solved by Achieser,…

Classical Analysis and ODEs · Mathematics 2007-05-23 Doron S Lubinsky

We present an algorithm for computing asymptotic approximations of roots of polynomials with exp-log function coefficients. The real and imaginary parts of the approximations are given as explicit exp-log expressions. We provide a method…

Symbolic Computation · Computer Science 2019-04-16 Adam Strzeboński
‹ Prev 1 4 5 6 7 8 10 Next ›