The following pages link to Barry W. Peyton (Q1311329):
Displaying 20 items.
- Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution (Q1311330) (← links)
- Separators and structure prediction in sparse orthogonal factorization (Q1361831) (← links)
- Maximum cardinality search for computing minimal triangulations of graphs (Q1882406) (← links)
- A clique tree algorithm for partitioning a chordal graph into transitive subgraphs (Q1894513) (← links)
- Large-Scale Normal Coordinate Analysis for Molecular Structures (Q2780540) (← links)
- Minimal Orderings Revisited (Q2784346) (← links)
- A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors (Q3140138) (← links)
- Fast Implementation of the Traveling-Salesman-Problem Method for Reordering Columns within Supernodes (Q3382788) (← links)
- A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization (Q3468542) (← links)
- Fast Computation of Minimal Fill Inside A Given Elimination Ordering (Q3642841) (← links)
- Parallel Algorithms for Sparse Linear Systems (Q3981404) (← links)
- (Q3998906) (← links)
- On Finding Supernodes for Sparse Matrix Computations (Q4033829) (← links)
- Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers (Q4271094) (← links)
- (Q4288578) (← links)
- An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky Factorization (Q4313366) (← links)
- (Q4341536) (← links)
- (Q4764622) (← links)
- Some Results on Structure Prediction in Sparse $QR$ Factorization (Q4880263) (← links)
- (Q5750331) (← links)
