Lagrange interpolation on Chebyshev points of two variables
Journal of Approximation Theory
Polynomial interpolation to data on flats in Rd
Journal of Approximation Theory
An updated set of basic linear algebra subprograms (BLAS)
ACM Transactions on Mathematical Software (TOMS)
On polynomial interpolation of two variables
Journal of Approximation Theory
Bivariate Lagrange interpolation at the Padua points: The generating curve approach
Journal of Approximation Theory
Bivariate Lagrange interpolation at the Padua points: the ideal theory approach
Numerische Mathematik
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
ACM Transactions on Mathematical Software (TOMS)
| Hi-index | 0.00 |
We present a stable and efficient Fortran implementation of polynomial interpolation at the Padua points on the square [ − 1,1]2. These points are unisolvent and their Lebesgue constant has minimal order of growth (log square of the degree). The algorithm is based on the representation of the Lagrange interpolation formula in a suitable orthogonal basis, and takes advantage of a new matrix formulation together with the machine-specific optimized BLAS subroutine for the matrix-matrix product. Extension to interpolation on rectangles, triangles and ellipses is also described.