Pages that link to "Item:Q3742603"
From MaRDI portal
The following pages link to A compact row storage scheme for Cholesky factors using elimination trees (Q3742603):
Displaying 17 items.
- Parallel sparse Gaussian elimination with partial pivoting (Q753685) (← links)
- On the row merge tree for sparse LU factorization with partial pivoting (Q878210) (← links)
- Task scheduling for parallel sparse Cholesky factorization (Q915427) (← links)
- Solution of sparse positive definite systems on a hypercube (Q1124265) (← links)
- A parallel interior point algorithm for linear programming on a network of transputers (Q1309858) (← links)
- On constructing the elimination tree (Q1314332) (← links)
- Refining an approximate inverse (Q1591188) (← links)
- \(LU\)-decomposition and numerical structure for solving large sparse nonsymmetric linear systems (Q1609048) (← links)
- Tree organization of the data structure for Cholesky factorization (Q1904005) (← links)
- Improving parallel ordering of sparse matrices using genetic algorithms (Q2576753) (← links)
- Fast Implementation of the Traveling-Salesman-Problem Method for Reordering Columns within Supernodes (Q3382788) (← links)
- An Application of Generalized Tree Pebbling to Sparse Matrix Factorization (Q3773170) (← links)
- Efficient Solution of a Sparse Non-symmetric System of Linear Equations (Q4531360) (← links)
- Sparse matrix representations in a functional language (Q4880528) (← links)
- Exactly Solving Sparse Rational Linear Systems via Roundoff-Error-Free Cholesky Factorizations (Q5071429) (← links)
- Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems (Q5270774) (← links)
- A survey of direct methods for sparse linear systems (Q5740079) (← links)
