✦ LIBER ✦

A partitioning algorithm for block-diagonal matrices with overlap

✍ Scribed by Guy Antoine Atenekeng Kahou; Laura Grigori; Masha Sosonkina

Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 186 KB
Volume: 34
Category: Article
ISSN: 0167-8191
DOI: 10.1016/j.parco.2008.01.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a norm compression inequality for par

On a norm compression inequality for partitioned block matrices

✍ Koenraad M.R. Audenaert 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 199 KB

Efficient preconditioning scheme for blo

Efficient preconditioning scheme for block partitioned matrices with structured sparsity

✍ Bill Poirier 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 73 KB

A technique for overlapping computation

A technique for overlapping computation and communication for block recursive algorithms

✍ GUPTA, S. K. S.; HUANG, C.-H.; SADAYAPPAN, P.; JOHNSON, R. W. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 175 KB

This paper presents a design methodology for developing efficient distributed-memory parallel programs for block recursive algorithms such as the fast Fourier transform (FFT) and bitonic sort. This design methodology is specifically suited for most modern supercomputers having a distributed-memory a

A norm compression inequality for block

A norm compression inequality for block partitioned positive semidefinite matrices

✍ Koenraad M.R. Audenaert 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 215 KB

A resizing algorithm for LSI layout with

A resizing algorithm for LSI layout with diagonal edges

✍ Akira Nagao; Takashi Kambe 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 748 KB

A fully parallel block independent set a

A fully parallel block independent set algorithm for distributed sparse matrices

✍ Chi Shen; Jun Zhang 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 233 KB