Element resequencing for use with a multiple front algorithm

International Journal for Numerical Methods in Engineering

Volumn 39, Issue 23, 1996, Pages 3999-4020

  Scott, J A ^a  

^a RUTHERFORD APPLETON LABORATORY   (United Kingdom)

Author keywords

Finite element equations; Frontal methods; Gaussian elimination; Parse matrices

Indexed keywords

ALGORITHMS; COMPUTER AIDED ANALYSIS; EFFICIENCY; FINITE ELEMENT METHOD; MATRIX ALGEBRA;

LINEAR ALGEBRA;

EID: 0030393464     PISSN: 00295981     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0207(19961215)39:23<3999::AID-NME35>3.0.CO;2-V     Document Type: Article

References (42)

1. B. M. Irons, 'A frontal solution program for finite-element analysis', Int. j. numer. methods eng., 2, 5-32 (1970).
2. P. Hood, 'Frontal solution program for unsymmetric matrices', Int. j. numer. methods eng., 10, 379-400 (1976).
3. I. S. Duff, 'Enhancements to the MA32 package for solving sparse unsymmetric matrices', Harwell Report AERE R11009, HMSO, London, 1983.
4. J. E. Akin and R. M. Pardue, 'Element resequencing for frontal solutions', in J. R. Whiteman (ed.), Mathematics of Finite Elements and Applications, Academic Press, New York, 1975.
5. A. Bykat, 'A note on an element ordering scheme', Int. j. numer. methods eng., 11, 194-198 (1977).
6. A. Razzaque,'Automatic reduction of frontwidth for finite element analysis', Int. j. numer. methods eng., 15, 1315-1324 (1980).
7. H. L. Pina, 'An algorithm for frontwidth reduction', Int. j. numer. methods eng., 17, 1539-1546 (1981).
8. S. W. Sloan and M. F. Randolph, 'Automatic element reordering for finite-element analysis with frontal schemes', Int. j. numer. methods eng., 19, 1153-1181 (1983).
9. S. J. Fenves and K. H. Law, 'A two-step approach to finite element ordering', Int. j. numer. methods eng., 19, 891-911 (1983).
10. S. W. Sloan, 'An algorithm for profile and frontsize reduction of sparse matrices', Int. j. numer. methods eng., 23, 239-251 (1986).
11. M. S. Shephard, P. L. Baehmann and K. R. Griece, The versatility of automatic mesh generators based on tree structures and advanced geometric constructs', Commun, appl. numer. methods, 4, 379-392 (1988).
12. I. S. Duff, J. K. Reid and J. A. Scott, The use of profile algorithms with a frontal code', Int. j. numer. methods eng., 28, 2555-2568 (1989).
13. A. Kaveh, 'A connectivity coordinate system for node and element ordering', Comput. Struct., 41, 1217-1223 (1991).
14. B. U. Koo and B. C. Lee, 'An efficient profile reduction algorithm based on the frontal ordering scheme and graph theory', Comput. Struct., 44, 1339-1347 (1992).
15. S. R. P. Medeiros, P. M. Pimenta and P. Goldenberg, 'An algorithm for profile and frontsize reduction of sparse matrices with a symmetric structure', Eng. Comput., 10, 257-266 (1993).
16. G. H. Paulino, I. F. M. Menezes, M. Gattass and S. Mukherjee, 'Node and element resequencing using the Laplacian of a finite element graph: part I - general concepts and algorithm', Int. j. numer. methods eng., 37, 1511-1530 (1994).
17. I. S. Duff and J. A. Scott, in J. Lewis (ed.), Proc. 5th SIAM Conf. on Applied Linear Algebra, SIAM Press, Philadelphia, PA, 1994, pp. 567-571.
18. I. S. Duff and J. A. Scott, The use of multiple fronts in Gaussian elimination', Rutherford Appleton Laboratory Report RAL-94-040, 1994.
19. Harwell Subroutine Library, 'A catalogue of subroutines (Release 12)', Advanced Computing Department, Harwell Laboratory, Oxfordshire, England.
20. I. S. Duff and J. A. Scott, 'MA42 - a new frontal code for solving sparse unsymmetric systems', Rutherford Appleton Laboratory Report RAL-93-064, 1993.
21. I. S. Duff and J. A. Scott, The design of a new frontal code for solving sparse unsymmetric systems', ACM Trans. Math. Softw., 22, 30-45 (1996).
22. N. E. Gibbs, 'A hybrid profile reduction algorithm', ACM Trans. Math. Softw., 2, 378-387 (1976).
23. N. E. Gibbs, W. G. Poole Jr. and P. K. Stockmeyer, 'An algorithm for reducing the bandwidth and profile of a sparse matrix', SIAM J. Numer. Anal., 13, 236-250 (1976).
24. A. George and W. H. Liu, 'An implementation of a pseudoperipheral node finder', ACM Trans. Math. Softw., 5, 284-295 (1979).
25. I. S. Duff, R. G. Grimes and J. G. Lewis, 'Sparse matrix test problems', ACM Trans. Math. Softw., 15, 1-14 (1989).
26. I. S. Duff, R. G. Grimes and J. G. Lewis, 'User's Guide for the Harwell-Boeing Sparse Matrix Collection', Rutherford Appleton Laboratory Report RAL-92-086, 1992.
27. R. E. Benner, G. R. Montry and G. G. Weigand, 'Concurrent multifrontal methods: shared memory, cache, and frontwidth issues', Int. J. Supercomput. Appl., 1, 26-44 (1987).
28. C. Farhat, 'A simple and efficient automatic FEM domain decomposer', Comput. Struct., 28, 579-602 (1998).
29. J. G. Malone, 'Automatic mesh decomposition and concurrent finite element analysis for hypercube multiprocessor computer', Comput. Methods Appl. Mech. Eng., 70, 20-58 (1998).
30. B. Keringhan and S. Lin, 'An efficient heuristic procedure for partitioning graphs', Bell System Tech. J., 29, 291-307 (1970).
31. H. D. Simon, 'Partitioning of unstructured problems for parallel processing', in Proc. Conf. on Parallel Methods on Large Scale Structural and Physics Applications, Pergamon Press, Oxford, 1991.
32. R. D. Williams, 'Performance of dynamics load balancing algorithms for unstructured mesh calculations', Concurrency, Practice, Experience, 3, 457-482 (1991).
33. A. Pothen, H. D. Simon and K. P. Liou, 'Partitioning sparse matrices with eigenvectors of graphs', SIAM J. Matrix Anal. Appl, 11, 430-452 (1990).
34. B. Hendrickson and R. Leland, 'An improved spectral graph partitioning algorithm for mapping parallel computations', Technical Report SAND92-1460, Sandia National Laboratories, 1992.
35. B. Hendrickson and R. Leland, 'A multilevel algorithm for partitioning graphs', Technical Report SAND93-1301, Sandia National Laboratories, 1993.
36. C. Greenough and R. F. Fowler, 'Partitioning methods for unstructured finite element meshes', Rutherford Appleton Laboratory Report RAL-94-091, 1994.
37. C. Greenough and R. F. Fowler, 'RALPAR - The RAL mesh partitioning program', Rutherford Appleton Laboratory Report RAL-94-092, 1994.
38. B. Hendrickson and R. Leland, The Chaco user's guide, version 1.0', Technical Report SAND92-2339, Sandia National Laboratories, 1993.
39. J. J. Dongarra, J. J. Du Croz, I. S. Duff and S. Hammarling, 'A set of Level 3 Basic Linear Algebra Subprograms', ACM Trans. Math. Software, 16, 1-17 (1990).
40. I. S. Duff and J. K. Reid, The multifrontal solution of indefinite sparse symmetric linear systems', ACM Trans. Math, Software, 9, 302-325 (1983).
41. W. P. Zhang and E. M. Liu, 'A parallel frontal solver on the Alliant FX/80', Comput. Struct., 38, 203-215 (1991).
42. A. Kaveh, 'A note on a two-step approach to element ordering', Int. j. numer. methods eng., 20, 1553-1554 (1984).