Related papers: On the convergence of Chebyshev--Pad\'e approximat…

The Riesz-Sobolev inequality relates the convolution of nonnegative functions on Euclidean space to the convolution of their symmetric nonincreasing rearrangements. We show that for dimension one, for indicator functions of sets, if the…

In this paper, we give a sharp lower bound for the minimum deviation of the Chebyshev polynomial on a compact subset of the real line in terms of the corresponding logarithmic capacity. Especially if the set is the union of several real…

Submodular functions describe a variety of discrete problems in machine learning, signal processing, and computer vision. However, minimizing submodular functions poses a number of algorithmic challenges. Recent work introduced an…

We establish a new extremal property of the classical Chebyshev polynomials in the context of best rank-one approximation of tensors. We also give some necessary conditions for a tensor to be a minimizer of the ratio of spectral and…

The constrained mock-Chebyshev least squares operator is a linear approximation operator based on an equispaced grid of points. Like other polynomial or rational approximation methods, it was recently introduced in order to defeat the Runge…

In this paper, we introduce a new theoretical framework built upon fractional Sobolev-type spaces involving Riemann-Liouville (RL) fractional integrals/derivatives, which is naturally arisen from exact representations of Chebyshev expansion…

In this paper we develop an optimisation based approach to multivariate Chebyshev approximation on a finite grid. We consider two models: multivariate polynomial approximation and multivariate generalised rational approximation. In the…

In this paper, we discuss asymptotic relations for the approximation of $\left\vert x\right\vert ^{\alpha},\alpha>0$ in $L_{\infty}\left[ -1,1\right] $ by Lagrange interpolation polynomials based on the zeros of the Chebyshev polynomials of…

We establish a lower estimate for the Kobayashi-Royden infinitesimal pseudometric on an almost complex manifold $(M,J)$ admitting a bounded strictly plurisubharmonic function. We apply this result to study the boundary behaviour of the…

Given pointwise samples of an unknown function belonging to a certain model set, one seeks in Optimal Recovery to recover this function in a way that minimizes the worst-case error of the recovery procedure. While it is often known that…

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,…

Motivated by conforming finite element methods for elliptic problems of second order, we analyze the approximation of the gradient of a target function by continuous piecewise polynomial functions over a simplicial mesh. The main result is…

Let f be a germ of an analytic function at infinity that can be analytically continued along any path in the complex plane deprived of a finite set of points, f \in\mathcal{A}(\bar{\C} \setminus A), \sharp A <\infty. J. Nuttall has put…

Let $ f_0 $ and $ f_\infty $ be formal power series at the origin and infinity, and $ P_n/Q_n $, with $ \mathrm{deg}(P_n),\mathrm{deg}(Q_n)\leq n $, be a rational function that simultaneously interpolates $ f_0 $ at the origin with order $…

In this paper, we are concerned with multivariate Gegenbauer approximation of functions defined in the $d$-dimensional hypercube. Two new and sharper bounds for the coefficients of multivariate Gegenbauer expansion of analytic functions are…

Based on a quantitative version of the inverse function theorem and an appropriate saddle-point formulation we derive a quasi-optimal error estimate for the finite element approximation of harmonic maps into spheres with a nodal…

We introduce the concept of quotient-convergence for sequences of submodular set functions, providing, among others, a new framework for the study of convergence of matroids through their rank functions. Extending the limit theory of…

The low-rank matrix approximation problem is ubiquitous in computational mathematics. Traditionally, this problem is solved in spectral or Frobenius norms, where the accuracy of the approximation is related to the rate of decrease of the…

The H\"older continuity of the truncated moment map of a shade function in Euclidean space is established in the vicinity of a principal semi-algebraic set. The proof combines volume bounds of semi-algebraic sets and convex optimization…

We consider the problem of finding a best uniform approximation to the standard monomial on the unit ball in $\bbC^2$ by polynomials of lower degree with complex coefficients. We reduce the problem to a one-dimensional weighted minimization…