Fast evaluation and interpolation at the Chebyshev sets of points
β Scribed by Victor Pan
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 279 KB
- Volume
- 2
- Category
- Article
- ISSN
- 0893-9659
No coin nor oath required. For personal study only.
β¦ Synopsis
Stable polynomial evaluation and interpolation at n Chebyshev or adjusted (expanded) Chebyshev points is performed using O(nlog' n) arithmetic operations, to be compared with customary algorithms either using on the order of n* operations or being unstable. We also evaluate a polynomial of degree d at the sets of n Chebyshev or adjusted (expanded) Chebyshev points using O(dlog d log n) if n 5 d or O((d log d + n) log d) arithmetic operations ifn>d.
π SIMILAR VOLUMES
We present a method for the fast and accurate computation of distributed heat potentials in two dimensions. The distributed source is assumed to be given in terms of piecewise space-time Chebyshev polynomials. We discretize uniformly in time, whereas in space the polynomials are defined on the leaf
The existence of a continuous Chebyshev selection for a Hausdorff continuous set-valued mapping is studied in a Banach space with some uniform convexity. As applications, some existence results of Chebyshev fixed point for condensing set-valued mappings are given, and the existence of Chebyshev solu
A study was designed to compare the performance of six spatial interpolation methods to estimate soil properties at unvisited points. These methods were global mean, moving average, nearest neighbour, inverse squared distance, Laplacian smoothing splines and ordinary point kriging. These methods wer
## Abstract ## Purpose To compare balanced steadyβstate free precession (SSFP) and segmented fast low angle shot (FLASH) for quantification of left and right ventricular volumes and function and for left ventricular mass at high field (3 Tesla). ## Materials and Methods A total of 33 patients (1