English
Related papers

Related papers: A Survey of Weighted Approximation for Exponential…

200 papers

We consider polynomial approximation over the interval $[-1,1]$ by regularized weighted discrete least squares methods with $\ell_2-$ or $\ell_1-$regularization, respectively. As the set of nodes we use Gauss quadrature points (which are…

Numerical Analysis · Mathematics 2019-08-27 Congpei An , Hao-Ning Wu

We investigate Chebyshev polynomials corresponding to Jacobi weights and determine monotonicity properties of their related Widom factors. This complements work by Bernstein from 1930-31 where the asymptotical behavior of the related…

Classical Analysis and ODEs · Mathematics 2024-09-05 Jacob S. Christiansen , Olof Rubin

We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…

Algebraic Geometry · Mathematics 2025-10-20 J. Maurice Rojas

Given $n\geq1$ and $r\in[0, 1),$ we consider the set $\mathcal{R}_{n, r}$ of rational functions having at most $n$ poles all outside of $\frac{1}{r}\mathbb{D},$ were $\mathbb{D}$ is the unit disc of the complex plane. We give an…

Functional Analysis · Mathematics 2012-06-29 Anton Baranov , Rachid Zarouf

This paper goes back to a famous problem of Mahler in metrical Diophantine approximation. The problem has been settled by Sprindzuk and subsequently improved by Alan Baker and Vasili Bernik. In particular, Bernik's result establishes a…

Number Theory · Mathematics 2008-02-14 Victor Beresnevich

Starting out from a question posed by T. Erd\'elyi and J. Szabados, we consider Schur-type inequalities for the classes of complex algebraic polynomials having no zeroes within the unit disk D. The class of polynomials with no zeroes in D -…

Classical Analysis and ODEs · Mathematics 2007-05-23 Szilárd Gy. Révész

A Bernstein type inequality is obtained for the Jacobi polynomials $P_n^{\alpha,\beta}(x)$, which is uniform for all degrees $n\ge0$, all real $\alpha,\beta\ge0$, and all values $x\in [-1,1]$. It provides uniform bounds on a complete set of…

Representation Theory · Mathematics 2012-01-31 Uffe Haagerup , Henrik Schlichtkrull

It is a classical result in rational approximation theory that certain non-smooth or singular functions, such as $|x|$ and $x^{1/p}$, can be efficiently approximated using rational functions with root-exponential convergence in terms of…

Numerical Analysis · Mathematics 2025-06-27 Kingsley Yeon , Steven B. Damelin

Motivated by a theorem of Barbour, we revisit some of the classical limit theorems in probability from the viewpoint of the Stein method. We setup the framework to bound Wasserstein distances between some distributions on infinite…

Probability · Mathematics 2018-07-30 Laure Coutin , Laurent Decreusefond

Bernstein problem for affine maximal type equation has been a core problem in affine geometry. A conjecture proposed firstly by Chern for entire graph and then extended by Trudinger-Wang to its fully generality asserts that any Euclidean…

Differential Geometry · Mathematics 2021-03-17 Shi-Zhong Du

We consider the classical problem of estimating norm of the derivative of algebraic polynomial via the norm of polynomial itself. The corresponding extremal problem for general polynomials in uniform norm was solved by V. Markov. In this…

Classical Analysis and ODEs · Mathematics 2012-05-07 Oleksiy Klurman

We survey developments, over the last thirty years, in the theory of Shape Preserving Approximation (SPA) by algebraic polynomials on a finite interval. In this article, "shape" refers to (finitely many changes of) monotonicity, convexity,…

Classical Analysis and ODEs · Mathematics 2011-09-06 K. A. Kopotun , D. Leviatan , A. Prymak , I. A. Shevchuk

We study the polynomial approximation problem in $L^2(\mu_1)$ where $\mu_1(dx) = e^{-|x|}/2 dx$. We show that for any absolutely continuous function $f$, $$ \sum_{k=1}^{\infty} \log^2(e+k) \langle f, P_k \rangle^2 \ \leq C \left(…

Classical Analysis and ODEs · Mathematics 2025-02-12 Pierre Bizeul , Boaz Klartag

This paper is devoted to Markov's extremal problems of the form $M_{n,k}=\sup_{p\in\PP_n\setminus\{0\}}{{\|p^{(k)}\|}_X}/{{\|p\|}_X}$ $(1\le k\le n)$, where $\PP_n$ is the set of all algebraic polynomials of degree at most $n$ and $X$ is a…

Numerical Analysis · Mathematics 2021-11-02 Gradimir V. Milovanović

During the Conference on Ulam's Type Stability (Rytro, Poland, 2014), Ioan Rasa recalled his 25-years-old problem concerning some inequality involving the Bernstein polynomials. We offer the complete solution (in positive). As a~tool we use…

Analysis of PDEs · Mathematics 2016-04-26 Jacek Mrowiec , Teresa Rajba , Szymon Wasowicz

In this note, we present an improvement to a recent result due to Beresnevich, Levesley, and Ward (2021) pertaining to weighted simultaneous Diophantine approximation on manifolds.

Number Theory · Mathematics 2021-03-12 Demi Allen , Baowei Wang

We clarify how close a second order fully nonlinear equation can come to uniform ellipticity, through counting large eigenvalues of the linearized operator. This suggests an effective and novel way to understand the structure of fully…

Differential Geometry · Mathematics 2022-10-12 Rirong Yuan

We obtain new effective results in best approximation theory, specifically moduli of uniqueness and constants of strong unicity, for the problem of best uniform approximation with bounded coefficients, as first considered by Roulier and…

Classical Analysis and ODEs · Mathematics 2021-12-30 Andrei Sipos

We study the convergence of these operators in a weighted space of functions on a positive semi-axis and estimate the approximation by using a new type of weighted modulus of continuity and error estimation.

Classical Analysis and ODEs · Mathematics 2016-06-22 Preeti Sharma , Vishnu Narayan Mishra

We study the complexity of approximating solution structure of the bijective weighted sentence alignment problem of DeNero and Klein (2008). In particular, we consider the complexity of finding an alignment that has a significant overlap…

Computation and Language · Computer Science 2014-09-09 Antonina Kolokolova , Renesa Nizamee
‹ Prev 1 3 4 5 6 7 10 Next ›