CCL
Lebesgue Constants for CVT/Chebyshev Computations


CCL is a MATLAB program which estimates the Lebesgue constants for sets of points in [-1,+1] computed in several ways. The program is probably of limited interest except as an example of an application of the lebesgue_constant() function.

The cvt_1d_lumping() program was used to compute sets of points of order 5, 9, 17, 33, 65, 129 and 257. These points were the Chebyshev Zero nodes, and CVT points initialized with the Chebyshev Zero nodes, with random values, and with uniform values.

For each class of points, the program computed the Lebesgue constant L(N) and the ration L2(N)=L(N)/log(N+1). The Chebyshev Zero nodes are known to have an asymptotic behavior like log(N+1). If the CVT calculations had been carried out to convergence, then the initializations should not, in general have mattered. However, even though, for a given N, the initializations didn't seem to matter "that much", the differences became extraordinarily significant when the Lebesgue constant was computed on point sets with high N. The CVT generators initialized with Chebyshev Zero nodes had a lower Lebesgue constant than the Chebyshev Zero nodes, but the other two variations had Lebesgue constants that exploded at N=129 and N=257. This could be because of the extraordinarily strong clustering of Chebyshev Zero nodes near the endpoints. A high dimensional point set that doesn't get this endpoint clustering just right will have a terrible Lebesgue constant, even though a plot or a printout of the data will seem to be very close to the Chebyshev Zero nodes...because the important details are in the data at the endpoints and -0.999... and +0.999... digits.

Licensing:

The computer code and data files described and made available on this web page are distributed under the GNU LGPL license.

Languages:

CCL is available in a MATLAB version.

Related Data and Programs:

CVT_1D_LUMPING, a MATLAB program which allows the user to carry out a lumped version of Lloyd's iterative algorithm for a centroidal Voronoi Tessellation (CVT() in the interval [-1,+1], and is applied to investigate a relationship between CVT's and the Chebyshev Zero nodes.

LEBESGUE, a MATLAB library which is given a set of nodes in 1D, and plots the Lebesgue function, and estimates the Lebesgue constant, which measures the maximum magnitude of the potential error of Lagrange polynomial interpolation.

Source Code:

Data Files:

You can go up one level to the MATLAB source codes.


Last revised on 23 August 2016.