A New Implementation of Sparse Gaussian Elimination
From MaRDI portal
Publication:3953077
DOI10.1145/356004.356006zbMath0491.65013OpenAlexW2089898547MaRDI QIDQ3953077
Publication date: 1982
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/356004.356006
Cholesky factorizationsparse matrixLU factorizationefficient implementationirreducible, symmetric positive definite matrix
Factorization of matrices (15A23) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Search-space size in contraction hierarchies, 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, Acoustic inverse scattering via Helmholtz operator factorization and optimization, Solution of sparse positive definite systems on a hypercube, On the Complexity of the Block Low-Rank Multifrontal Factorization, An Application of Generalized Tree Pebbling to Sparse Matrix Factorization, On the tree-depth of random graphs, A survey of direct methods for sparse linear systems, On evaluating elimination tree based parallel sparse cholesky factorizations, Robust Memory-Aware Mappings for Parallel Multifrontal Factorizations, Parallel sparse Gaussian elimination with partial pivoting, High-performance sampling of generic determinantal point processes, Improving parallel ordering of sparse matrices using genetic algorithms, Improving Multifrontal Methods by Means of Block Low-Rank Representations, A parallel interior point algorithm for linear programming on a network of transputers, A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS - I CHOLESKY FACTORIZATION, Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems
