Publication:4288584
From MaRDI portal
zbMath0794.65019MaRDI QIDQ4288584
Robert Schreiber, Alex Pothen, Fernando L. Alvarado
Publication date: 31 August 1994
directed acyclic graph; graph partitioning; chordal graph; transitive closure; elimination tree; sparse triangular systems; partitioned inverse; connection machine CM-2; highly parallel algorithm
65F50: Computational methods for sparse matrices
68R10: Graph theory (including graph drawing) in computer science
65Y05: Parallel numerical computation
65F05: Direct numerical methods for linear systems and matrix inversion
65F25: Orthogonalization in numerical linear algebra
Related Items
A new efficient algorithm for computing Gröbner bases \((F_4)\), Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution, A locally optimized reordering algorithm and its application to a parallel sparse linear system solver, The impact of high-performance computing in the solution of linear systems: Trends and problems, A clique tree algorithm for partitioning a chordal graph into transitive subgraphs