Algorithm 886: Padua2D-Lagrange Interpolation at Padua Points on Bivariate Domains

被引:11
|
作者
Caliari, Marco [1 ]
De Marchi, Stefano [1 ]
Vianello, Marco [2 ]
机构
[1] Univ Verona, Dept Comp Sci, I-37134 Verona, Italy
[2] Univ Padua, Dept Pure & Appl Math, I-35121 Padua, Italy
来源
关键词
Algorithms; Bivariate Lagrange interpolation; Padua points; bivariate Chebyshev orthogonal basis; Fortran; 77;
D O I
10.1145/1391989.1391994
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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 DGEMM for the matrix-matrix product. Extension to interpolation on rectangles, triangles and ellipses is also described.
引用
收藏
页数:11
相关论文
共 50 条