Hyperinterpolation on the square (Q2475355)

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.