A New Implementation of Sparse Gaussian Elimination
From MaRDI portal
Cited in
(20)- Algorithmique et calculs de complexité pour un solveur de type dissections emboîtées. (Algorithmic study and complexity bounds for a nested dissection solver)
- Techniques for parallel manipulation of sparse matrices
- Solution of sparse positive definite systems on a hypercube
- A parallel interior point algorithm for linear programming on a network of transputers
- On the tree-depth of random graphs
- Improving parallel ordering of sparse matrices using genetic algorithms
- Robust memory-aware mappings for parallel multifrontal factorizations
- Search-space size in contraction hierarchies
- An Application of Generalized Tree Pebbling to Sparse Matrix Factorization
- A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS - I CHOLESKY FACTORIZATION
- On evaluating elimination tree based parallel sparse cholesky factorizations
- High-performance sampling of generic determinantal point processes
- Improving multifrontal methods by means of block low-rank representations
- Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems
- On the complexity of the block low-rank multifrontal factorization
- A survey of direct methods for sparse linear systems
- Acoustic inverse scattering via Helmholtz operator factorization and optimization
- A recurrent neural network based on Taylor difference for solving discrete time-varying linear matrix problems and application in robot arms
- How to grade the accuracy of the BLAS
- Parallel sparse Gaussian elimination with partial pivoting
This page was built for publication: A New Implementation of Sparse Gaussian Elimination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3953077)
