Len Bos, Jean-Paul Calvi, Norm Levenberg et al.
Using the concept of Geometric Weakly Admissible Meshes together with an algorithm based on the classical QR factorization of matrices, we compute efficient points for discrete multivariate least squares approximation and Lagrange interpolation.
Jean-Paul Calvi, Phung Van Manh
We give a natural geometric condition that ensures that sequences of Chung-Yao interpolation polynomials (of fixed degree) of sufficiently differentiable functions converge to a Taylor polynomial.
Jean-Paul Calvi, Phung Van Manh
We show that the Lebesgue constant of the real projection of Leja sequences for the unit disk grows like a polynomial. The main application is the first construction of explicit multivariate interpolation points in $[-1,1]^N$ whose Lebesgue constant also grows like a polynomial.