Solution of a large set of simultaneous linear equations by matrix partitioning using random access storage

The solution of a set of linear algebraic equations has always been a fascinating and challenging field, justifying a lot of research investigation. The advent of digital computers has greatly facilitated these investigations and made it possible to extend the solution procedure to larger systems. However9 the physically available core memory of the computer can restrict the problem size. This difficulty can be overcome by using random access devices such as magnetic drums and discs. In this report we present an algorithm which can be adapted to a system having random access storage