1

Reinsch, C.H. A stable, rational QR algorithm for the computation of the eigenvalues of an Hermitian, tridiagonal matrix. Math. Comp. 25 (1971), 591-597.

2

Martin, R.S., Reinseh, C.H., Wilkinson, J. H. Householder's tridiagonalization of a symmetric matrix. Numer. Math. 11 (1968), 181-195.

1

Fields, J.L. A note on the asymptotic expansion of a ratio of Gamma functions. Proc. Edinburgh Math. Soc. Ser. 2 15 (1966), 43-45.

1

Johnson, S.N. Generation of permutations by adjacent transformations. Math. Comp. 17 (1963), 282-285.

2

H. F. Trotter, Algorithm 115: Perm, Communications of the ACM, v.5 n.8, p.434-435, Aug. 1962  [doi>10.1145/368637.368660]

3

Gideon Ehrlich, Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations, Journal of the ACM (JACM), v.20 n.3, p.500-513, July 1973  [doi>10.1145/321765.321781]

1

Windley, P.F. Transposing matrices in a digital computer. Comp. J. 2 (Apr. 1959), 47-48.

2

J. Boothroyd, Algorithm 302: Transpose vector stored array, Communications of the ACM, v.10 n.5, p.292-293, May 1967  [doi>10.1145/363282.363304]

3

Susan Laflin , M. A. Brebner, Algorithm 380: in-situ transposition of a rectangular matrix [F1], Communications of the ACM, v.13 n.5, p.324-326, May 1970  [doi>10.1145/362349.362368]

4

Bolker, E. An bttroduction to Number Theory: An Algebraic Approach. Benjamin, New York, 1970.

5

Abramowitz, M., and Stegun, I. Handbook of Mathematical Functions, Table 24.8. Nat. Bur. of Standards, Washington, D.C., 1964.

6

Pall, G., and Seiden, E. A problem in Abelian Groups, with application to the transposition of a matrix on an electronic computer. Math. Comp. 14 (1960), 189-192.

7

Donald E. Knuth, The art of computer programming, volume 1 (3rd ed.): fundamental algorithms, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1997

1

Patterson, T.N.L. The optimum addition of points to quadrature formulae. Math. Comp. 22 (1968), 847-856.

2

Cranley, R., and Patterson, T.N.L. On the automatic numerical evaluation of definite integrals. Comp. J., 14 (1971), 189-198.

3

J. N. Lyness, Algorithm 379: Squank (Simpson Quadrature used adaptivity—noise killed) [D1], Communications of the ACM, v.13 n.4, p.260-262, April 1970  [doi>10.1145/362258.362289]

4

George C. Wallick, Algorithm 400: Modified Havie integration, Communications of the ACM, v.13 n.10, p.622-624, Oct. 1970  [doi>10.1145/355598.362781]

5

de Boor, Carl. CADRE: An algorithm for numerical quadrature. Mathematical Software. J.R. Rice (Ed.) Academic Press, New York, 1971, pp. 417-449.

6

Henry C. Thacher, Jr., Remark on algorithm 60: Romberg integration, Communications of the ACM, v.7 n.7, p.420-421, July 1964  [doi>10.1145/364520.364542]

1

Alanen, A.J., and Knuth, D.E. Tables of finite fields. Sankhy6- (A) 26 (1964), 305-328.

2

Cannon, J.J. Ph.D. Th., 1967 U. of Sydney, Sydney, Australia.

3

Conway, J.H., and Guy, M.J.T. Information on finite fields. In Computers in Mathematical Research. North-Holland Pub. Co., Amsterdam, 1967.

Qingda Lu , Sriram Krishnamoorthy , P. Sadayappan, Combining analytical and empirical approaches in tuning matrix transposition, Proceedings of the 15th international conference on Parallel architectures and compilation techniques, September 16-20, 2006, Seattle, Washington, USA