Abstract
This paper presents an implementation of an in-place swap-based algorithm for transposing rectangular matrices, and a proof of correctness is also sketched. The implementation is based on an algorithm described by Tretyakov and Tyrtyshnikov [4], but we have introduced a number of variations. In particular, we show how the original algorithm can be modified to require constant additional memory. We also identify opportunities for exploiting parallelism. © 2014 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Gustavson, F. G., & Walker, D. W. (2014). Algorithms for in-place matrix transposition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8385 LNCS, pp. 105–117). Springer Verlag. https://doi.org/10.1007/978-3-642-55195-6_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
