Publication | Closed Access
An Algorithm for Computing Fekete Points in the Triangle
208
Citations
11
References
2000
Year
Mathematical ProgrammingGeometric ModelingNumerical AnalysisIntegral GeometryDiscrete GeometryEngineeringGeometryGeometric AlgorithmNatural SciencesGeometry Of NumberFekete PointsDelaunay TriangulationComputing Fekete PointsComputer-aided DesignComputational GeometryNew AlgorithmLobatto Quadrature PointsGeometry Processing
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.
| Year | Citations | |
|---|---|---|
Page 1
Page 1