On the computation of sets of points with low Lebesgue constant on the unit disk
From MaRDI portal
Publication:1789719
DOI10.1016/j.cam.2018.06.051zbMath1403.65009OpenAlexW2810041147WikidataQ129576491 ScholiaQ129576491MaRDI QIDQ1789719
Alvise Sommariva, Gérard A. Meurant
Publication date: 10 October 2018
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11577/3281188
Numerical interpolation (65D05) Multidimensional problems (41A63) Interpolation in approximation theory (41A05)
Uses Software
Cites Work
- Unnamed Item
- On Koornwinder classical orthogonal polynomials in two variables
- On the generation of symmetric Lebesgue-like points in the triangle
- \texttt{Padua2DM}: Fast interpolation and cubature at the Padua points in \texttt{MATLAB/Octave}
- Optimal sampling patterns for Zernike polynomials
- Radial orthogonality and Lebesgue constants on the disk
- On generating discrete orthogonal bivariate polynomials
- Least-squares polynomial approximation on weakly admissible meshes: Disk and triangle
- Computing Fekete and Lebesgue points: Simplex, square, disk
- On projection constants of polynomial spaces on the unit ball in several variables
- Bivariate Lagrange interpolation at the Padua points: the generating curve approach
- Uniform approximation by discrete least squares polynomials
- On polynomial interpolation of two variables
- Interpolation on the disk
- Bivariate Lagrange interpolation at the Padua points: The ideal theory approach
- Approximating optimal point configurations for multivariate polynomial interpolation
- Computing Multivariate Fekete and Leja Points by Numerical Linear Algebra
- Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points
- Polynomial interpolation and approximation in Cd
- Lebesgue constants for Leja points
This page was built for publication: On the computation of sets of points with low Lebesgue constant on the unit disk
