Title :
PRIM: A Fast Matrix Transpose Method
Author :
Goldbogen, Geoffrey C.
Author_Institution :
Office of Computer Services, Rensselaer Polytechnic Institute
fDate :
3/1/1981 12:00:00 AM
Abstract :
An efficient algorithm called PRIM is proposed for transposing an arbitraxy R ×C matrix which is too large to be stored in its entirety in working memory and which instead is stored by rows on disk. PRIM facilitates the execution of numerical matrix algorithms which operate both by rows and by columns.
Keywords :
Fast matrix transposition; intermediate matrix; partial row interchange method; two-dimensional transposition; working memory size; Buffer storage; Iterative algorithms; Fast matrix transposition; intermediate matrix; partial row interchange method; two-dimensional transposition; working memory size;
Journal_Title :
Software Engineering, IEEE Transactions on
DOI :
10.1109/TSE.1981.234523
