๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Implementing Lanczos-like algorithms on hypercube architectures

โœ Scribed by David S. Scott

Book ID
107745334
Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
917 KB
Volume
53
Category
Article
ISSN
0010-4655

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A class of Lanczos-like algorithms imple
A class of Lanczos-like algorithms implemented on parallel computers
โœ S.K. Kim; A.T. Chronopoulos ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 869 KB

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

Concepts for efficient multigrid impleme
Concepts for efficient multigrid implementation on SUPRENUM-like architectures
โœ Manfred Alef ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 975 KB

Alef, M., Concepts for efficient mnltigrid implementation on SUPRENUM-Iike architectures, Parallel Computing 17 (1991) 1-16. The implementation of algorithms on distributed-memory multiprocessors requires regular exchange of certain intermediate results between the parallel processes. The less data