• Non ci sono risultati.

Fast interpolation and quadrature at the Padua points∗

N/A
N/A
Protected

Academic year: 2021

Condividi "Fast interpolation and quadrature at the Padua points∗"

Copied!
1
0
0

Testo completo

(1)

Fast interpolation and quadrature at the Padua points

Stefano De Marchi Department of Computer Science

University of Verona

S.da Le Grazie 15, 37134 - Verona (Italy)

Abstract

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 degree. Moreover, similarly to the one-dimensional case, they generate a (nontensorial) Clenshaw-Curtis-like quadrature formula that turns out to be competitive with the tensorial Gauss-Legendre formula and even with the few known minimal formulas in the square, on integrands that are not “too regular”. We present new fast algorithms for interpolation and numerical quadrature at the Padua points, and some applications.

Work in collaboration with M. Caliari (University of Verona), A. Sommariva and M.

Vianello (University of Padova); supported by the “ex-60%” funds of the University of Verona.

Riferimenti

Documenti correlati

The definition of the Dirac operator perturbed by a concentrated nonlinearity is given and it is shown how to split the nonlinear flow into the sum of the free flow plus a

Here we show four families of Padua points for interpolation at any even or odd degree n, and we present a stable and efficient implementation of the corresponding

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

SIAM Conference on Mathematical and Computational Issues in the Geosciences (SIAM GS13) Padova (Italy) June 17-20 2013M. Polynomial interpolation and quadrature on subregions of

Abstract We have implemented in Matlab/Octave two fast algorithms for bivariate Lagrange interpolation at the so-called Padua points on rectangles, and the corresponding versions

reduce the number of integration points required for the polyhedral quadrature

Figure 3.22: Experimental time series showing the presence of a stable upright position together with a stable large amplitude sub-harmonically resonant roll motion for ITACA in