Computing Fekete and Lebesgue points: Simplex, square, disk

Authors:
Matteo Briani;Alvise Sommariva;Marco Vianello
Affiliations:
-;-;-
Venue:
Journal of Computational and Applied Mathematics
Year:
2012

Citing 15
Cited 2

On certain configurations of points in Rn which are unisolvent for polynomial interpolation

Journal of Approximation Theory
Spectral methods on triangles and other domains

Journal of Scientific Computing
From Electrostatics to Almost Optimal Nodal Sets for Polynomial Interpolation in a Simplex

SIAM Journal on Numerical Analysis
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
Spectral element methods on triangles and quadrilaterals: comparisons and applications

Journal of Computational Physics
Improved Lebesgue constants on the triangle

Journal of Computational Physics
Bivariate Lagrange interpolation at the Padua points: The generating curve approach

Journal of Approximation Theory
Hyperinterpolation on the square

Journal of Computational and Applied Mathematics
Bivariate Lagrange interpolation at the Padua points: the ideal theory approach

Numerische Mathematik
Uniform approximation by discrete least squares polynomials

Journal of Approximation Theory
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
Padua2DM: fast interpolation and cubature at the Padua points in Matlab/Octave

Numerical Algorithms
Computing Multivariate Fekete and Leja Points by Numerical Linear Algebra

SIAM Journal on Numerical Analysis

Computing almost minimal formulas on the square

Journal of Computational and Applied Mathematics
On the generation of symmetric Lebesgue-like points in the triangle

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	7.29

Visualization

Abstract

We have computed point sets with maximal absolute value of the Vandermonde determinant (Fekete points) or minimal Lebesgue constant (Lebesgue points) on three basic bidimensional compact sets: the simplex, the square, and the disk. Using routines of the Matlab Optimization Toolbox, we have obtained some of the best bivariate interpolation sets known so far.