LOCALIZED LINEAR POLYNOMIAL OPERATORS AND QUADRATURE FORMULAS ON THE SPHERE

• Published in: SIAM journal on numerical analysis 2008-01, Vol.47 (1), p.440-466
• Main Authors: LE GIA, Q. T., MHASKAR, H. N.
• Format: Article
• Language: English
• Subjects: Algorithms; Applied mathematics; Approximation; Construction; Degrees of polynomials; Integers; Learning; Least squares; Linear polynomials; Mathematical functions; Mathematical vectors; Numerical quadratures; Polynomials; Random variables
• ISSN: 0036-1429; 1095-7170
• DOI: 10.1137/060678555

The purpose of this paper is to construct universal, auto-adaptive, localized, linear, polynomial (-valued) operators based on scattered data on the (hyper) sphere ${\Bbb S}^{q}$ (q ≥ 2). The approximation and localization properties of our operators are studied theoretically in deterministic as well as probabilistic settings. Numerical experiments are presented to demonstrate their superiority over traditional least squares and discrete Fourier projection polynomial approximations. An essential ingredient in our construction is the construction of quadrature formulas based on scattered data, exact for integrating spherical polynomials of (moderately) high degree. Our formulas are based on scattered sites; i.e., in contrast to such well-known formulas as Driscoll—Healy formulas, we need not choose the location of the sites in any particular manner. While the previous attempts to construct such formulas have yielded formulas exact for spherical polynomials of degree at most 18, we are able to construct formulas exact for spherical polynomials of degree 178.