Optimal points for cubature rules and polynomial interpolation on a square

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Xu, Y. (2018). Optimal points for cubature rules and polynomial interpolation on a square. In Contemporary Computational Mathematics - A Celebration of the 80th Birthday of Ian Sloan (pp. 1287–1305). Springer International Publishing. https://doi.org/10.1007/978-3-319-72456-0_58

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free