Opening book details…
Can I read Algorithm 513: Analysis of In-Situ Transposition [F1] on EtoBox?
Algorithm 513: Analysis of In-Situ Transposition [F1] by Esko G. Cate; David W. Twigg is a Computer Science article available to read on EtoBox.
What is Algorithm 513: Analysis of In-Situ Transposition [F1] about?
Algorithms for in-place matrix transposition make use of the cyclic structure of the transposition mapping. A clear introduction to the process was given in 1958 by Windley [6]. In 1968 Boothroyd presented ACM Algorithm 302 [1]. Then in 1970 Laflin and Brefner presented ACM Algorithm 380 which they showed to be significantly faster than Algorithm 302 [4]. In this paper a number of theoretical results describing the transposition process are derived. Algorithms 302 and 380 are described and applications of some of the theoretical results to accelerate both algorithms are described. Finally, experimental comparison of the performance of Algorithm 380 and the improved version is p~esentcd. ## Theoretical Development Fortran conventions are assumed. The m ×n matrix A is stored by column in a vector ~ of adjacent storage locations. It is convenient to number components of from 0 to mn-1. Using this convention, matrix element A(I, J) is stored in yk, where k = m(J -1) W I -1. The transposition process moves the contents of y~ to y~ where p = n(I --1) ~-J --1. Thus the transposition process can be regarded as a permutation mapping acting on the indices of ~. The symbol ~r is used to denot
Who reads Algorithm 513: Analysis of In-Situ Transposition [F1]?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Esko G. Cate; David W. Twigg
- Publisher
- ACM
- Published
- 1977
- Language
- EN
- Field
- Computer Science (Physical Sciences)