Abstract
A straightforward and general computer program for assembling and solving (using Gauss elimination technique) widely sparsed finite element matrix equations with very large bandwidth and capable of handling different degreesβofβfreedom and variable bandwidth at different nodes, is described herein. The program assembles any type of finite elements having arbitrary number of nodes and each node may have differnt degreesβofβfreedom. It requires only a small core memory in the computer, although a fast random access device is also needed. The two very important features of this program are (i) it does not store any zero submatrices within the band and (ii) during the solution of equations all operations dealing with zero submatrices within the band are automatically skipped and thus the savings of a considerable amount of disc storage space and computer time can be effected in many cases. Another feature is that many right hand sides can be handled simultaneously. Hence the program is very economical for structures having widely sparsed matrix equations. A listing of the computer program written in FORTRAN IV for CDC 6400 computer is readily available from the authors, but unfortunately could not be given here because of lack of space. The program is so general that it can be used to solve a wide class of finite element problems without actually having to understand fully the techniques behind it.