𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient storage scheme and algorithms for W-matrix vector multiplication on vector computers

✍ Scribed by Huang, H.S.; Lu, C.N.

Book ID
121746599
Publisher
IEEE
Year
1994
Tongue
English
Weight
984 KB
Volume
9
Category
Article
ISSN
0885-8950

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Linear combination of Lanczos vectors: A
Linear combination of Lanczos vectors: A storage-efficient algorithm for sparse matrix eigenvector computations
✍ T. Koslowski; W. Von Niessen πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 634 KB

We present a storage-efficient and robust algorithm for the computation of eigenvectors of large sparse symmetrical matrices using a Lanczos scheme. The algorithm is based upon a linear combination of Lanczos vectors (LCLV) with a variable iteration depth. A simple method is given to determine the i

Degree of scalability: scalable reconfig
Degree of scalability: scalable reconfigurable mesh algorithms for multiple addition and matrix–vector multiplication
✍ Ramachandran Vaidyanathan; Jerry L Trahan; Chun-ming Lu πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 176 KB

The usual concern when scaling an algorithm on a parallel model of computation is preserving efficiency while increasing or decreasing the number of processors. Many algorithms for reconfigurable models, however, attain constant time at the expense of an inefficient algorithm. For these algorithms,