Abstract
We present a new Algorithm for In-Place Rectangular Transposition of an m by n matrix A that is efficient. In worst case it is O(N log N) where N = mn. It uses a bit-vector of size IWORK words to further increase its efficiency. When IWORK-0 no extra storage is used. We also review some of the other existing algorithms for this problem. These contributions were made by Gower, Windley, Knuth, Macleod, Laffin and Brebner (ACM Alg. 380), Brenner (ACM Alg. 467), and Cate and Twigg (ACM Alg. 513). Performance results are given and they are compared to an Out-of-Place Transposition algorithm as well as ACM Algorithm 467. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Gustavson, F. G., & Swirszcz, T. (2007). In-place transposition of rectangular matrices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4699 LNCS, pp. 560–569). Springer Verlag. https://doi.org/10.1007/978-3-540-75755-9_68
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
