✦ LIBER ✦

Nested-Dissection Orderings for Sparse LU with Partial Pivoting

✍ Scribed by Brainman, Igor; Toledo, Sivan

Book ID: 118215986
Publisher: Society for Industrial and Applied Mathematics
Year: 2002
Tongue: English
Weight: 238 KB
Volume: 23
Category: Article
ISSN: 0895-4798
DOI: 10.1137/s0895479801385037

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the row merge tree for sparse LU fact

On the row merge tree for sparse LU factorization with partial pivoting

✍ L. Grigori; M. Cosnard; E.G. Ng 📂 Article 📅 2007 🏛 Springer Netherlands 🌐 English ⚖ 821 KB

Parallel Symbolic Factorization for Spar

Parallel Symbolic Factorization for Sparse LU with Static Pivoting

✍ Grigori, Laura; Demmel, James W.; Li, Xiaoye S. 📂 Article 📅 2007 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 550 KB

Symbolic and Exact Structure Prediction

Symbolic and Exact Structure Prediction for Sparse Gaussian Elimination with Partial Pivoting

✍ Grigori, Laura; Gilbert, John R.; Cosnard, Michel 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 585 KB

Hybridizing nested dissection and halo a

Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering

✍ Pellegrini, Fran�ois; Roman, Jean; Amestoy, Patrick 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 138 KB 👁 2 views

Minimum degree and nested dissection are the two most popular reordering schemes used to reduce fillin and operation count when factoring and solving sparse matrices. Most of the state-of-the-art ordering packages hybridize these methods by performing incomplete nested dissection and ordering by min