Analysis of the solution phase of a parallel multifrontal approach
From MaRDI portal
Publication:991063
Recommendations
- The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
- A fully asynchronous multifrontal solver using distributed dynamic scheduling
- Reducing the I/O Volume in Sparse Out-of-core Multifrontal Methods
- Multifrontal parallel distributed symmetric and unsymmetric solvers
- An out-of-core sparse Cholesky solver
Cites work
- scientific article; zbMATH DE number 3976197 (Why is no real title available?)
- A fully asynchronous multifrontal solver using distributed dynamic scheduling
- An out-of-core sparse Cholesky solver
- Analysis of the solution phase of a parallel multifrontal approach
- Efficient Methods for Out-of-Core Sparse Cholesky Factorization
- Multifrontal parallel distributed symmetric and unsymmetric solvers
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- The Multifrontal Solution of Unsymmetric Sets of Linear Equations
- The Role of Elimination Trees in Sparse Factorization
- The design and implementation of a new out-of-core sparse cholesky factorization method
Cited in
(5)- High scalable non-overlapping domain decomposition method using a direct method for finite element analysis
- A survey of direct methods for sparse linear systems
- scientific article; zbMATH DE number 4190981 (Why is no real title available?)
- Hybrid parallelism of multifrontal linear solution algorithm with out of core capability for finite element analysis
- Analysis of the solution phase of a parallel multifrontal approach
This page was built for publication: Analysis of the solution phase of a parallel multifrontal approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991063)