Algorithm 38 two computer codes for convergence acceleration
✍ Scribed by S. -Å. Gustafson
- Publisher
- Springer Vienna
- Year
- 1978
- Tongue
- English
- Weight
- 240 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0010-485X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We introduce and discuss new accelerated algorithms for linear discriminant analysis (LDA) in unimodal multiclass Gaussian data. These algorithms use a variable step size, optimally computed in each iteration using (i) the steepest descent, (ii) conjugate direction, and (iii) Newton-Raphson methods
In this paper, we propose a general O-type algorithm for accelerating the convergence of sequences. It generalizes some known sequence transformations such as the O-algorithm, the iterated O2, the iterated A 2, and the T-algorithm. Some general convergence acceleration results are given. Some result