Optimal in-place transposition of rectangular matrices

@article{Tretyakov2009OptimalIT,
  title={Optimal in-place transposition of rectangular matrices},
  author={A. A. Tretyakov and Eugene E. Tyrtyshnikov},
  journal={J. Complexity},
  year={2009},
  volume={25},
  pages={377-384}
}
Given a rectangular m × n matrix stored as a two-dimensional array, we want to transpose it in place andmeasure the cost by the number of memory writes and the number of auxiliary cells used. We propose a transposition algorithm with optimal complexity O(mn) using only min(m, n) auxiliary memory cells. © 2009 Elsevier Inc. All rights reserved. 

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Tyrtyshnikov, Computational Processes with Toeplitz Matrices

E.E.V.V. Voevodin
Nauka, Moscow, • 1987
View 1 Excerpt

On transposition of a rectangular matrix

A. V. Sobyanin
Vestnik Moskov. Univ. Ser. XV, Vychil. Mat. Kibernet. (4) • 1980
View 3 Excerpts

Sobyanin , On transposition of a rectangular matrix , Vestnik Moskov

V. A.
Univ . Ser . XV , Vychil . Mat . Kibernet . • 1980

Similar Papers

Loading similar papers…