✦ LIBER ✦

Parallel symbolic factorization of sparse linear systems

✍ Scribed by John R Gilbert; Hjálmtýr Hafsteinsson

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 691 KB
Volume: 14
Category: Article
ISSN: 0167-8191
DOI: 10.1016/0167-8191(90)90104-h

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

On symbolic factorization of partitioned

On symbolic factorization of partitioned sparse symmetric matrices

✍ Alan George; Hamza Rashwan 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 740 KB

Parallel block ILUT/ILDLT preconditionin

Parallel block ILUT/ILDLT preconditioning for sparse eigenproblems and sparse linear systems

✍ Achim Basermann 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 80 KB

The parallel QR factorization algorithm

The parallel QR factorization algorithm for tridiagonal linear systems

✍ Pierluigi Amodio; Luigi Brugnano 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 738 KB

Towards an accurate performance modeling

Towards an accurate performance modeling of parallel sparse factorization

✍ Laura Grigori; Xiaoye S. Li 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 407 KB

A tearing-based hybrid parallel sparse l

A tearing-based hybrid parallel sparse linear system solver

✍ Maxim Naumov; Murat Manguoglu; Ahmed H. Sameh 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 742 KB

We propose a hybrid sparse system solver for handling linear systems using algebraic domain decomposition-based techniques. The solver consists of several stages. The first stage uses a reordering scheme that brings as many of the largest matrix elements as possible closest to the main diagonal. Thi