论文信息 - A New Method for Minimizing the Bandwidth and Profile of Square Matrices for Triangular Finite Elements Mesh

A New Method for Minimizing the Bandwidth and Profile of Square Matrices for Triangular Finite Elements Mesh

The authors present a new efficient node's numbering method for minimizing the bandwidth and the profile of the stiffness matrix for Cholesky's solving of triangular finite element problems. This method is applied for renumbering the mesh nodes. It is suitable for movement consideration in electrical machines modelling using the moving band method. This method has a simple formulation and is easy to implement, and its performances are compared to those provided by the Gibbs, Poole, and Stockmeyer (GPS) method

[1] Fred W. Glover,et al. Reducing the bandwidth of a sparse matrix with tabu search , 2001, Eur. J. Oper. Res..

[2] J. Pasciak,et al. Computer solution of large sparse positive definite systems , 1982 .

[3] Andrew Lim,et al. Using an evolutionary algorithm for bandwidth minimization , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

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

[5] Ronnie Belmans,et al. Numerical modelling and design of electrical machines and devices , 1999 .

[6] Andrew Lim,et al. A centroid-based approach to solve the bandwidth minimization problem , 2004, 37th Annual Hawaii International Conference on System Sciences, 2004. Proceedings of the.

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

[8] R. Stephenson. A and V , 1962, The British journal of ophthalmology.

[9] S. Ratnajeevan,et al. Rotor motion in the dynamic finite element analysis of rotating electrical machinery , 1985 .

[10] Scott W. Sloan,et al. A FORTRAN program for profile and wavefront reduction , 1989 .