𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A constructive algorithm for computing the reachability matrix

✍ Scribed by R. S. H. Mah

Publisher
American Institute of Chemical Engineers
Year
1974
Tongue
English
Weight
222 KB
Volume
20
Category
Article
ISSN
0001-1541

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A practical algorithm for faster matrix
A practical algorithm for faster matrix multiplication
✍ Igor Kaporin πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 69 KB

The purpose of this paper is to present an algorithm for matrix multiplication based on a formula discovered by Pan [7]. For matrices of order up to 10 000, the nearly optimum tuning of the algorithm results in a rather clear non-recursive one-or two-level structure with the operation count comparab

A new parallel matrix multiplication alg
A new parallel matrix multiplication algorithm on distributed-memory concurrent computers
✍ Choi, Jaeyoung πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 139 KB πŸ‘ 3 views

We present a new fast and scalable matrix multiplication algorithm called DIMMA (distribution-independent matrix multiplication algorithm) for block cyclic data distribution on distributed-memory concurrent computers. The algorithm is based on two new ideas; it uses a modified pipelined communicatio

A novel parallel algorithm for large-sca
A novel parallel algorithm for large-scale Fock matrix construction with small locally distributed memory architectures: RT parallel algorithm
✍ Hajime Takashima; So Yamada; Shigeru Obara; Kunihiro Kitamura; Shinjiro Inabata; πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 186 KB

## Abstract We developed a novel parallel algorithm for large‐scale Fock matrix calculation with small locally distributed memory architectures, and named it the β€œ__RT__ parallel algorithm.” The __RT__ parallel algorithm actively involves the concept of integral screening, which is indispensable fo