English
Related papers

Related papers: Optimal Polynomial Approximants in $H^p$

200 papers

This review paper highlights the main aspects of the development of research related to the solution of extreme problems in the theory of approximation in the spaces ${\mathcal S}^p$ and $B{\mathcal S}^p$ of periodic and almost periodic…

Classical Analysis and ODEs · Mathematics 2025-09-30 Anatolii Serdyuk , Andrii Shidlich

In the classical best approximation pair (BAP) problem, one is given two nonempty, closed, convex and disjoint subsets in a finite- or an infinite-dimensional Hilbert space, and the goal is to find a pair of points, each from each subset,…

Optimization and Control · Mathematics 2025-09-09 Daniel Reem , Yair Censor

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

We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{ \pm 1\}$ only. A basic case of our results states that for…

Information Theory · Computer Science 2022-12-08 C. Sinan Güntürk , Weilin Li

The main result is that the only non trivial closed ideal in the Banach algebra $L(L^p)$ of bounded linear operators on $L^p(0,1)$, $1\le p < \infty$, that has a left approximate identity is the ideal of compact operators. The algebra…

Functional Analysis · Mathematics 2024-02-22 William B. Johnson , Gideon Schechtman

Let $\mathcal{M}(\mathbb{R}^n)$ be the class of bounded away from one and infinity functions $p:\mathbb{R}^n\to[1,\infty]$ such that the Hardy-Littlewood maximal operator is bounded on the variable Lebesgue space…

Functional Analysis · Mathematics 2011-10-04 Alexei Yu. Karlovich , Ilya M. Spitkovsky

This paper is devoted to investigating the fundamental properties of the high-order proximal operator (HOPE) and the high-order Moreau envelope (HOME) in the nonconvex setting, where the quadratic regularization ($p=2$) is replaced by a…

Optimization and Control · Mathematics 2025-12-12 Alireza Kabgani , Masoud Ahookhosh

The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…

Computational Complexity · Computer Science 2018-01-16 Alexander A. Sherstov

We consider the zeros of exceptional orthogonal polynomials (XOP). Exceptional orthogonal polynomials were originally discovered as eigenfunctions of second order differential operators that exist outside the classical Bochner-Brenke…

Classical Analysis and ODEs · Mathematics 2020-09-22 Brian Simanek

For a bounded convex domain \Omega in R^N we prove refined Hardy inequalities that involve the Hardy potential corresponding to the distance to the boundary of \Omega, the volume of $\Omega$, as well as a finite number of sharp logarithmic…

Analysis of PDEs · Mathematics 2007-05-23 G. Barbatis , S. Filippas , A. Tertikas

Assume that $V_h$ is a space of piecewise polynomials of degree less than $r\geq 1$ on a family of quasi-uniform triangulation of size $h$. Then the following well-known upper bound holds for a sufficiently smooth function $u$ and $p\in [1,…

Numerical Analysis · Mathematics 2011-06-23 Qun Lin , Hehu Xie , Jinchao Xu

We introduce appropriate computable moduli of smoothness to characterize the rate of best approximation by multivariate polynomials on a connected and compact $C^2$-domain $\Omega\subset \mathbb{R}^d$. This new modulus of smoothness is…

Classical Analysis and ODEs · Mathematics 2025-04-15 Feng Dai , Andriy Prymak

The algorithms of Pan (1995) and(2002) approximate the roots of a complex univariate polynomial in nearly optimal arithmetic and Boolean time but require precision of computing that exceeds the degree of the polynomial. This causes…

Symbolic Computation · Computer Science 2016-11-10 Victor Y. Pan , Elias P. Tsigaridas , Vitaly Zaderman , Liang Zhao

Let $p(\cdot)$ be a measurable function defined on a probability space satisfying $0<p_-:={\rm ess}\inf_{x\in \Omega}p(x)\leq {\rm ess}\sup_{x\in\Omega}p(x)=:p_+<\infty$. We investigate five types of martingale Hardy spaces $H_{p(\cdot)}$…

Probability · Mathematics 2020-01-27 Yong Jiao , Ferenc Weisz , Dejian Zhou , Lian Wu

Let $\theta$ be an inner function on the unit disk, and let $K^p_\theta:=H^p\cap\theta\overline{H^p_0}$ be the associated star-invariant subspace of the Hardy space $H^p$, with $p\ge1$. While a nontrivial function $f\in K^p_\theta$ is never…

Complex Variables · Mathematics 2017-09-14 Konstantin M. Dyakonov

This is a survey on best polynomial approximation on the unit sphere and the unit ball. The central problem is to describe the approximation behavior of a function by polynomials via smoothness of the function. A major effort is to identify…

Classical Analysis and ODEs · Mathematics 2014-02-25 Yuan Xu

Let $\mathcal{M}$ be a $\sigma$-finite von Neumann algebra, equipped with a normal faithful state $\varphi$, and let $\mathcal{A}$ be a maximal subdiagonal subalgebra of $\mathcal{M}$. We have proved that for $0< p<1$, $H^p(\mathcal{A})$ is…

Operator Algebras · Mathematics 2024-05-31 Turdebek N. Bekjan

This monograph is devoted to the study of the weighted Bergman space $A^p_\om$ of the unit disc $\D$ that is induced by a radial continuous weight $\om$ satisfying {equation}\label{absteq} \lim_{r\to…

Complex Variables · Mathematics 2012-10-12 José Ángel Peláez , Jouni Rättyä

We study the composition operators of the Hardy space on D $\infty$ $\cap$ {\ell} 1 , the {\ell} 1 part of the infinite polydisk, and the behavior of their approximation numbers.

Functional Analysis · Mathematics 2017-03-16 Daniel Li , Hervé Queffélec , L Rodríguez-Piazza

Let $p\in\mathbb{Z}[x]$ be an arbitrary polynomial of degree $n$ with $k$ non-zero integer coefficients of absolute value less than $2^\tau$. In this paper, we answer the open question whether the real roots of $p$ can be computed with a…

Numerical Analysis · Computer Science 2014-01-24 Michael Sagraloff
‹ Prev 1 3 4 5 6 7 10 Next ›