caa a22 4500 46582093X CHVBK 20180323112135.0 cr unu---uuuuu 170327e19900301xx s 000 0 eng 10.1007/BF01932126 doi (NATIONALLICENCE)springer-10.1007/BF01932126 Andersen Nils Department of Computer Science, University of Copenhagen, Universitetsparken I, DK-2100, København Ø, Denmark aut A general transposition method for a matrix on auxiliary store [Elektronische Daten] [Nils Andersen] An algorithm is developed and described for transposing a matrix larger than available working storage. If an (n×m)-matrix is stored in row-major order, and blocks ofn elements may be transferred to and from working storage at a time, the algorithm needsw=(5[m/n]+8)·n elements to be present in working storage at a time and requires [log2(2mn/w)] passages over the matrix. The algorithm is as efficient as earlier methods but needs no extra backing storage space. An algebra for mixed radix notation and a generalization of mixed radix notation is introduced for the description and verification of transposition algorithms, and earlier algorithms are briefly certified or disproved. BIT Foundations, 1990 E.2 nationallicence F.2.1 nationallicence G.4 nationallicence I.1.2 nationallicence Matrix transposition nationallicence mixed radix notation nationallicence BIT Numerical Mathematics Kluwer Academic Publishers 30/1(1990-03-01), 2-16 0006-3835 30:1<2 1990 30 10543 https://doi.org/10.1007/BF01932126 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF01932126 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Andersen Nils Department of Computer Science, University of Copenhagen, Universitetsparken I, DK-2100, København Ø, Denmark aut NATIONALLICENCE 773 0- BIT Numerical Mathematics Kluwer Academic Publishers 30/1(1990-03-01), 2-16 0006-3835 30:1<2 1990 30 10543 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer