Evaluating Lebesgue constants by Chebyshev polynomial meshes on cube, simplex, and ball
From MaRDI portal
Publication:6611973
DOI10.1553/etna_vol60s428zbMATH Open1547.6502MaRDI QIDQ6611973
M. Vianello, Dimitri Jordan Kenne, Alvise Sommariva, Leokadia Białas-Cież
Publication date: 27 September 2024
Published in: ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
interpolationleast-squaresballsimplexhyperinterpolationcubeLebesgue constantpolynomial optimizationpolynomial projectorsmultivariate polynomial meshes
Numerical smoothing, curve fitting (65D10) Numerical mathematical programming methods (65K05) Numerical interpolation (65D05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Invariance of polynomial inequalities under polynomial maps
- Polynomial fitting and interpolation on circular sections
- On the generation of symmetric Lebesgue-like points in the triangle
- High order recombination and an application to cubature on Wiener space
- Pseudo Leja sequences
- A note on total degree polynomial optimization by Chebyshev grids
- On optimal polynomial meshes
- Computing Fekete and Lebesgue points: Simplex, square, disk
- Near G-optimal Tchakaloff designs
- Bivariate Lagrange interpolation at the Padua points: the generating curve approach
- An explicit construction of interpolation nodes on the simplex
- Uniform approximation by discrete least squares polynomials
- Pseudometrics, distances and multivariate polynomial inequalities
- New cubature formulae and hyperinterpolation in three variables
- Spectral methods on triangles and other domains
- Über die Zerlegung von Dreieckspolyedern in Tetraeder.
- Bivariate polynomial interpolation on the square at new nodal sets
- On the computation of sets of points with low Lebesgue constant on the unit disk
- Subperiodic Dubiner distance, norming meshes and trigonometric polynomial optimization
- The Lebesgue constant for Lagrange interpolation on equidistant nodes
- Polynomial interpolation and hyperinterpolation over general regions
- On hyperinterpolation on the unit ball
- Monte Carlo cubature construction
- Deviation maximization for rank-revealing QR factorizations
- Numerical hyperinterpolation over nonstandard planar regions
- On the norm of the hyperinterpolation operator on the \(d\)-dimensional cube
- Interpolation on the disk
- Orthogonal polynomials on the disc
- Approximating optimal point configurations for multivariate polynomial interpolation
- Small perturbations of polynomial meshes
- Spheres Unions and Intersections and Some of their Applications in Molecular Modeling
- Computing Multivariate Fekete and Leja Points by Numerical Linear Algebra
- Polynomial interpolation and approximation in Cd
- Interpolation Processes
- On the norm of the hyperinterpolation operator on the unit disc and its use for the solution of the nonlinear Poisson equation
- Construction of Algebraic Cubature Rules Using Polynomial Ideal Theory
- Lasso Hyperinterpolation Over General Regions
- A node elimination algorithm for cubature of high-dimensional polytopes
- Random sampling and unisolvent interpolation by almost everywhere analytic functions
- The Lawson‐Hanson algorithm with deviation maximization: Finite convergence and sparse recovery
- Accelerating the Lawson-Hanson NNLS solver for large-scale Tchakaloff regression designs
- CQMC: an improved code for low-dimensional compressed quasi-MonteCarlo cubature
- Optimal polynomial meshes exist on any multivariate convex domain
Related Items (1)
This page was built for publication: Evaluating Lebesgue constants by Chebyshev polynomial meshes on cube, simplex, and ball
