An efficient profile reduction algorithm based on the frontal ordering scheme and the graph theory

Abstract A frontal ordering scheme is incorporated into the two step approach of finite element ordering. The algorithm involves ordering of the finite elements by the Cuthill-McKee algorithm and numbering of the nodes by a newly proposed scheme. The scheme is introduced for an efficient reduction of profiles of resulting stiffness matrices and is based on the concept of frontal ordering and the adjacency measure of the graph theory. A computer program is developed and many examples are tested. The results are compared with those of existing algorithms and demonstrate the efficiency and the reliability of the proposed algorithm.

[1]  Georges Akhras,et al.  An automatic node relabelling scheme for minimizing a matrix or network bandwidth , 1976 .

[2]  Jari Puttonen,et al.  Simple and effective bandwidth reduction algorithm , 1983 .

[3]  A. H. Sherman,et al.  Comparative Analysis of the Cuthill–McKee and the Reverse Cuthill–McKee Ordering Algorithms for Sparse Matrices , 1976 .

[4]  R. Collins.  Bandwidth reduction by automatic renumbering , 1973 .

[5]  Ian P. King,et al.  An automatic reordering scheme for simultaneous equations derived from network systems , 1970 .

[6]  E. Cuthill,et al.  Reducing the bandwidth of sparse symmetric matrices , 1969, ACM '69.

[7]  Norman E. Gibbs,et al.  Algorithm 509: A Hybrid Profile Reduction Algorithm [F1] , 1976, TOMS.

[8]  Steven J. Fenves,et al.  A two‐step approach to finite element ordering , 1983 .

[9]  Gordon C. Everstine,et al.  A comparasion of three resequencing algorithms for the reduction of matrix profile and wavefront , 1979 .

[10]  G. G. Alway,et al.  An algorithm for reducing the bandwidth of a matrix of symmetrical configuration , 1965, Comput. J..

[11]  Henry R. Grooms.  Algorithm for Matrix Bandwidth Reduction , 1972 .

[12]  William G. Poole,et al.  An algorithm for reducing the bandwidth and profile of a sparse matrix , 1976 .

[13]  William F. Smyth,et al.  An Improved Method for Reducing the Bandwidth of Sparse Symmetric Matrices , 1971, IFIP Congress.

[14]  Norman E. Gibbs,et al.  Algorithm 508: Matrix Bandwidth and Profile Reduction [F1] , 1976, TOMS.

[15]  Alan Jennings,et al.  Matrix Computation for Engineers and Scientists , 1977 .

[16]  F. A. Akyuz,et al.  An automatic node-relabeling scheme for bandwidth minimization of stiffness matrices. , 1968 .