## Abstract We consider the problem of approximately reconstructing a function __f__ defined on the surface of the unit sphere in the Euclidean space โ^__q__ +1^ by using samples of __f__ at scattered sites. A central role is played by the construction of a new operator for polynomial approximation
Constructive Polynomial Approximation on the Sphere
โ Scribed by Ian H. Sloan; Robert S. Womersley
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 262 KB
- Volume
- 103
- Category
- Article
- ISSN
- 0021-9045
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
explained how Daubechies used this Fourier transform to construct wavelets. The existence, uniqueness, and orthogonality of Daubechies wavelets is proved. It is also shown how other wavelets can be designed using the Fourier transform. Finally, Chapter 9 shows that wavelets can approximate signals a
Let E be a subspace of C(X) and let R(E)= gรh: g, h # E ; h>0]. We make a simple, yet intriguing observation: if zero is a best approximation to f from E, then zero is a best approximation to f from R(E ). We also prove that if That extends the results of P. Borwein and S. Zhou who proved it for t
This paper investigates the convergence condition for the polynomial approximation of rational functions and rational curves. The main result, based on a hybrid expression of rational functions (or curves), is that two-point Hermite interpolation converges if all eigenvalue moduli of a certain r\_r
In this paper, we consider computations involving polynomials with inexact coefficients, i.e. with bounded coefficient errors. The presence of input errors changes the nature of questions traditionally asked in computer algebra. For instance, given two polynomials, instead of trying to compute their