A graph theoretical method for frontwidth reduction

Advances in Engineering Software

Volumn 30, Issue 9-11, 1999, Pages 789-797

  Kaveh, A ^a   Roosta, G R ^b  

^a IRAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Iran)

^b BUILDING AND HOUSING RESEARCH CENTER   (Iran)

Author keywords

Complexity analysis; Finite elements; Frontwidth reduction; Graph theory; Heeled shortest route tree

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; FINITE ELEMENT METHOD; HEURISTIC METHODS; MATRIX ALGEBRA; TREES (MATHEMATICS);

COMPLEXITY ANALYSIS; FINITE ELEMENT MESH; FRONTWIDTH REDUCTION; GRAPH NODAL ORDERING; HEELED SHORTEST ROUTE TREE; RENUMBERING METHOD; WORST CASE ANALYSIS;

GRAPH THEORY;

EID: 0033184923     PISSN: 09659978     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0965-9978(98)00097-0     Document Type: Article

References (44)

1. Irons BM. A frontal solution program for finite element analysis. International Journal for Numerical Methods in Engineering 1970;2:5-32.
2. George A. Computer implementation of the finite element method. STAN-CS-71-208, Computer Science Department, Stanford, CA, 1971.
3. Silvester PP, Auda HA, Stone GD. A memory-economic frontwidth reduction algorithm. International Journal for Numerical Methods in Engineering 1984;20:733-743.
4. King IP. An automatic reordering scheme for simultaneous equations derived from network systems. International Journal for Numerical Methods in Engineering 1970;2:523-533.
5. Duff IS, Reid JK, Scott JA. The use of profile reduction algorithms with a frontal code. International Journal for Numerical Methods in Engineering 1989;28:2555-2568.
6. Akin JE, Pardue RM. Element resequencing for frontal solutions. In: Whiteman JR, editor. The mathematics of finite elements and applications MAFE LAP, London: Academic Press, 1975, pp. 535-541.
7. Bykat A. A note on an element ordering scheme. International Journal for Numerical Methods in Engineering 1977;11:194-198.
8. Gibbs NE. Algorithm 509: A hybrid profile reduction algorithm. ACM Trans Math Software 1976;2:378-387.
9. Razzaque A. Automatic reduction of frontwidth for finite element analysis. International Journal for Numerical Methods in Engineering 1980;15:1315-1324.
10. Pina HL. An algorithm for frontwidth reduction. International Journal for Numerical Methods in Engineering 1981;17:1539-1545.
11. Sloan SW, Randolph ME. Automatic element reordering for finite element analysis with frontal solution schemes. International Journal for Numerical Methods in Engineering 1983;19:1153-1181.
12. Kaveh A, Ramachandran K. Graph theoretical approach for band-width and frontwidth reductions. In: Nooshin H, editor. Proc of the 3rd International Conference on Space Structures, Surrey University, 1984, pp. 244-249.
13. Webb JP, Froncioni A. A time-memory trade-off frontwidth reduction algorithm for finite element analysis. International Journal for Numerical Methods in Engineering 1986;23:1905-1914.
14. Sloan SW. An algorithm for profile and wavefront reduction of sparse matrices. International Journal for Numerical Methods in Engineering 1986;23:239-251.
15. Sloan SW. A Fortran program for profile and wavefront reduction. International Journal for Numerical Methods in Engineering 1989;28:2651-2679.
16. Hoit M, Garcelon JH. Updated profile front minimization algorithm. Computers and Structures 1989;33:903-914.
17. Duff IS, Reid JK, Scott JA. The use of profile reduction algorithms with a frontal code. International Journal for Numerical Methods in Engineering 1989;28:2555-2568.
18. Souza CC, Keunings R, Wolsey LA, Zone O. A new approach to minimizing the frontwidth in finite element calculations. Computer Methods in Applied Mechanics and Engineering 1994;111:323-334.
19. Souza LT, Murray DW. A unified set of resequencing algorithms. International Journal for Numerical Methods in Engineering 1995;38:565-581.
20. Kaveh A. Optimal structural analysis, UK: RSP (Wiley), 1997.
21. Kaveh A, Roosta GR. Comparative study of finite element nodal ordering methods. Engineering Structures 1998;20:86-96.
22. Cuthill E, McKeee JM. Reducing the bandwidth of sparse symmetric matrices. In: Proc of the 24th National Conference, New York: ACM (Assoc Comput Machinery), P69, 1969, pp. 157-172.
23. Crane HL, Gibbs NE, Poole Jr Wg, Stockmeyer PK. Algorithm 508: matrix bandwidth and profile reduction. ACM Trans Math Software 1976;2:375-377.
24. Gibbs NE, Poole Jr WG, Stockmeyer PK, Stockmeyer An algorithm for reducing the bandwidth, profile of a sparse matrix. SIAM Journal of Numerical Analysis 1976;13:236-250.
25. Kaveh A. Structural mechanics: graph and matrix methods, 2nd ed. Chichester, UK: RSP (Wiley), 1995.
26. Everstine GC. A comparison of three resequencing algorithms for the reduction of matrix profile and wavefront. International Journal for Numerical Methods in Engineering 1979;14:837-853.
27. Armstrong BA. Near-minimal matrix profile and wavefronts for testing nodal resequencing algorithms. International Journal for Numerical Methods in Engineering 1985;21:1785-1790.
28. Sloan SW, Ng WS. A direct comparison of three algorithms for reducing profile and wavefront. Computers and Structures 1989;33:411-419.
29. Plesek J. Near optimum element renumbering scheme for frontal solver. International Journal for Numerical Methods in Engineering, (in press).
30. Armstrong BA. A hybrid algorithm for reducing matrix bandwidth. International Journal for Numerical Methods in Engineering 1984;20:1929-1940.
31. Burgessand IW, Lai PKF. A new mode renumbering algorithm for bandwidth reduction. International Journal for Numerical Methods in Engineering 1986;23:1693-1704.
32. Lim IL, Johnstonand IW, Choi SK. A comparison of algorithms for profile reduction of sparse matrices. Computers and Structures 1995;57:297-302.
33. Kaveh A. Ordering for bandwidth reduction. Computers and Structures 1986;24:413-420.
34. George A, Liu IWH. An implementation of a pseudoperipheral node finder. ACM Trans Math Software 1979;5:284-295.
35. Souza LT, Murray DW. An alternative pseudoperipheral node finder for resequencing schemes. International Journal for Numerical Methods in Engineering 1993;36:3351-3379.
36. Hood P. Frontal solution program for unsymmetric matrices. International Journal for Numerical Methods in Engineering 1976;10:379-399.
37. Wilson E, Dovey H. Solution or reduction of equilibrium equations for large complex structural systems. Advance Engineering Software 1978;1:19-25.
38. Lesoinne M, Farhat C, Geradin M. Parallel/vector improvements of the frontal method. International Journal for Numerical Methods in Engineering 1991;32:1267-1281.
39. Geradin M. Solution algorithms for static and eigenvalue problems, Part 4, Ch. 1. In: Kardestuncer H, Norrie DH, editors. Finite element handbook, Section 1.1. New York: McGraw Hill, 1987, pp. 4.3-4.36.
40. Duff IS. The influence of vector and parallel processors on numerical analysis. In: Proc of the IMA/SIAM Conference, The state of the art in numer anal, University Birmingham, 1986, pp. 359-407.
41. Brusa L, Riccio F. A frontal technique for vector computers. International Journal for Numerical Methods in Engineering 1989;28:1635-1644.
42. Löhner R. Some useful renumbering strategies for unstructured grids. International Journal for Numerical Methods in Engineering 1993;36:3259-3270.
43. Carey GF, Oden JT. Finite elements: computational aspect, Vol. III. Englewood Cliffs, NJ: Prentice-Hall, 1984.
44. Smith JD. Design and analysis of algorithms. USA: PWS-KENT, 1989.