Comments on "A Fast Computer Method for Matrix Transposing" and Application to the Solution of Poisson's Equation
U. Schumann · IEEE Transactions on Computers · 1973
In the above correspondence,1an algorithm has been described that allows the transposing of a 2n× 2nmatrix by reading and writing n times at the most via direct access rows of the matrix and by permuting its data elements. The generalization to arbitrary square matrices has not been described, and the generalization to nonsquare matrices has been reported to be impossible.