English
Related papers

Related papers: Some problems on optimal approximants

200 papers

For functions $f$ in Dirichlet-type spaces we study how to determine constructively optimal polynomials $p_n$ that minimize $\|p f-1\|_\alpha$ among all polynomials $p$ of degree at most $n$. Then we give upper and lower bounds for the rate…

Classical Analysis and ODEs · Mathematics 2015-07-03 Catherine Bénéteau , Alberto Condori , Constanze Liaw , Daniel Seco , Alan Sola

We study Dirichlet-type spaces $\mathfrak{D}_{\alpha}$ of analytic functions in the unit bidisk and their cyclic elements. These are the functions $f$ for which there exists a sequence $(p_n)_{n=1}^{\infty}$ of polynomials in two variables…

Functional Analysis · Mathematics 2015-07-03 Catherine Bénéteau , Alberto A. Condori , Constanze Liaw , Daniel Seco , Alan A. Sola

In previous works, an approach to the study of cyclic functions in reproducing kernel Hilbert spaces has been presented, based on the study of so called \emph{optimal polynomial approximants}. In the present article, we extend such approach…

Classical Analysis and ODEs · Mathematics 2020-06-08 Daniel Seco , Roberto Téllez

We discuss the notion of optimal polynomial approximants in multivariable reproducing kernel Hilbert spaces. In particular, we analyze difficulties that arise in the multivariable case which are not present in one variable, for example, a…

Complex Variables · Mathematics 2022-05-03 Meredith Sargent , Alan Sola

We study connections between orthogonal polynomials, reproducing kernel functions, and polynomials $p$ minimizing Dirichlet-type norms $\|pf-1\|_{\alpha}$ for a given function $f$. For $\alpha\in [0,1]$ (which includes the Hardy and…

Complex Variables · Mathematics 2016-12-26 Catherine Bénéteau , Dmitry Khavinson , Constanze Liaw , Daniel Seco , Alan A. Sola

We initiate the study of fine $p$-(super)minimizers, associated with $p$-harmonic functions, on finely open sets in metric spaces, where $1 < p < \infty$. After having developed their basic theory, we obtain the $p$-fine continuity of the…

Analysis of PDEs · Mathematics 2023-10-06 Anders Björn , Jana Björn , Visa Latvala

For various Hilbert spaces of analytic functions on the unit disk, we characterize when a function $f$ has optimal polynomial approximants given by truncations of a single power series. We also introduce a generalized notion of optimal…

Functional Analysis · Mathematics 2023-07-11 Christopher Felder

In the study of the cyclicity of a function $f$ in reproducing kernel Hilbert spaces an important role is played by sequences of polynomials $\{p_n\}_{n\in \mathbb{N}}$ called \emph{optimal polynomial approximants} (o.p.a.). For many such…

Complex Variables · Mathematics 2021-10-14 Antonio Acuaviva , Daniel Seco

We study lower bounds for the norm of the product of polynomials and their applications to the so called \emph{plank problem.} We are particularly interested in polynomials on finite dimensional Banach spaces, in which case our results…

Functional Analysis · Mathematics 2016-06-07 Daniel Carando , Damian Pinasco , Jorge Tomás Rodríguez

We define a family of functionals, called p-oscillation functionals, that can be interpreted as discrete versions of the classical total variation functional for p=1 and of the p-Dirichlet functionals for p>1. We introduce the notion of…

Analysis of PDEs · Mathematics 2018-03-06 Annalisa Cesaroni , Serena Dipierro , Matteo Novaga , Enrico Valdinoci

In this article we are interested in studying partitions of the square, the disk and the equilateral triangle which minimize a p-norm of eigenvalues of the Dirichlet-Laplace operator. The extremal case of the infinity norm, where we…

Optimization and Control · Mathematics 2018-04-03 Virginie Bonnaillie-Noel , Beniamin Bogosel

The subspace approximation problem Subspace($k$,$p$) asks for a $k$-dimensional linear subspace that fits a given set of points optimally, where the error for fitting is a generalization of the least squares fit and uses the $\ell_{p}$ norm…

Data Structures and Algorithms · Computer Science 2011-01-04 Amit Deshpande , Kasturi Varadarajan , Madhur Tulsiani , Nisheeth K. Vishnoi

We discuss two optimization problems related to the fractional $p$-Laplacian. First, we prove the existence of at least one minimizer for the principal eigenvalue of the fractional $p$-Laplacian with Dirichlet conditions, with a bounded…

Analysis of PDEs · Mathematics 2024-11-18 Antonio Iannizzotto , Giovanni Porru

Several new inequalities for moduli of smoothness and errors of the best approximation of a function and its derivatives in the spaces $L_p$, $0<p<1$, are obtained. For example, it is shown that for any $0<p<1$ and $k,\,r\in \mathbb{N}$ one…

Classical Analysis and ODEs · Mathematics 2016-12-26 Yurii Kolomoitsev

A fundamental problem in numerical analysis and approximation theory is approximating smooth functions by polynomials. A much harder version under recent consideration is to enforce bounds constraints on the approximating polynomial. In…

Numerical Analysis · Mathematics 2021-12-28 Larry Allen , Robert C. Kirby

This work studies optimal polynomial approximants (OPAs) in the classical Hardy spaces on the unit disk, $H^p$ ($1 < p < \infty$). For fixed $f\in H^p$ and $n\in\mathbb{N}$, the OPA of degree $n$ associated to $f$ is the polynomial which…

Functional Analysis · Mathematics 2024-04-24 Raymond Cheng , Christopher Felder

A short account of recent existence and multiplicity theorems on the Dirichlet problem for an elliptic equation with $(p,q)$-Laplacian in a bounded domain is performed. Both eigenvalue problems and different types of perturbation terms are…

Analysis of PDEs · Mathematics 2017-04-03 Salvatore Marano , Sunra Mosconi

We discuss approximation of extremal functions by polynomials in the weighted Bergman spaces $A^p_\alpha$ where $-1 < \alpha < 0$ and $-1 < \alpha < p-2$. We obtain bounds on how close the approximation is to the true extremal function in…

Complex Variables · Mathematics 2017-05-19 Timothy Ferguson

We consider the problem of existence of polynomials with small norm. This range of problems has been extensively studied by many authors in the case of the unit circle (or a compact Abelian group), i.e. when the characters are bounded. In…

Functional Analysis · Mathematics 2015-05-12 A. Kushpel

An NP-hard combinatorial optimization problem $\Pi$ is said to have an {\em approximation threshold} if there is some $t$ such that the optimal value of $\Pi$ can be approximated in polynomial time within a ratio of $t$, and it is NP-hard…

Computational Complexity · Computer Science 2008-12-15 Uriel Feige
‹ Prev 1 2 3 10 Next ›