The Lebesgue constant is a valuable numerical instrument for linear interpolation because it
provides a measure of how close the interpolant of a function is to the best polynomial …

The Applied and Numerical Harmonic Analysis (ANHA) book series aims to provide the
engineering, mathematical, and scientific communities with significant developments in …

We discuss and compare two greedy algorithms that compute discrete versions of Fekete-
like points for multivariate compact sets by basic tools of numerical linear algebra. The first …

We study uniform approximation of differentiable or analytic functions of one or several
variables on a compact set K by a sequence of discrete least squares polynomials. In …

We propose a homogeneous primal-dual interior-point method to solve sum-of-squares
optimization problems by combining nonsymmetric conic optimization techniques and …

We propose a numerical method (implemented in Matlab) for computing approximate Fekete
points on compact multivariate domains. It relies on the search of maximum volume …

We present a systematic computational framework for generating positive quadrature rules
in multiple dimensions on general geometries. A direct moment-matching formulation that …

Algorithms that combat the curse of dimensionality take advantage of nonuniformity
properties of the underlying functions, which may be rotational (eg, grid alignment) or …

GEOMETRIC WEAKLY ADMISSIBLE MESHES, DISCRETE LEAST SQUARES
APPROXIMATIONS AND APPROXIMATE FEKETE POINTS 1. Introduction In a rec Page 1 …

The constrained mock-Chebyshev least squares interpolation is a univariate polynomial
interpolation technique exploited to cut-down the Runge phenomenon. It takes advantage of …