An Application of Generalized Tree Pebbling to Sparse Matrix Factorization
DOI10.1137/0608031zbMATH Open0634.65015OpenAlexW2121964667MaRDI QIDQ3773170FDOQ3773170
Authors: Joseph W. H. Liu 
Publication date: 1987
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0608031
Recommendations
- An Adaptive General Sparse Out-Of-Core Cholesky Factorization Scheme
- A Note on Sparse Factorization in a Paging Environment
- On Optimal Reorderings of Sparse Matrices for Parallel Cholesky Factorizations
- The design and implementation of a new out-of-core sparse cholesky factorization method
- On the storage requirement in the out-of-core multifrontal method for sparse factorization
multifrontal methodelimination treeout-of-core Cholesky factorizationpebble game for rooted treesstorage reductiontree pebbling
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Factorization of matrices (15A23)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Separator Theorem for Planar Graphs
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- Complexity Results for Bandwidth Minimization
- Title not available (Why is that?)
- A New Implementation of Sparse Gaussian Elimination
- A polynomial algorithm for the min-cut linear arrangement of trees
- Black-white pebbles and graph separation
- Asymptotically tight bounds on time-space trade-offs in a pebble game
- A compact row storage scheme for Cholesky factors using elimination trees
- Storage requirements for deterministic polynomial time recognizable languages
- The space complexity of pebble games on trees
- The Pebbling Problem is Complete in Polynomial Space
- A comparison of two variations of a pebble game on graphs
- On the storage requirement in the out-of-core multifrontal method for sparse factorization
- An Adaptive General Sparse Out-Of-Core Cholesky Factorization Scheme
Cited In (6)
- A survey of direct methods for sparse linear systems
- Optimal memory-aware backpropagation of deep join networks
- Minimizing I/Os in Out-of-Core Task Tree Scheduling
- On the target pebbling conjecture
- Scheduling series-parallel task graphs to minimize peak memory
- Robust memory-aware mappings for parallel multifrontal factorizations
Uses Software
This page was built for publication: An Application of Generalized Tree Pebbling to Sparse Matrix Factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3773170)
