Abstract
Sparse linear systems occur in areas such as finite element methods and statistics. These systems are often solved on parallel computers due to their size. In this paper a theoretical analysis of parallel sparse QR factorisation using a multifrontal method is undertaken. The analysis is quantified by some estimates of parallel speeds up for various parallel computers. These estimates show that only moderate parallel speedups can be attained.
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.
