Algorithms for in-place matrix transposition

Gustavson, Fred G. and Walker, David W. ORCID: https://orcid.org/0000-0002-1360-6330 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.

Abstract

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:	25 Oct 2022 13:37
URI:	https://orca.cardiff.ac.uk/id/eprint/120365

Citation Data

Cited 2 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item