Approximation of Functions
C. W. Clenshaw · The Computer Journal · 1966
Compact storage schemeFig. 8 ever, if the elements are to be entered in a more random fashion then it will be first necessary, by some means, to determine the positions of the first non-zero elements of all the rows before the matrix can be constructed. ConclusionA method of computer storage and method of solution has been developed for symmetric linear simultaneous equations which have zero elements away from the leading diagonal in the matrix of L.H.S. coefficients.The method is versatile and economical as regards use of storage space and computer time for solution, while at the same time not being unduly complex.