Experiences with a matrix bandwidth reduction method applied to a finite element problem

Large sparsely populated matrices of diagonal character are common in finite element calculations. Computer time is saved and exactness improved if the matrix bandwidth is small. Therefore it is useful to apply a bandwidth reduction procedure to finite element programs, which renumbers the nodal points with the goal of minimum differences between neighboured node numbers. A bandwidth reduction algorithm created by Collins was tested. Some improvements were implemented and its applicability extended to large elements, with 8 nodes instead of 4. A test run dealt with a real technical structural problem. The experiences exhibit an excellent efficiency. It is to recommend to append this procedure as prerunning one to all kinds of finite element programs