An Algorithm for Computing Fekete Points in the Triangle
Open Access
- 1 January 2000
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 38 (5), 1707-1720
- https://doi.org/10.1137/s0036142998337247
Abstract
On the line and its tensor products, Fekete points are known to be the Gauss--Lobatto quadrature points. But unlike high-order quadrature, Fekete points generalize to non-tensor-product domains such as the triangle. Thus Fekete points might serve as an alternative to the Gauss--Lobatto points for certain applications. In this work we present a new algorithm to compute Fekete points and give results up to degree 19 for the triangle. For degree d 10 these points have the smallest Lebesgue constant currently known. The computations validate a conjecture of Bos [ J. Approx. Theory, 64 (1991), pp. 271--280] that Fekete points along the boundary of the triangle are the one-dimensional Gauss--Lobatto points.Keywords
This publication has 7 references indexed in Scilit:
- From Electrostatics to Almost Optimal Nodal Sets for Polynomial Interpolation in a SimplexSIAM Journal on Numerical Analysis, 1998
- Approximate optimal points for polynomial interpolation of real functions in an interval and in a triangleComputer Methods in Applied Mechanics and Engineering, 1995
- Polynomial Interpretation of Holomorphic Functions in $\c$ and $\c^n$Rocky Mountain Journal of Mathematics, 1992
- Spectral methods on triangles and other domainsJournal of Scientific Computing, 1991
- On certain configurations of points in Rn which are unisolvent for polynomial interpolationJournal of Approximation Theory, 1991
- A Remez-type algorithm for the calculation of extremal fundamental systems for polynomial spaces on teh sphereComputing, 1986
- Bounding the Lebesgue function for Lagrange interpolation in a simplexJournal of Approximation Theory, 1983