Ames Laboratory, Department of Energy, ISU, Ames, Iowa

References

[1]

Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.

[2]

Srinivas Aluru and John Gustafson. A massively parallel optimizer for expression evaluation, Intl. Conf. on Supercomputing (1993) 97-106.

[3]

Srinivas Aluru and John Gustafson. Subtle issues of SIMD tree search, Parallel Computing (1993).

[4]

D. Bailey et.al., The NAS Parallel Benchmarks, Report RNR-91-002, NASA Ames Research Center, Jan 1991.

[5]

O. Buneman, Inversion of the Helmholtz (or Laplace-Poisson) Operator for Slab Geometry, J. Computational Phys. Vol. 12 (1973) 124-130.

[6]

W.J. Cody, W. Waite. Software Manual for the Elementary Functions. Englewood Cliffs, N.J. : Prentice-Hall, c1980.

[7]

Nicholas J. Higham. Exploiting fast matrix multiplication within the level 3 BLAS, ACM Trans. Math. Soft., 16(4) (1990) 352-368.

[8]

Nicholas J. Higham. Stability of a method for multiplying complex matrices with three real matrix multiplications, SIAM J. Matrix Anal. Appl., 13(3) (1992) 681-687.

[9]

J.E. Hopcroft, L.R. Kerr, On minimizing the number of multiplications necessary for matrix multiplication, SIAM J. Applied Math. 20:1 (1971) 30-36.

[10]

D.E. Knuth, The Art of Computer Programming, Vol. 2: seminumerical Algorithms, 2nd ed. Addison-Wesley, Reading, MA, 1981.

[11]

Lydia Kronsjö, Algorithms: Their Complexity and Efficiency, 2nd ed. John Wiley & Sons, 1987.

[12]

David W. Krumme and David H. Ackley, A practical method for code generation based on exhaustive search, Proc. ACM SIGPLAN'82 Symposium on Compiler Construction (1982) 185-196.

[13]

J.D. Laderman, A non-commutative algorithm for multiplying 3 3 matrices using 23 multiplications, Bull. Am. Math. Soc., 82 (1976) 126-128.

[14]

Henry Massalin, Superoptimizer - A look at the smallest program, ASPLOS II (1987) 122-126.

[15]

Webb Miller. Computational complexity and numerical stability, SIAM J. Comput., 4(2) (1975) 97-107.

[16]

V. Pan, Strassen algorithm is not optimal. Trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix multiplication, Proc. 19th Annual Symposium on the Foundations of Computer Science, Ann Arbor, MI, (1978) 166-176.

[17]

V. Pan, How can we speed up matrix multiplication?, SIAM Rev., 26,3 (1984) 393-415.

[18]

W.H. Press, B.P. Flannery, S.A. Teukolsky, W.T. Vetterling, Numerical Recipes in C The Art of Scientific Computing, Cambridge University Press, 1990.

[19]

V.N. Rao, V. Kumar. Superlinear speedup in ordered depth-first search, Proceedings of 6th Distributed Memory Computing Conference(DMCC6) (1991).

[20]

V. Strassen, Gaussian elimination is not optimal, Numer. Math., 13 (1969) 354-356.

[21]

S. Winograd, On multiplication of 2 2 matrices, Linear Alg. Appl., 4 (1971) 381-388.

[22]

Gideon Yuval. A simple proof of Strassen's result, Info. Proc. Let., 7(6) (1978) 285-286.