3.11 Summary
In this chapter, various topics related to direct sparse equation solvers for symmetrical/unsymmetrical, positive/negative/infinite system of equations have been explained. Sparse storage schemes, impacts of sparse re-ordering algorithms on the performance of the sparse solvers, sparse symbolic/numerical factorization, and forward and backward solution phases have been discussed. Unrolling strategies, which utilize “super-row” information, have also been incorporated into the factorization and forward/backward solution phases. Several medium- to large-scale, practical applications have been used to evaluate the performance of various proposed algorithms. These sparse solvers will also be used in subsequent chapters of this textbook.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
SGI sparse solver library sub-routine, Scientific Computing Software Library (SCSL) User’s Guide, document number 007-4325-001, published Dec. 30, 2003
I. S. Duff and J. K. Reid, “MA47, a FORTRAN Code for Direct Solution of Indefinite Sparse Symmetric Linear Systems,” RAL (Report) #95-001, Rutherford Appleton Laboratory, Oxon, OX11 OQX (Jan 1995)
G. Karypis and V. Kumar, “ParMETiS: Parallel Graph Partitioning and Sparse Matrix Ordering Library,” University of Minnesota, CS Dept., Version 2.0 (1998)
J. W. H. Liu, “Reordering Sparse Matrices For Parallel Elimination,” Technical Report #87-01, Computer Science, York University, North York, Ontario, Canada (1987)
D. T. Nguyen, G. Hou, B. Han, and H. Runesha, “Alternative Approach for Solving Indefinite Symmetrical System of Equation,” Advances in Engineering Software, Vol. 31 (2000), pp. 581–584, Elsevier Science Ltd.
I. S. Duff, and G. W. Stewart (editors), Sparse Matrix Proceedings 1979, SIAM (1979)
I. S. Duff, R. G. Grimes, and J. G. Lewis, “Sparse Matrix Test Problems,” ACM Trans. Math Software, 15, pp. 1–14 (1989)
G. H. Golub and C. F. VanLoan, “Matrix Computations,” Johns Hopkins University Press, Baltimore, MD, 2nd edition (1989)
A. George and J. W. Liu, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall (1981)
E. Ng and B. W. Peyton, “Block Sparse Choleski Algorithm on Advanced Uniprocessor Computer,” SIAM J. of Sci. Comput., volume 14, pp. 1034–1056 (1993).
H. B. Runesha and D. T. Nguyen, “Vectorized Sparse Unsymmetrical Equation Solver for Computational Mechanics,” Advances in Engr. Software, volume 31, nos. 8–9, pp. 563–570 (Aug.–Sept. 2000), Elsevier
Rights and permissions
Copyright information
© 2006 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
(2006). Direct Sparse Equation Solvers. In: Finite Element Methods: Parallel-Sparse Statics and Eigen-Solutions. Springer, Boston, MA. https://doi.org/10.1007/0-387-30851-2_3
Download citation
DOI: https://doi.org/10.1007/0-387-30851-2_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-29330-1
Online ISBN: 978-0-387-30851-7
eBook Packages: EngineeringEngineering (R0)