English
Related papers

Related papers: On Interpolation Approximation: Convergence rates …

200 papers

Motivated by comparing the convergence behavior of Gegenbauer projections and best approximations, we study the optimal rate of convergence for Gegenbauer projections in the maximum norm. We show that the rate of convergence of Gegenbauer…

Numerical Analysis · Mathematics 2023-12-15 Haiyong Wang

Given a finite Borel measure $\mu$ on R n and basic semi-algebraic sets $\Omega$\_i $\subset$ R n , i = 1,. .. , p, we provide a systematic numerical scheme to approximate as closely as desired $\mu$(\cup\_i $\Omega$\_i), when all moments…

Optimization and Control · Mathematics 2017-06-27 Jean Lasserre , Youssouf Emin

There is proposed a method for improving the convergence of Fourier series by function systems, orthogonal at the segment, the application of which allows for smooth functions to receive uniformly convergent series. There is also proposed…

Numerical Analysis · Mathematics 2018-05-18 Volodymyr Denysiuk

Theoretical estimates of the convergence rate of many well-known gradient-type optimization methods are based on quadratic interpolation, provided that the Lipschitz condition for the gradient is satisfied. In this article we obtain a…

Optimization and Control · Mathematics 2018-12-18 Fedor S. Stonyakin

For orthogonal polynomials defined by compact Jacobi matrix with exponential decay of the coefficients, precise properties of orthogonality measure is determined. This allows showing uniform boundedness of partial sums of orthogonal…

Functional Analysis · Mathematics 2007-05-23 Josef Obermaier , Ryszard Szwarc

A scheme for approximating the kernel $w$ of the fractional $\alpha$-integral by a linear combination of exponentials is proposed and studied. The scheme is based on the application of a composite Gauss-Jacobi quadrature rule to an integral…

Numerical Analysis · Mathematics 2018-10-12 Daniel Baffet

We study the optimal rectangular-discrepancy approximation of permutons by finite permutations. We transfer bounds from discrepancy theory to this more restricted setup. Moreover, we show that superlinear approximation can occur only for…

Combinatorics · Mathematics 2026-05-05 Balázs Maga

This paper deals with the kernel-based approximation of a multivariate periodic function by interpolation at the points of an integration lattice -- a setting that, as pointed out by Zeng, Leung, Hickernell (MCQMC2004, 2006) and Zeng,…

Numerical Analysis · Mathematics 2022-01-25 Vesa Kaarnioja , Yoshihito Kazashi , Frances Y. Kuo , Fabio Nobile , Ian H. Sloan

In this note we announce that under general hypotheses, wavelet-type expansions (of functions in $L^p,\ 1\leq p \leq \infty$, in one or more dimensions) converge pointwise almost everywhere, and identify the Lebesgue set of a function as a…

Functional Analysis · Mathematics 2016-09-06 Susan E. Kelly , Mark A. Kon , Louise A. Raphael

Convergence rates in spectral regularization methods quantify the approximation error in inverse problems as a function of the noise level or the number of sampling points. Classical strong convergence rate results typically rely on source…

Numerical Analysis · Mathematics 2025-12-05 Sabrina Guastavino , Gabriele Santin , Francesco Marchetti , Federico Benvenuto

While direct statements for kernel based interpolation on regions $\Omega \subset \mathbb{R}^d$ are well researched, far less is known about corresponding inverse statements. The available inverse statements for kernel based interpolation…

Numerical Analysis · Mathematics 2025-04-23 Tizian Wenzel

We adapt the quasi-monotone method from [2] for composite convex minimization in the stochastic setting. For the proposed numerical scheme we derive the optimal convergence rate in terms of the last iterate, rather than on average as it is…

Optimization and Control · Mathematics 2021-07-09 Vyacheslav Kungurtsev , Vladimir Shikhman

Zernike polynomials are a basis of orthogonal polynomials on the unit disk that are a natural basis for representing smooth functions. They arise in a number of applications including optics and atmospheric sciences. In this paper, we…

Numerical Analysis · Mathematics 2018-11-08 Philip Greengard , Kirill Serkh

We establish a sparsity in terms of $\ell_p$-summability and weighted $\ell_2$-summability for the coefficients of the Laguerre generalized piecewise-polynomial chaos expansion of solutions to parametric elliptic PDEs with log-Laplace…

Numerical Analysis · Mathematics 2026-03-24 Dinh Dũng

When using images to locate objects, there is the problem of correcting for distortion and misalignment in the images. An elegant way of solving this problem is to generate an error correcting function that maps points in an image to their…

Computer Vision and Pattern Recognition · Computer Science 2009-04-28 Christopher O. Ward

In this paper we present a new perspective on error analysis of Legendre approximations for differentiable functions. We start by introducing a sequence of Legendre-Gauss-Lobatto polynomials and prove their theoretical properties, such as…

Numerical Analysis · Mathematics 2023-12-15 Haiyong Wang

Several problems of trigonometric approximation on a hexagon and a triangle are studied using the discrete Fourier transform and orthogonal polynomials of two variables. A discrete Fourier analysis on the regular hexagon is developed in…

Numerical Analysis · Mathematics 2007-12-20 Huiyuan Li , Jiachang Sun , Yuan Xu

It is an open question whether the fractional parts of nonlinear polynomials at integers have the same fine-scale statistics as a Poisson point process. Most results towards an affirmative answer have so far been restricted to almost sure…

Number Theory · Mathematics 2019-02-20 Jens Marklof , Nadav Yesha

In this paper, we want to clarify the Gibbs phenomenon when continuous and discontinuous finite elements are used to approximate discontinuous or nearly discontinuous PDE solutions from the approximation point of view. For a simple step…

Numerical Analysis · Mathematics 2022-08-03 Shun Zhang

Various convergence results for the Bergman kernel of the Hilbert space of all polynomials in \C^{n} of total degree at most k, equipped with a weighted norm, are obtained. The weight function is assumed to be C^{1,1}, i.e. it is…

Complex Variables · Mathematics 2008-04-21 Robert Berman