Abstract
We describe an efficient implementation of the so-called minimum degree algorithm, which experience has shown to produce efficient orderings for sparse positive definite systems. Our algorithm is a modification of the original, tailored to finite element problems, and is shown to induce a partitioning in a natural way. The partitioning is then refined so as to significantly reduce the number of non-null off-diagonal blocks. This refinement is important in practical terms because it reduces storage overhead in our linear equation solver, which utilizes the ordering and partitioning produced by our algorithm. Finally, we provide some numerical experiments comparing our ordering/solver package to more conventional band-oriented packages.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
7. References
Araldsen, P.O., "The application of the superelement method in analysis and design of ship structures and machinery components", National Symposium on Computerized Structural Analysis and Design, George Washington University, March 1972.
C. Berge, The Theory of Graphs and its Applications, John Wiley & Sons Inc., New York, 1962.
Garrett Birkhoff and Alan George, "Elimination by nested dissection" in Complexity of Sequential and Parallel Algorithms (J.F. Traub, editor), Academic Press, New York, 1973, pp.221–269.
Alan George, "Nested dissection of a regular finite element mesh", SIAM J. Numer. Anal., 10 (1973), pp.345–363.
N.E. Gibbs, W.G. Poole and P.K. Stockmeyer, "An algorithm for reducing the bandwidth and profile of a sparse matrix", SIAM J. Numer. Anal., to appear.
M.J.L. Hussey, R.W. Thatcher and M.J.M. Bernal, "Construction and use of finite elements", J. Inst. Math. Appl., 6(1970), pp.262–283.
A. Jennings, "A compact storage scheme for the solution of symmetric linear simultaneous equations", Computer J., 9(1966), pp.281–285.
D.E. Knuth, The Art of Computer Programming, vol.I (Fundamental Algorithms), Addison Wesley, 1968.
S.V. Parter, "The use of linear graphs in Gauss elimination", SIAM Rev., 3(1961), pp. 364–369.
D.J. Rose, "A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations", in Graph Theory and Computing, edited by R.C. Read, Academic Press, New York, 1972.
B. Speelpenning, "The generalized element method", unpublished manuscript.
K.L. Stewart and J. Baty, "Dissection of structures", J. Struct. Div., ASCE, Proc. paper No.4665, (1966), pp.75–88.
James H. Wilkinson, The Algebraic Eigenvalue Problem, Clarendon Press, Oxford, 1965.
O.C. Zienkiewicz, The Finite Element Method in Engineering Science, McGraw Hill, London, 1970.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag
About this paper
Cite this paper
George, A., McIntyre, D.R. (1977). On the application of the minimum degree algorithm to finite element systems. In: Galligani, I., Magenes, E. (eds) Mathematical Aspects of Finite Element Methods. Lecture Notes in Mathematics, vol 606. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0064460
Download citation
DOI: https://doi.org/10.1007/BFb0064460
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08432-7
Online ISBN: 978-3-540-37158-8
eBook Packages: Springer Book Archive