Optimal Points for Cubature Rules and Polynomial Interpolation on a Square
classification
🧮 math.NA
cs.NAmath.CA
keywords
cubatureinterpolationpointspolynomialssquarebehaviorbehindcertain
read the original abstract
The nodes of certain minimal cubature rule are real common zeros of a set of orthogonal polynomials of degree $n$. They often consist of a well distributed set of points and interpolation polynomials based on them have desired convergence behavior. We report what is known and the theory behind by explaining the situation when the domain of integrals is a square.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.