Population processing — a powerful class of parallel algorithms
✍ Scribed by W. Banzhaf
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 616 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0303-2647
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract It is shown that performance of quantum chemistry program systems on minicomputers may be enhanced by a factor between 2.5 and 2.8 utilizing microprogramming techniques and a computer architecture allowing four processor activities to operate in parallel, i.e., memory access, basic arit
Kim, S.K. and A.T. Chronopoulos, A class of Lanczos-like algorithms implemented on parallel Computers, Parallel Computing 17 (1991) 763-778. The Lanczos algorithm is most commonly used in approximating a small number of extreme eigenvalues and eigenvectors for symmetric large sparse matrices. Main
A new class of algorithms for the processing of parametrically defined curves is presented. All the algorithms are based on the 'divide and conquer ' (subdivision) paradigm. An important feature which marks out this class of algorithms from earlier subdivision-based algorithms is that the curve is c