Related papers: A Survey of Weighted Approximation for Exponential…
We prove the well posedness in weighted Sobolev spaces of certain linear and nonlinear elliptic boundary value problems posed on convex domains and under singular forcing. It is assumed that the weights belong to the Muckenhoupt class $A_p$…
his paper deals with approximating properties of the newly defined $q$-generalization of the Sz\'{a}sz operators in the case $q>1$. Quantitative estimates of the convergence in the polynomial weighted spaces and the Voronovskaja's theorem…
The convergence of the algorithm for solving convex feasibility problem is studied by the method of sequential averaged and relaxed projections. Some results of H. H. Bauschke and J. M. Borwein are generalized by introducing new methods.…
Orthogonal polynomial solutions of an admissible potentially self-adjoint linear second-order partial $q$-difference equation of the hypergeometric type in two variables on $q$-linear lattices are analyzed. A $q$-Pearson's system for the…
We derive explicit Bernstein-type and Bennett-type concentration inequalities for matrix-valued martingale processes with unbounded observations from the Hermitian space $\mathbb{H}(d)$. Specifically, we assume that the…
We consider approximation properties of real points by uniformly distributed sequences. Under some assumptions on the approximation functions, we prove a Khintchine-type $0$-$1$ dichotomy law. We establish a new connection between uniform…
We address the problem of the best uniform approximation by linear combinations of a finite system of functions. If the system is Chebyshev and the problem is unconstrained, then the classical Remez algorithm provides a fast and precise…
The problem of nearest neighbor condensing has enjoyed a long history of study, both in its theoretical and practical aspects. In this paper, we introduce the problem of weighted distance nearest neighbor condensing, where one assigns…
On the half line we introduce a new sequence of near--best uniform approximation polynomials, easily computable by the values of the approximated function at a truncated number of Laguerre zeros. Such approximation polynomials come from a…
In this paper, we propose weighted and unweighted enrichment strategies to enhance the accuracy of the linear lagrangian finite element for solving the Poisson problem with Dirichlet boundary conditions. We first recall key examples of…
The problem of time series approximation by series of finite rank is considered from the viewpoint of signal extraction. For signal estimation, a weighted least-squares method is applied to the trajectory matrix of the considered time…
Bernstein problem for affine maximal type equation \begin{equation}\label{e0.1} u^{ij}D_{ij}w=0, \ \ w\equiv[\det D^2u]^{-\theta},\ \ \forall x\in\Omega\subset{\mathbb{R}}^N \end{equation} has been a core problem in affine geometry. A…
The strong numerical approximation of semilinear stochastic partial differential equations (SPDEs) driven by infinite dimensional Wiener processes is investigated. There are a number of results in the literature that show that Euler-type…
The matroid parity (or matroid matching) problem, introduced as a common generalization of matching and matroid intersection problems, is so general that it requires an exponential number of oracle calls. Nevertheless, Lov\'asz (1980)…
Von Renesse and the author (Ann. Prob. '09) developed a second order calculus on the Wasserstein space P([0,1]) of probability measures on the unit interval. The basic objects of interest had been Dirichlet form, semigroup and continuous…
We investigate affine Berkovich spaces over maximally complete fields and prove that they may be approximated by simpler spaces when the only functions we need to evaluate are polynomials of bounded degree. We derive applications to…
The purpose of the paper is to provide a characterization of the error of the best polynomial approximation of composite functions in weighted spaces. Such a characterization is essential for the convergence analysis of numerical methods…
We study quantum algorithms for approximating Lasserre's hierarchy values for polynomial optimization. Let $f,g_1,\ldots,g_m$ be real polynomials in $n$ variables and $f^\star$ the infimum of $f$ over the semialgebraic set $S(g)=\{x:…
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…
In a recent work, Esmer et al. describe a simple method - Approximate Monotone Local Search - to obtain exponential approximation algorithms from existing parameterized exact algorithms, polynomial-time approximation algorithms and, more…