References

1. C. L. Lawson, R. J. Hanson, D. R. Kincaid, and F. T. Krogh, “Basic Linear Algebra Subprograms for Fortran Usage,” ACM Trans. Math. Software 5, No. 3, 308–323 (September 1979).
2. J. J. Dongarra, J. Du Croz, S. Hammarling, and R. J. Hanson, “An Extended Set of FORTRAN Basic Linear Algebra Subprograms,” ACM Trans. Math. Software 14, No. 1, 1–17 (March 1988).
3. Jack J. Dongarra, Jeremy Du Croz, Sven Hammarling, and Iain Duff, “A Set of Level 3 Basic Linear Algebra Subprograms,” ACM Trans. Math. Software 16, No. 1, 1–17 (March 1990).
4. J. J. Dongarra, C. B. Moler, J. R. Bunch, and G. W. Stewart, LINPACK Users' Guide Release 2.0, Society for Industrial and Applied Mathematics, Philadelphia, 1979.
5. E. Anderson, Z. Bai, C. Bischof, J. Demmel, J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarling, A. McKenney, S. Ostrouchov, and D. Sorensen, LAPACK Users' Guide Release 3.0, Society for Industrial and Applied Mathematics, Philadelphia, 1999; see http://www.netlib.org/lapack/lug/lapack_lug.html.
6. R. C. Agarwal, F. G. Gustavson, and M. Zubair, “Exploiting Functional Parallelism of POWER2 to Design High-Performance Numerical Algorithms,” IBM J. Res. & Dev. 38, No. 5, 563–576 (September 1994).
7. J. Bilmes, K. Asanovic, C.-W. Chin, and J. Demmel, “Optimizing Matrix Multiply Using PHiPAC: A Portable High-Performance ANSI C Coding Methodology,” Proceedings of the International Conference on Supercomputing, Vienna, 1997, pp. 340–347.
8. R. C. Whaley, Antoine Petitet, and Jack J. Dongarra, “Automated Empirical Optimization Software and the ATLAS Project,” Parallel Computing 27, No. 1–2, 3–35 (January 2001).
9. J. A. Gunnels, G. M. Henry, and R. A. van de Geijn, “A Family of High-Performance Matrix Multiplication Algorithms,” Computational Science—ICCS 2001, Part I, V. N. Alexandrov, J. J. Dongarra, B. A. Juliano, R. S. Renna, and C. K. Tan, Eds., Lecture Notes in Computer Science, No. 2073, 2001, pp. 51–60.
10. F. G. Gustavson, “Recursion Leads to Automatic Variable Blocking for Dense Linear-Algebra Algorithms,” IBM J. Res. & Dev. 41, No. 6, 737–755 (November 1997).
11. F. G. Gustavson, A. Henriksson, I. Jonsson, B. Kagstrom, and P. Ling, “Recursive Blocked Data Formats and BLAS Dense Linear Algebra Algorithms,” Applied Parallel Computing, Large Scale Scientific and Industrial Problems, B. Kagstrom et al., Eds., Lecture Notes in Computer Science, No. 1541, 1998, pp. 195–206.
12. IBM Corporation, Engineering and Scientific Subroutine Library for AIX Version 3, Release 3; Order No. SA22-7272-04, December 2001.
13. G. Golub and C. VanLoan, Matrix Computations, Johns Hopkins Press, Baltimore, 1996.
14. J. J. Dongarra, F. G. Gustavson, and A. Karp, “Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine,” SIAM Rev. 26, No. 1, 91–112 (January 1984).
15. E. Elmroth and F. G. Gustavson, “Applying Recursion to Serial and Parallel QR Factorization Leads to Better Performance,” IBM J. Res. & Dev. 44, No. 4, 605–624 (July 2000).
16. G. Birkhoff and S. MacLane, A Survey of Modern Algebra, Revised Edition, Macmillan Publishing Co., New York, 1953.
17. L. Mirsky, An Introduction to Linear Algebra, Revised Edition, Dover Publications, Mineola, L.I., New York, 1972.
18. E. W. Elmroth and F. G. Gustavson, “A Faster and Simpler Recursive Algorithm for LAPACK Routine DGELS,” BIT 41, No. 5, 936–949 (2001).
19. R. K. Brayton, F. G. Gustavson, and R. A. Willoughby, “Some Results on Sparse Matrices,” Math. Comp. 24, No. 112, 937–954 (October 1970).
20. R. K. Montoye, E. Hokenek, and S. L. Runyon, “Design of the IBM RISC System/6000 Floating-Point Execution Unit,” IBM J. Res. & Dev. 34, No. 1, 59–70 (January 1990).
21. C. D. Meyer, Matrix Analysis and Applied Linear Algebra, Society for Industrial and Applied Mathematics, Philadelphia, 2001.
22. S. Toledo, “A Survey of Out-of-Core Algorithms in Numerical Linear Algebra,” External Memory Algorithms, J. M. Abello and J. S. Vitter, Eds., DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, 1999, pp. 161–179.
23. BLAS Technical Forum, 1995; see http://www.netlib.org/blas/blast-forum/.
24. F. G. Gustavson, “New Generalized Matrix Data Structures Lead to a Variety of High-Performance Algorithms,” The Architecture of Scientific Software, R. P. Boisvert and P. T. P. Tang, Eds., Kluwer Academic Publishers, Boston, 2001, pp. 211–232.
25. F. G. Gustavson and I. Jonsson, “Minimal Storage High Performance Cholesky via Blocking and Recursion,” IBM J. Res. & Dev. 44, No. 6, 823–850 (November 2000).
26. N. J. Highham, Accuracy and Stability of Numerical Computations, Society for Industrial and Applied Mathematics, Philadelphia, 1996.
27. F. Gustavson, A. Karaivanov, M. Marinova, J. Wasniewski, and P. Yalamov, “A Fast Minimal Storage Symmetric Indefinite Solver,” Applied Parallel Computing New Paradigms for HPC in Industry and Academia, Fifth International Workshop PARA 2000 Proceedings, Lecture Notes in Computer Science, No. 1947, 2001, pp. 103–112.
28. A. Gupta, F. Gustavson, A. Karaivanov, J. Wasniewski, and P. Yalamov, “Experience with a Recursive Perturbation Based Algorithm for Symmetric Indefinite Linear Systems,” Euro Par '99, Parallel Processing; Fifth International Euro Par Conference Proceedings, Lecture Notes in Computer Science, No. 1685, 1999, pp. 1096–1103.
29. B. S. Andersen, F. Gustavson, and J. Wasniewski, “A Recursive Formulation of Cholesky Factorization of a Matrix in Packed Storage,” ACM Trans. Math. Software 27, No. 2, 214–244 (2001).
30. B. S. Andersen, J. A. Gunnels, F. Gustavson, and J. Wasniewski, “A Recursive Formulation of the Inversion of Symmetric Positive Definite Matrices in Packed Storage Data Format,” Applied Parallel Computing New Paradigms for HPC in Industry and Academia, Seventh International Workshop PARA 2002 Proceedings, Lecture Notes in Computer Science, No. 2367, 2002, pp. 287–296.