✦ LIBER ✦

The average parallel complexity of cholesky factorization

✍ Scribed by G. Resta

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 423 KB
Volume: 22
Category: Article
ISSN: 0898-1221
DOI: 10.1016/0898-1221(91)90204-h

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the parallel Cholesky factoriz

A note on the parallel Cholesky factorization of wide banded matrices

✍ John M Conroy 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 346 KB

The average-case parallel complexity of

The average-case parallel complexity of sorting

✍ Ravi B. Boppana 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 219 KB

The design and implementation of the par

The design and implementation of the parallel out-of-core ScaLAPACK LU, QR, and Cholesky factorization routines

✍ D'Azevedo, Eduardo ;Dongarra, Jack 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB 👁 1 views

A perturbation analysis of the problem o

A perturbation analysis of the problem of downdating a Cholesky factorization

✍ C.-T. Pan 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 573 KB

Performance modeling of dense Cholesky f

Performance modeling of dense Cholesky factorization on the MasPar MP-2

✍ Garg, V.; Schimmel, D. E. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 394 KB

In this paper we study various implementations of Cholesky factorization on SIMD architectures. A submatrix algorithm is implemented on the MasPar MP-2 using both block and torus-wrap data mappings. Both LL T and LDL T (square root free) implementations of the algorithm are investigated. The executi

Avoiding the square-root bottleneck in t

Avoiding the square-root bottleneck in the Choleski factorization of a matrix on a parallel computer

✍ David S. Scott 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 231 KB