Adaptation of the Jacobi Method for a Computer with Magnetic-tape Backing Store

Abstract

The Jacobi method for diagonalizing symmetric matrices requires, in its usual form, that the matrix be held in a random-access store. Two variations of the method are described which make it suitable for matrices held on a serial-access store, such as a magnetic tape. Techniques are described for applying these methods to computers with from one to six magnetic-tape units.