Numerical Linear Algebra

[AHU74] A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
[And95] E. Anderson et al., LAPACK Users' Guide, 2nd ed., SIAM, Philadelphia, 1995.
[Arn51] W. E. Arnoldi, The principle of minimized iteration in the solution of the matrix eigenvalue problem, Quart. Appl. Math. 9 ( 1951), 17 29.
[Axe94] O. Axelsson, Iterative Solution Methods, Cambridge U. Press, Cambridge, UK, 1994.
[Axl95] S. Axler, Down with determinants, Amer. Math. Monthly 102 ( 1995), 139 154.
[Bar94] R. Barrett et al., Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods, SIAM, Philadelphia, 1994.
[Bau94] D. Bau, Faster SVD for matrices with small m/n, TR94-1414, Computer Science Dept., Cornell U., 1994.
[Bj 96] . Bj rck, Numerical Methods for Least Squares Problems, SIAM, Philadelphia, 1996.
[BjPa92] . Bj rck and C. C. Paige, Loss and recapture of orthogonality in the modified Gram-Schmidt algorithm, SIAM J. Matrix Anal. Appl. 13 ( 1992), 176 190.
[B t95] A. B ttcher, Infinite matrices and projection methods, in P. Lancaster, ed., Lectures on Operator Theory and Its Applications, Amer. Math. Soc., Providence, RI, 1995.
[BrMe94] R. A. Brualdi and S. Mellendorf, Regions in the complex plane containing the eigenvalues of a matrix, Amer. Math. Monthly 101