Abstract
The direct solution of a sparse system of a linear set of equations forms the most computation-intensive part in large-scale finite element analyses. A brief overview is given of some strategies which are well-suited for sequential and parallel processing. Experimental results for a number of typical FE models are presented to demonstrate the effectiveness of these (parallel) solution methods.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. George, J.W. Liu, ‘Computer Solution of Large Sparse Positive Definite Systems’, Prentice Hall, 1981.
B. Speelpenning, ‘The generalized element method’, Report UIUCDCS-R-78–946, Department of Computer Science, University of Illinois.
N.E. Gibbs, N.G. Poole Jr and P.K. Stockmeyer, ‘An algorithm for reducing the bandwidth and profile of a sparse matrix’SIAM J. Numer. Anal. 13236–250 (1976).
N.E. Gibbs, ‘A hybrid profile reduction algorithm’ACM Trans. Math. Software 2378–387 (1976).
H.X. Lin, ‘A Methodology for Parallel Direct Solution of Finite Systems’, PhD Thesis, Delft University of Technology, 1993.
Charbel Farhat, ‘Parallel Computational Strategies for Large Space and Aerospace Flexible Structures: Algorithms, Implementations and Performance.’ In Supercomputing in Engineering Structures, Computational Mechanics Publications, Springer Verlag, Berlin (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media Dordrecht
About this paper
Cite this paper
Nauta, P. (1994). Algorithms for the Parallel Direct Solution of Sparse Linear Systems. In: Kusters, G.M.A., Hendriks, M.A.N. (eds) DIANA Computational Mechanics ‘94. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-1046-4_29
Download citation
DOI: https://doi.org/10.1007/978-94-011-1046-4_29
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-4454-7
Online ISBN: 978-94-011-1046-4
eBook Packages: Springer Book Archive