Related papers: Evaluating Lebesgue constants by Chebyshev polynom…
We establish simultaneous approximation properties of weighted first-order Sobolev orthogonal projectors onto spaces of polynomials of bounded total degree in the Euclidean unit ball. The simultaneity is in the sense that we provide bounds…
Chebyshev interpolation polynomials exhibit the exponential approximation property to analytic functions on a cube. Based on the Chebyshev interpolation polynomial approximation, we propose iterative polynomial approximation algorithms to…
In this note we study boundedness of a large class of maximal operators in Sobolev spaces that includes the spherical maximal operator. We also study the size of the set of Lebesgue points with respect to convergence associated with such…
The article proves an assertion analogous to the Littlewood-Paley theorem for the orthoprojectors onto mutually orthogonal subspaces of piecewise polynomial functions on the cube $ I^d. $ This assertion provides an upper estimate for the…
We provide formulas for projectors onto a polyhedral set, i.e. the intersection of a finite number of halfspaces. To this aim we formulate the problem of finding the projection as a convex optimization problem and we solve explicitly…
Sumset estimates, which provide bounds on the cardinality of sumsets of finite sets in a group, form an essential part of the toolkit of additive combinatorics. In recent years, probabilistic or entropic analogs of many of these…
Problems involving approximation from scattered data where data is arranged quasi-uniformly have been treated by RBF methods for decades. Treating data with spatially varying density has not been investigated with the same intensity, and is…
We consider the sparse polynomial approximation of a multivariate function on a tensor product domain from samples of both the function and its gradient. When only function samples are prescribed, weighted $\ell^1$ minimization has recently…
For the Lagrange interpolation over a triangular domain, we propose an efficient algorithm to rigorously evaluate the interpolation error constant under the maximum norm by using the finite element method (FEM). In solving the optimization…
Finding point configurations, that yield the maximum polarization (Chebyshev constant) is gaining interest in the field of geometric optimization. In the present article, we study the problem of unconstrained maximum polarization on compact…
In this article, we study the problem of obtaining Lebesgue space inequalities for the Fourier restriction operator associated to rectangular pieces of the paraboloid and perturbations thereof. We state a conjecture for the dependence of…
In this paper we prove a new extremal property of the Reuleaux triangle: it maximizes the Cheeger constant among all bodies of (same) constant width. The proof relies on a fine analysis of the optimality conditions satisfied by an optimal…
The implied volatility is a crucial element of any financial toolbox, since it is used for quoting and the hedging of options as well as for model calibration. In contrast to the Black-Scholes formula its inverse, the implied volatility, is…
In this paper we introduce two new methods for constructing injective resolutions of sheaves of finite-dimensional vector spaces on finite posets. Our main result is the existence and uniqueness of a minimal injective resolution of a given…
Chebyshev spectral methods are widely used in numerical computations. When the underlying function has a singularity, it has been observed by L. N. Trefethen in 2011 that its Chebyshev interpolants exhibit an error localization property,…
The modeling of large deformation fracture mechanics has been a challenging problem regarding the accuracy of numerical methods and their ability to deal with considerable changes in deformations of meshes where having the presence of…
We give upper and lower bounds for weighted Chebyshev and residual polynomials on subsets of the real line. As an application, we prove a Szeg\H{o}-type theorem in the setting of Parreau--Widom sets.
This paper presents an iterative scheme that converges to the solution of a pseudo-monotone variational inequality problem in the setting of $\mathbb{R}^{n}$. Traditional methods often require projections onto the feasible set…
We derive upper bounds on the difference between the orthogonal projections of a smooth function $u$ onto two finite element spaces that are nearby, in the sense that the support of every shape function belonging to one but not both of the…
We study the n-dimensional problem of finding the smallest ball enclosing the intersection of p given balls, the so-called Chebyshev center problem (CCB). It is a minimax optimization problem and the inner maximization is a uniform…