How good can polynomial interpolation on the sphere be? (Q5950881)

From MaRDI portal
Revision as of 23:46, 4 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1683474
Language Label Description Also known as
English
How good can polynomial interpolation on the sphere be?
scientific article; zbMATH DE number 1683474

    Statements

    How good can polynomial interpolation on the sphere be? (English)
    0 references
    0 references
    0 references
    18 December 2001
    0 references
    The paper deals with polynomial interpolation over the sphere \(S^2 \subset \mathbb{R} ^3\). The authors study the question of investigating the closeness of the rate of growth of the norm of the interpolation operator by a judicious choice of interpolation points, to the optimal order achieved by orthogonal projection and hyperinterpolation (see \textit{I. H. Sloan}, J. Approximation Theory 83, No. 2, 238-254 (1995; Zbl 0839.41006)). The main focus of the paper is on the numerical results obtained by computational optimization, rather than on the optimization techniques themselves. Numerical results on uniform errors for approximating a set of test functions, by both interpolation and hyperinterpolation, as well as by non--polynomial interpolation with certain global basis function have also been presented.
    0 references
    0 references
    interpolation on the sphere
    0 references
    uniform norm
    0 references
    spherical polynomial
    0 references

    Identifiers