A Compact Storage Scheme for the Solution of Symmetric Linear Simultaneous Equations

Abstract

A method is presented for the computer solution of symmetric linear simultaneous equations which takes advantage of the presence of zero elements away from the leading diagonal but which is more flexible than diagonal band storage. The equations are solved by a form of compact elimination. A routine based on the method has been programmed in Atlas Autocode and used in some analyses of building frameworks. It is found to be economical both in use of store and computing time.