Optimal in-place transposition of rectangular matrices (Q2272153)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal in-place transposition of rectangular matrices |
scientific article; zbMATH DE number 5590651
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal in-place transposition of rectangular matrices |
scientific article; zbMATH DE number 5590651 |
Statements
Optimal in-place transposition of rectangular matrices (English)
0 references
6 August 2009
0 references
A method is given for transposing (in place) a rectangular \(m\) by \(n\) matrix stored as a two dimensional array. The focus is on minimizing the number of operations and the number of additional memory cells other than used in storing the given matrix. The proposed method uses \(O(mn)\) writes and \(\min(m,n)\) auxiliary memory cells. The algorithm for square matrices (\(m=n\)) is discussed.
0 references
transposition
0 references
data rearrangement
0 references
rectangular matrices
0 references
in-place algorithms
0 references
0.8651748299598694
0 references
0.8301706314086914
0 references
0.7415550351142883
0 references
0.7288655638694763
0 references
