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 logN) 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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berman, M.F.: A Method for Transposing a Matrix. J. Assoc. Comp. Mach. 5, 383–384 (1958)
Windley, P.F.: Tranpsoing matrices in a digital computer. Comput. J. 2, 47–48 (1959)
Boothroyd, J.: Alg. 302: Transpose vector stored array. Comm. ACM 10(5), 292–293 (1967)
Knuth, D.: In: The Art of Computer Programming (2nd printing), 1st edn., vol. 1, Addison-Wesley, Reading (1969) Problem 12, p. 180 and Solution to Problem 12. p. 517
Macleod, I.D.G.: An Algorithm For In-Situ Permutation. The Austrialian Computer Journal 2(1), 16–19 (1970)
Laflin, S., Brebner, M.A.: Alg. 380: In-situ transposition of a rectangular matrix. Comm. ACM 13, 324–326 (1970)
Knuth, D.: Matematical Analysis of Algorithms, Information Processing 71, Invited Papers-Foundations. North-Holland Publishing Company (1972)
Brenner, N.: Matrix Transposition in Place. Comm. ACM 16(11), 692–694 (1973)
Cate, E.G., Twigg, D.W.: Algorithm 513: Analysis of In-Situ Transposition. ACM TOMS 3(1), 104–110 (1977)
Leathers, B.L.: Remark on Algorithm 513: Analysis of In-Situ Transposition. ACM TOMS 5(4), 520 (1979)
Agarwal, R.C., Gustavson, F.G., Zubair, M.: Exploiting functional parallelism of POWER2 to design high-performance numerical algorithms. IBM Journal of Research and Development 38(5), 563–576 (1994)
Fich, F.E., Munro, J.I., Poblete, P.V.: Permuting In Place. SIAM Journal of Computing 24(2), 266–278 (1995)
Knuth, D.: In: The Art of Computer Programming (4th printing), 3rd edn., vol. 1. Addison-Wesley, Reading Mass (1997) Problem 12, p. 182 and Solution to Problem 12. p. 523
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gustavson, F.G., Swirszcz, T. (2007). In-Place Transposition of Rectangular Matrices. In: Kågström, B., Elmroth, E., Dongarra, J., Waśniewski, J. (eds) Applied Parallel Computing. State of the Art in Scientific Computing. PARA 2006. Lecture Notes in Computer Science, vol 4699. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75755-9_68
Download citation
DOI: https://doi.org/10.1007/978-3-540-75755-9_68
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75754-2
Online ISBN: 978-3-540-75755-9
eBook Packages: Computer ScienceComputer Science (R0)