Abstract
The minimum degree algorithm is well known and widely used to find a permutation matrix P such that a sparse symmetric positive definite matrix A can be factored as $PAP^T = LL^T $ to yield a lower triangular matrix L with relatively few nonzero entries. In this paper we show that by compressing the graph of A, when possible, the run time of the minimum degree algorithm can be significantly reduced. Some empirical results for a collection of test matrices are presented.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
