✦ LIBER ✦

Efficient matrix partitioning for optical computing

✍ Scribed by H.J. Caulfield; C.M. Verber; R.L. Stermer

Book ID: 103318849
Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 190 KB
Volume: 51
Category: Article
ISSN: 0030-4018
DOI: 10.1016/0030-4018(84)90044-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing theCSdecomposition of a partit

Computing theCSdecomposition of a partitioned orthonormal matrix

✍ G. W. Stewart 📂 Article 📅 1982 🏛 Springer-Verlag 🌐 English ⚖ 370 KB

An efficient method for computing eigenv

An efficient method for computing eigenvalues of a real normal matrix

✍ B.B Zhou; R.P Brent 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 221 KB

Jacobi-based algorithms have attracted attention as they have a high degree of potential parallelism and may be more accurate than QR-based algorithms. In this paper we discuss how to design efficient Jacobi-like algorithms for eigenvalue decomposition of a real normal matrix. We introduce a block J

On partitioning and mapping for hypercub

On partitioning and mapping for hypercube computing

✍ Lionel M. Ni; Chung-Ta King 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 945 KB

Matrix relationships for partition funct

Matrix relationships for partition functions

✍ V. V. Garbovskii 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 193 KB

An efficient heuristic for code partitio

An efficient heuristic for code partitioning

✍ Moez Ayed; Jean-Luc Gaudiot 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 326 KB

In this paper, we propose a heuristic for code partitioning for distributed memory multiprocessors (DMMs). Our method is data-¯ow based where all levels of parallelism can potentially be exploited. Given a weighted directed acyclic graph (DAG) representation of the program, our partitioning algorith

Efficient algorithms for path partitions

✍ Craig Williams; Dana Richards 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 763 KB