In-Place Transposition of Rectangular Matrices


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… (More)
DOI: 10.1007/978-3-540-75755-9_68


  • Presentations referencing similar topics