A Fast Computer Method for Matrix Transposing

Abstract

A method is given for transposition of 2n×2n data matrices, larger than available high-speed storage. The data should be stored on an external storage device, allowing direct access. The performance of the algorithm depends on the size of the main storage, which at least should hold 2n+1 points. In that case the matrix has to be read in and written out n times.