✦ LIBER ✦

Parallel sparse Cholesky factorization on a shared memory multiprocessor

✍ Scribed by G Zhang; H.C Elman

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 766 KB
Volume: 18
Category: Article
ISSN: 0167-8191
DOI: 10.1016/0167-8191(92)90014-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A parallel algorithm for sparse symbolic

A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor

✍ Earl Zmijewski; John R Gilbert 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 829 KB

Symbolic Cholesky factorization on a loc

Symbolic Cholesky factorization on a local-memory multiprocessor

✍ Alan George; Micheal T Heath; Esmond Ng; Joseph Liu 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 755 KB

Supernodal symbolic Cholesky factorizati

Supernodal symbolic Cholesky factorization on a local-memory multiprocessor

✍ Esmond Ng 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 547 KB

Parallel Cholesky factorization on ortho

Parallel Cholesky factorization on orthogonal multiprocessors

✍ Przemysław Stpiczyński 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 340 KB

Parallel VLSI test in a shared-memory mu

Parallel VLSI test in a shared-memory multiprocessor

✍ Gil, C. ;Ortega, J. ;Montoya, M. G. 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 214 KB

Parallel algorithms for QR decomposition

Parallel algorithms for QR decomposition on a shared memory multiprocessor

✍ K. Wright 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 733 KB

Wright K., Parallel algorithms for QR decomposition on a shared memory multiprocessor, Parallel Computing 17 (1991) 779-790. Various parallel implementations of algorithms for the QR decomposition of a matrix are compared using shared memory multiprocessors. Algorithms based on both Givens and Hous