Polynomial interpolation and quadrature on subregions of the sphere
Testo completo
Documenti correlati
The Padua points are the first known example of optimal points for total degree polynomial interpolation in two variables, with a Lebesgue constant increasing like log 2 of the
Moreover, similarly to the one-dimensional case, they generate a (nontensorial) Clenshaw-Curtis-like quadrature formula that turns out to be competitive with the
The Padua points, recently studied during an international collaboration at the University of Padua, are the first known example of near-optimal point set for bivariate polynomial
We study theoretically and numerically trigonometric interpolation on symmetric subintervals of [−π, π], based on a family of Chebyshev- like angular nodes (subperiodic
Find the coefficients of the polynomial interpolating x = (−2, 1, 3) and y = (−2, 11, 17) via the polyfit command on a script named. Esercizio2 and
We provide an algorithm that computes algebraic quadrature formulas with cardinality not exceeding the dimension of the exactness polynomial space, on the intersection of any number
reduce the number of integration points required for the polyhedral quadrature
Using some recent results on subperiodic trigonometric interpolation and quadra- ture, and the theory of admissible meshes for multivariate polynomial approxima- tion, we study