Development of a Bandwidth Reduction Algorithm by Combining the Two-Step Approach and the Frontal Ordering Scheme

이단계 번호 부여 방법과 선단집합 이용방법을 결합한 밴드폭 감소 알고리즘 개발

A new bandwidth reduction algorithm is developed by combining the two-step approach and the frontal ordering scheme. In the two-step approach, finite elements are numbered first, followed by nodal numbering based on the graph theory. The concept of wave front is incorporated into it to control the cardinality of the set of adjacent nodes and the bandwidth to be achieved. They are controlled systematically by rational selection of next candidates with the purpose of getting the smaller bandwidth efficiently. Eighteen meshes are renumbered and the results are compared with those of well-known algorithms. The results demonstrate the efficiency and the reliability of the proposed algorithm.

본 연구에서는 그래프 이론에 기초한 이단계 번호 부여 방법에 목표밴드폭을 도입하여 계산시간이 짧으면서도 효율적으로 번호를 부여할 수 있는 방법을 제안하고 자 한다.