Hyperinterpolation on the square
From MaRDI portal
Publication:2475355
The authors study a polynomial approximation algorithm which combines \textit{I. H. Sloan}'s hyperinterpolation procedure [J. Approximation Theory 83, No.~2, 238--254 (1995; Zbl 0839.41006)] with a near-minimal cubature formula for the product Chebyshev measure on the square. The Lebesgue constant of this approximation operator is estimated to grow no faster than a constant times the squared \(\log\) of the polynomial total degree. The algorithm is compared with two interpolation schemes and numerical tests are presented.
Recommendations
Cites work
- A numerical study of the xu polynomial interpolation formula in two variables
- Bivariate interpolation at Xu points: results, extensions and applications
- Bivariate polynomial interpolation on the square at new nodal sets
- Christoffel functions and Fourier series for multivariate orthogonal polynomials
- Computational aspects of multivariate polynomial interpolation
- Construction of Algebraic Cubature Rules Using Polynomial Ideal Theory
- Constructive polynomial approximation on the sphere
- Cubature formulae and orthogonal polynomials
- scientific article; zbMATH DE number 5722435 (Why is no real title available?)
- Lagrange interpolation on Chebyshev points of two variables
- Minimal cubature formulae of degree 2k-1 for two classical functionals
- Multivariate polynomial approximation
- On Leja sequences: some results and applications
- On Multivariate Lagrange Interpolation
- On the Lebesgue constant for the Xu interpolation formula
- Orthogonal polynomials of several variables
- Polynomial interpolation and hyperinterpolation over general regions
Cited in
(17)- Nontensorial Clenshaw-Curtis cubature
- New cubature formulae and hyperinterpolation in three variables
- On the quadrature exactness in hyperinterpolation
- Numerical hyperinterpolation over nonstandard planar regions
- On the norm of the hyperinterpolation operator on the unit ball
- On the norm of the hyperinterpolation operator on the d-dimensional cube
- Polynomial approximation on Lissajous curves in the \(d\)-cube
- Bivariate Lagrange interpolation at the Chebyshev nodes
- Lasso hyperinterpolation over general regions
- On barycentric interpolation. II. Grünwald-Marcinkiewicz type theorems
- Bypassing the quadrature exactness assumption of hyperinterpolation on the sphere
- Is hyperinterpolation efficient in the approximation of singular and oscillatory functions?
- Hybrid hyperinterpolation over general regions
- Hard thresholding hyperinterpolation over general regions
- Approximation on non-tensor domains including squircles. III: Polynomial hyperinterpolation and radial basis function interpolation on Chebyshev-like grids and truncated uniform grids
- Hyper2d: A numerical code for hyperinterpolation on rectangles
- Hyperinterpolation in the cube
This page was built for publication: Hyperinterpolation on the square
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2475355)
