✦ LIBER ✦

Optimal parallel triangulation of a sparse matrix

✍ Scribed by Huang, J.; Wing, O.

Book ID: 117914154
Publisher: IEEE
Year: 1979
Weight: 822 KB
Volume: 26
Category: Article
ISSN: 0098-4094
DOI: 10.1109/tcs.1979.1084692

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimal triangulation of a graph and opt

Minimal triangulation of a graph and optimal pivoting order in a sparse matrix

✍ Tatsuo Ohtsuki; Lap Kit Cheung; Toshio Fujisawa 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 596 KB

A direct parallel sparse matrix solver

✍ T.M. Tran; R. Gruber; K. Appert; S. Wuthrich 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 680 KB

The direct sparse matrix solver is based on a domain decomposition technique to achieve data and work parallelization. Geometries that have long and thin structures are specially efficiently tractable with this solver, provided that they can be decomposed mainly in one direction. Due to the separati

Toward an automatic parallelization of s

Toward an automatic parallelization of sparse matrix computations

✍ Roxane Adle; Marc Aiguier; Franck Delaplace 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 493 KB

Optimal Sparse Matrix Dense Vector Multi

Optimal Sparse Matrix Dense Vector Multiplication in

✍ Michael A. Bender; Gerth Stølting Brodal; Rolf Fagerberg; Riko Jacob; Elias Vica 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 608 KB

Parallel computation of a Krylov matrix

Parallel computation of a Krylov matrix for a sparse and structured input

✍ V.Y. Pan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 204 KB

On Optimal Reorderings of Sparse Matrice

On Optimal Reorderings of Sparse Matrices for Parallel Cholesky Factorizations

✍ Lin, Wen-Yang; Chen, Chuen-Liang 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 251 KB