Spectral methods on triangles and other domains
Journal of Scientific Computing
Tensor product Gauss-Lobatto points are Fekete points for the cube
Mathematics of Computation
An Algorithm for Computing Fekete Points in the Triangle
SIAM Journal on Numerical Analysis
Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
SIAM Journal on Optimization
Journal of Global Optimization
Improved Lebesgue constants on the triangle
Journal of Computational Physics
Nodal configurations and voronoi tessellations for triangular spectral elements
Nodal configurations and voronoi tessellations for triangular spectral elements
Uniform approximation by discrete least squares polynomials
Journal of Approximation Theory
Polymorphic nodal elements and their application in discontinuous Galerkin methods
Journal of Computational Physics
Computing approximate Fekete points by QR factorizations of Vandermonde matrices
Computers & Mathematics with Applications
Spectral element methods on unstructured meshes: which interpolation points?
Numerical Algorithms
Computing Multivariate Fekete and Leja Points by Numerical Linear Algebra
SIAM Journal on Numerical Analysis
Computing Fekete and Lebesgue points: Simplex, square, disk
Journal of Computational and Applied Mathematics
Hi-index | 7.29 |
We compute point sets on the triangle that have low Lebesgue constant, with sixfold symmetries and Gauss-Legendre-Lobatto distribution on the sides, up to interpolation degree 18. Such points have the best Lebesgue constants among the families of symmetric points used so far in the framework of triangular spectral elements.