| Abstract: | Many matrix formulations of structural analyses involve matrices having a large proportion of zero elements. By storing only the non-zero elements of all matrices, machine store and time may be utilised effectively, making the simplest matrix formulations feasible as a method of computer solution even for fairly large frame problems. The method of operation of some sparse matrix routines written for use on the Atlas Computer is briefly described and their application to some frame problems is discussed. The term “searching factor” is introduced as a guide to the efficiency of sparse matrix routines. |
