Optimal Lebesgue constants for least squares polynomial approximation on the (hyper)sphere

Abstract

We investigate the uniform approximation provided by least squares polynomials on the unit Euclidean sphere Sq in Rq+1, with q 2. Like any other polynomial projection, the study concerns the growth, as the degree n tends to infinity, of the associated Lebesgue constant, i.e., of the uniform norm of the least squares operator. If the least squares polynomial of degree n is based on a set of points, which are nodes of a positive weighted quadrature rule of degree of exactness 2n, then we state two different sufficient conditions for having an optimal Lebesgue constant that increases with n at the minimal projections order. Hence, under our assumptions least squares and hyperinterpolation polynomials provide a comparable approximation with respect to the uniform norm.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…