A Fast Reordering Algorithm for Parallel Sparse Triangular Solution

DOI10.1137/0913036zbMath0744.65024OpenAlexW1976964180MaRDI QIDQ3991056

Alex Pothen, Fernando L. Alvarado

Publication date: 28 June 1992

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/063f6b22d0d49a0ad8a9089cd54353a4590f7020

zbMATH Keywords

directed acyclic graphsparse Cholesky factorizationelimination treetransitive reductionreordering algorithmsparse triangular systemsmassively parallel computers

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Graph theory (including graph drawing) in computer science (68R10) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (7)

A clique tree algorithm for partitioning a chordal graph into transitive subgraphs ⋮ Updating incomplete factorization preconditioners for model order reduction ⋮ A parallel multithreaded sparse triangular linear system solver ⋮ Linear algebra software for large-scale accelerated multicore computing ⋮ A survey of direct methods for sparse linear systems ⋮ Fine-Grained Parallel Incomplete LU Factorization ⋮ Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution

This page was built for publication: A Fast Reordering Algorithm for Parallel Sparse Triangular Solution