Abstract
We present new local-memory multiprocessor algorithms for solving sparse triangular systems of equations that arise in the context of Cholesky factorization. Unlike in the existing algorithms, we use the notion of the elimination tree and achieve significant improvement in the performance of both the forward and backward substitution phases. Our algorithms also incorporate the generalization of an important technique of Li and Coleman that gave rise to the best performance for dense triangular system solution.
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.
