Parallel symbolic factorization of sparse linear systems
From MaRDI portal
Problem: Determine the fill-in for a Cholesky factorization before executing the factorization. Development of a fast parallel algorithm and discussion of its complexity for finding the elimination tree and the fill-in is given. Unfortunately nothing is said about communication.
Recommendations
- A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor
- A parallel algorithm for elimination tree computation and symbolic factorization
- A study of the factorization fill‐in for a parallel implementation of the finite element method
- Parallel Algorithms for Sparse Linear Systems
- scientific article; zbMATH DE number 833702
Cited in
(6)- A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor
- A parallel algorithm for elimination tree computation and symbolic factorization
- A study of the factorization fill‐in for a parallel implementation of the finite element method
- scientific article; zbMATH DE number 3999132 (Why is no real title available?)
- A survey of direct methods for sparse linear systems
- A systolic algorithm for solving dense linear systems
This page was built for publication: Parallel symbolic factorization of sparse linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q923593)