4.15 Summary
In this chapter, numerical strategies and the computer software implementation for both symmetrical and unsymmetrical sparse assembly algorithms and solvers have been described. Detailed step-by-step procedures, in the form of the developed “template,” have been presented. A simple numerical example is given to validate the proposed algorithms and their developed computer software.
Finally, detailed input data file has been explained so that the users will have sufficient background and experience to incorporate the developed procedures into his/her large-scale application codes.
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
J. A. George, “Nested Disection of a Regular Finite Element Mesh,” SIAM J. Numer. Anal, volume 15, pp. 1053–1069 (1978)
I. S. Duff and J. K. Reid, “The Design of MA48: A Code for the Direct Solution of Sparse Unsymmetric Linear Systems of Equations,” ACM Trans. Math. Software., 22(2): 187–226 (June 1996)
I. S. Duff and J. Reid, “MA27: A Set of FORTRAN Subroutines for Solving Sparse Symmetric Sets of Linear Equations,” AERE Technical Report, R-10533, Harwell, England (1982)
Rights and permissions
Copyright information
© 2006 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
(2006). Sparse Assembly Process. In: Finite Element Methods: Parallel-Sparse Statics and Eigen-Solutions. Springer, Boston, MA. https://doi.org/10.1007/0-387-30851-2_4
Download citation
DOI: https://doi.org/10.1007/0-387-30851-2_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-29330-1
Online ISBN: 978-0-387-30851-7
eBook Packages: EngineeringEngineering (R0)