Abstract
Publisher Summary This chapter gives an overview over different sparse direct methods and the related literature. The chapter discusses state of art numerical methods for the solution of linear systems. These methods fall belong to the traditional two different classes: direct solution methods based on Gaussian elimination techniques and iterative methods. Developing an efficient parallel or even serial, direct solver for sparse systems of linear equations is a challenging task that has been a subject of research for the past four decades. Recent algorithmic improvements alone have reduced the time required for the sequential direct solution of unsymmetric sparse systems of linear equations by almost an order of magnitude. The main conclusions that can be drawn from this chapter are: (1) the multilevel nested dissection algorithm used to find a fill-in reducing ordering is substantially better than multiple minimum degrees for three-dimensional (3D) irregular matrices, and (2) the multiple minimum degree method performs better for most of the two-dimensional (2D) problems.
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.
