Parallel implementation of multifrontal schemes
From MaRDI portal
Elimination tree structure is introduced, since it is the principal structure in the multifrontal scheme. It is shown how the elimination tree is ideally suited to parallel processing. The author describes how elimination trees can be used for organizing parallel computation and how they generate appropriate data structure for a multifrontal solution algorithm. The paper ends with descriptions of the limitations and ramifications of these schemes and comparison with similar work by others.
Recommendations
- scientific article; zbMATH DE number 4070168
- scientific article; zbMATH DE number 4190981
- A parallel algorithm for elimination tree computation and symbolic factorization
- A parallel multifrontal algorithm and its implementation
- On evaluating elimination tree based parallel sparse cholesky factorizations
Cited in
(36)- A survey of the advances in the exploitation of the sparsity in the solution of large problems
- Solution of sparse positive definite systems on a shared-memory multiprocessor
- Parallel multischeme computation
- Solution of sparse positive definite systems on a hypercube
- A parallel algorithm for elimination tree computation and symbolic factorization
- Modified Krylov acceleration for parallel environments
- A parallel solver for the hp-version of finite element methods
- A retrofit based methodology for the fast generation and optimization of large-scale mesh partitions: Beyond the minimum interface size criterion
- A parallel multifrontal algorithm and its implementation
- Multifrontal parallel distributed symmetric and unsymmetric solvers
- The impact of high-performance computing in the solution of linear systems: Trends and problems
- Computational cost of isogeometric multi-frontal solvers on parallel distributed memory machines
- Multiprocessing a sparse matrix code on the Alliant FX/8
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
- Cached Gaussian elimination for simulating Stokes flow on domains with repetitive geometry
- Parallelization of MM4 numerical model on Dawning-1000
- An efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling
- Multifrontal computations on GPUs and their multi-core hosts
- scientific article; zbMATH DE number 4190981 (Why is no real title available?)
- scientific article; zbMATH DE number 4070168 (Why is no real title available?)
- scientific article; zbMATH DE number 1213968 (Why is no real title available?)
- Data-Parallel Sparse Factorization
- A class of parallel multiple-front algorithms on subdomains
- A multi‐level frontal algorithm for finite element analysis and its implementation on parallel computation
- On evaluating elimination tree based parallel sparse cholesky factorizations
- A parallel sparse direct solver via hierarchical DAG scheduling
- Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems
- Massively parallel implementation of a fast multipole method for distributed memory machines
- Parallel FETI algorithms for mortars
- High Performance Computing for Computational Science - VECPAR 2004
- A survey of direct methods for sparse linear systems
- Parallel implementation of BVM methods
- Vector processing in simplex and interior methods for linear programming
- Parallel sparse Gaussian elimination with partial pivoting
- Task scheduling for parallel sparse Cholesky factorization
- Sparse QR factorization on a massively parallel computer
This page was built for publication: Parallel implementation of multifrontal schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1093319)
