Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Algorithms for in-place matrix transposition

Gustavson, Fred G. and Walker, David W. 2019. Algorithms for in-place matrix transposition. Concurrency and Computation: Practice and Experience 31 (13) , e5071. 10.1002/cpe.5071

Full text not available from this repository.


This paper presents implementations of in‐place algorithms for transposing rectangular matrices. One implementation is a swap‐based algorithm described by Tretyakov and Tyrtyshnikov,1 to which we have introduced a number of variations. In particular, we show how the original algorithm can be modified to require constant additional memory. A proof of correctness is also sketched. This algorithm is compared with cycle‐following approaches and with the swap‐based GCD Transpose algorithm that partitions the matrix into a hierarchy of square submatrices. The performance of parallel implementations on a multicore system is also investigated.

Item Type: Article
Date Type: Publication
Status: Published
Schools: Computer Science & Informatics
Publisher: Wiley
ISSN: 1532-0626
Date of Acceptance: 8 October 2018
Last Modified: 10 Jun 2019 10:42

Citation Data

Cited 1 time in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item Edit Item