Algorithm 886: Padua2D---Lagrange Interpolation at Padua Points on Bivariate Domains
ACM Transactions on Mathematical Software (TOMS)
Bivariate Lagrange interpolation at the Padua points: Computational aspects
Journal of Computational and Applied Mathematics
Computing approximate Fekete points by QR factorizations of Vandermonde matrices
Computers & Mathematics with Applications
Padua2DM: fast interpolation and cubature at the Padua points in Matlab/Octave
Numerical Algorithms
Computing Fekete and Lebesgue points: Simplex, square, disk
Journal of Computational and Applied Mathematics
International Journal of Approximate Reasoning
Hi-index | 0.00 |
The Padua points are a family of points on the square [−1, 1]2 given by explicit formulas that admits unique Lagrange interpolation by bivariate polynomials. Interpolation polynomials and cubature formulas based on the Padua points are studied from an ideal theoretic point of view, which leads to the discovery of a compact formula for the interpolation polynomials. The Lp convergence of the interpolation polynomials is also studied.