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.











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)