Scaling transformations and extrapolation algorithms for vector sequences
β Scribed by P. Midy
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 460 KB
- Volume
- 70
- Category
- Article
- ISSN
- 0010-4655
No coin nor oath required. For personal study only.
β¦ Synopsis
This paper describes how scaling transformations can be performed while using extrapolation methods for accelerating the convergence of vector sequences. Several methods are considered: the topological c-algorithm, the normed vector and the vector c-algorithms, and polynomial methods. The topological c-algorithm, which makes an explicit use of the dual space, lends itself naturally to the resolution of this problem. In the case of polynomial methods, scaling transformations may provide a way of checking whether the value chosen for the degree k of the minimum polynomial is a satisfactory one. y = (y'), [y'][x']independent of ~ation is employed, the same relation must hold -
π SIMILAR VOLUMES
A new fast algorithm is presented for the multidimensional discrete Fourier transform (DFT). This algorithm is derived using an interesting technique called "vector coding" (VC), and we call it the vector-coding fast Fourier transform (VC-FFT) algorithm. Since the VC-FFT is an extension of the Coole