A multi-level finite element nodal ordering using algebraic graph theory
Finite Elements in Analysis and Design
Reducing the bandwidth of sparse symmetric matrices
ACM '69 Proceedings of the 1969 24th national conference
Computer implementation of the finite element method
Computer implementation of the finite element method
Nodal ordering using graph theory and a genetic algorithm
Finite Elements in Analysis and Design
| Hi-index | 0.00 |
In this paper, nodal ordering for profile reduction is performed using an ant colony optimization. The node priority is expressed as a function of vectors containing the graph connectivity properties. Two methods are proposed for obtaining the priority of nodes to reduce the profile of sparse matrices, which can be viewed as an improvement and extension to Sloan's method. Examples are included to illustrate the performance of the present approaches.