Relaxation techniques in the iterative ‘2 × 2’ algorithm
✍ Scribed by R.M. Quick; M.C. Steenkamp; H.G. Miller
- Book ID
- 104267636
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 482 KB
- Volume
- 48
- Category
- Article
- ISSN
- 0045-7825
No coin nor oath required. For personal study only.
✦ Synopsis
The convergence rate of the '2 x 2' algorithm for determining the dominant eigenstate of a Hermitian matrix may be significantly improved using relaxation techniques. A simple operational method for determining an optimal choice of thc relaxation parameter at any given iteration step is presented. A numerical example is presented and compared with the results obtained from other iterative methods.
📜 SIMILAR VOLUMES
We propose a simple and robust algorithm for exact inference in 2 x 2 contingency tables. It is based on recursive relations allowing efficient computation of odds-ratio estimates, confidence limits and p-values for Fisher's test. A factor of 3 10 is gained in terms of computer time compared with th