๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


Polynomial approximation on the sphere u
โœ Frank Filbir; W. Themistoclakis ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 219 KB

## 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

W. Freeden, T. Gervens, and M. Schreiner
โœ Walter Van Assche ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 45 KB

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

Another Note on Polynomial vs Rational A
โœ Boris Shekhtman ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 221 KB

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

On the Convergence of Polynomial Approxi
โœ Guo-Jin Wang; Thomas W. Sederberg; Falai Chen ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 389 KB

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

On Approximate GCDs of Univariate Polyno
โœ N.K. Karmarkar; Y.N. Lakshman ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 403 KB

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