Pages that link to "Item:Q1123535"

The following pages link to Reordering sparse matrices for parallel elimination (Q1123535):

Displaying 19 items.

• Task scheduling for parallel sparse Cholesky factorization (Q915427) (← links)
• Sparse QR factorization on a massively parallel computer (Q973426) (← links)
• Solution of sparse positive definite systems on a hypercube (Q1124265) (← links)
• Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution (Q1311330) (← links)
• A locally optimized reordering algorithm and its application to a parallel sparse linear system solver (Q1343678) (← links)
• A parallel solver for the \(hp\)-version of finite element methods (Q1371905) (← links)
• Finding optimal ordering of sparse matrices for column-oriented parallel Cholesky factorization (Q1402303) (← links)
• A parallel multi-\(p\) method (Q1569994) (← links)
• The impact of high-performance computing in the solution of linear systems: Trends and problems (Q1591200) (← links)
• Independent set orderings for parallel matrix factorization by Gaussian elimination (Q1823612) (← links)
• A clique tree algorithm for partitioning a chordal graph into transitive subgraphs (Q1894513) (← links)
• Minimum communication cost reordering for parallel sparse Cholesky factorization (Q1960600) (← links)
• Improving parallel ordering of sparse matrices using genetic algorithms (Q2576753) (← links)
• A heuristic approach to the treedepth decomposition problem for large graphs (Q2672434) (← links)
• Evaluation of Orderings for Unsymmetric Sparse Matrices (Q3774817) (← links)
• Multicolor reordering of sparse matrices resulting from irregular grids (Q3796632) (← links)
• Reordering for parallelism (Q4392334) (← links)
• PMORSy: parallel sparse matrix ordering software for fill-in minimization (Q5268923) (← links)
• A survey of direct methods for sparse linear systems (Q5740079) (← links)