Lanczos algorithms for large symmetric eigenvalue computations. Vol. I: Theory

Classics in Applied Mathematics

Volumn 41, Issue , 2002, Pages 1-268

  Cullum, Jane K ^a   Willoughby, Ralph A ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; FUNCTIONS; ITERATIVE METHODS; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING; VECTORS;

HERMITIAN VECTOR; SCALARS;

MATRIX ALGEBRA;

EID: 0036963916     PISSN: None     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (332)

1. Abo-Hamd, M., and Utku, S. (1978). Analytical study of suspension bridge flutter. Proc. ASCE, J. Engrg. Mech. Div. 104, 537-550.
2. Abramatic, J. F., and Lee, S. U. (1980). Singular value decomposition of 2-D impulse responses. Internat. Conf. Acoust. Speech Signal, 749-752.
3. Allen, H. C. Jr., and Cross, P. C. (1963). Molecular Vib-Rotors. The Theory on Intrepretation of High Resolution Infrared Spectra. Wiley, New York.
4. Anderson, N., and Karasalo, I. (1975). On computing bounds for the least singular value of a triangular matrix. BIT 15, 1-4.
5. Anderson, P. J., Liozou, G. (1973). On the quadratic convergence of an algorithm which diagonalizes a complex symmetric matrix. J. Inst. Math. Appl. 12, 261-271.
6. Anderson, P. J., Liozou, G. (1975). A Jacobi type method for complex symmetric martices. Numer. Math. 25, 347-363.
7. Anderson, P. W. (1958). Absence of diffusion in certain random lattices. Phys. Rev. 109, 1492-1505.
8. Anderssen, R. S., and Bloomfield, P. (1974). A time series approach to numerical differentiation. Technometrics 16, 69-75.
9. Anderssen, R. S., and Bloomfield, P. (1974b). Numerical differentiation procedures for non-exact data. Numer. Math. 22, 157-182.
10. Andrews, H. C., and Patterson, C. L. (1976). Singular value decomposition and digital image processing. IEEE Trans. ASSP-24, 26-53.
11. Andrews, H. C., and Hunt, B. R. (1977). Digital Image Restoration. Prentice-Hall, Englewood Cliffs, New Jersey.
12. Argyris, J. H., and Bronlund, O. E. (1975). The natural factor formulation of the stiffness for the matrix displacement method. Comput. Methods Appl. Mech. Engr. 5, 97-119.
13. Avramovic, B., Kokotovic, P. V., Winkelman, J. R., and Chow, J. H. (1980). Area decomposition for electromechanical models of power systems. Automatica - J. IFAC 16, 637-648.
14. Avramovic, B., Kokotovic, P. V. Winkelman, J. R., and Chow, J. H. (1980b). Coherency based decomposition and aggregation. IFAC Congress Kyoto, Japan.
15. Backus, G., and Gilbert, F. (1970). Uniqueness in the inversion of inaccurate gross earth data. Philos. Trans. Roy. Soc. London Ser. A 266, 123-192.
16. Banfield, C. F. (1978). Singular value decomposition in multivariate analysis. In [Jacobs (1978)] 137-149.
17. Barakat, R. and Buder, T. E. (1979). Remote sensing of crosswind profiles using the correlation slope method. J. Opt. Soc. Amer. 69, 1604-1608.
18. Barnes, E. (1982). An algorithm for partitioning the nodes of a graph. SIAM J. Algebraic Discrete Methods 3, 541-550.
19. Barth, W., Martin, R. S., and Wilkinson, J. H. (1967). Calculation of the eigenvalues of a symmetric tridiagonal matrix by the method of bisection. Numer. Math. 9, 386-393.
20. Bathe, K.-J., and Wilson, E. L. (1976). Numerical Methods in Finite Element Analysis. Prentice Hall, Englewood Cliffs, New Jersey.
21. Bathe, K.-J. (1977). Convergence of subspace iteration. In Formulations and Computational Algorithms in Finite Element Analysis. Bathe, K.-J., Oden, J. T., and Wunderlich, W. (Eds.). MIT Press, Cambridge, Massachusetts, 575-598.
22. Bathe, K.-J. and Ramaswamay, S. (1980). An accelerated subspace iteration method. Comput. Methods Appl. Mech. Engrg. 23, 313-331.
23. Bauer, F. L. and Fike, C. T. (1960). Norms and exclusion theorems. Numer. Math. 2, 137-141.
24. Björck, Å, and Golub, G. H. (1973). Numerical methods for computing angles between subspaces. Math. Comp. 27, 579-594.
25. Björck, Å (1976). Methods for sparse linear least squares problems. In [Bunch 1976], 177-199.
26. Björck, Å, and Duff, I. S. (1980). A direct method for the solution of sparse linear least squares problems. Linear Algebra Appl. 34, 43-67.
27. Bjo̊rck, Å, Plemmons, R. J., and Schneider, H. (Eds.) (1980). Large Scale Matrix Problems. North Holland Publ. Co., New York.
28. Bowdler, H., Martin, R. S., Reinsch, C., and Wilkinson, J. H. (1968). The QR and QL algorithms for symmetric matrices. Numer. Math. 11, 293-306.
29. Bunch, J. R., and Rose, D. E. (Eds.) (1976). Sparse Matrix Computations. Academic Press, New York.
30. Bunch, J. R., and Kaufman, L. (1977). Some stable methods for calculating inertia and solving symmetric linear systems. Math. Comp. 31, 163-179.
31. Butscher, W., and Kammer, W. E. (1976). Modification of Davidson's method for the calculation of eigenvalues and eigenvectors of large real symmetric matrices: "Root-homing procedure". J. Comput. Phys. 20, 313-325.
32. Cederbaum, H. S., Haller, E., and Domcke, W. (1980). Effective single-mode Hamiltonian for the calculation of multi-mode Jahn-Teller band shapes. Solid State Comm. 35, 879-881.
33. Chan, S. P., Fledman, H., and Parlett, B. N. (1977). A program for computing the condition numbers of matrix eigenvalues without computing eigenvectors. ACM TOMS 3, 186-203.
34. Chan, T. F. (1982). An improved algorithm for computing the singular value decomposition. ACM TOMS 8, 72-83.
35. Chow, J. H., Cullum, J. and Willoughby, R. A. (1984). A sparsity-based technique for identifying slow-coherent areas in large power systems. IEEE Trans. PAS- 103, 463-473.
36. Chowdhury, P. C. (1976). Truncated Lanczos algorithm for the partial solution of the symmetric eigenproblem. Comput. & Structures 6, 439-446.
37. Cline, A. K., Golub, G. H., and Platzman, G. W. (1976). Calculation of normal modes of oceans using a Lanczos method. In [Bunch 1976], 409-426.
38. Cline, A. K., Moler, C. B., Stewart, G. W., and Wilkinson, J. H. (1979). An estimate for the condition number of a matrix. SIAM J. Numer. Anal. 16, 368-375.
39. Cline, A. K. (1982). Counter examples to matrix condition number estimators. SIAM Meeting, Stanford.
40. Clint, M., and Jennings, A. (1970). The evaluation of eigenvalues and eigenvectors of real symmetric matrices by simultaneous iterations. Comput. J. 13, 76-80.
41. Clint, M., and Jennings, A. (1971). A simultaneous iteration method for the unsymmetric eigenvalue problem. J. Inst. Math. Appl. 8, 111-121.
42. Corr, R. B., and Jennings, A. (1976). A simultaneous iteration algorithm for symmetric eigenvalue problems. Internat. J. Numer. Methods Engrg. 10, 647-663.
43. Craven, B. D. (1969). Complex symmetric matrices. J. Austral. Math. Soc. 10, 341-354.
44. Cullum, J., and Donath, W. E. (1974). A block Lanczos algorithm for computing the q algebraically largest eigenvalues and a corresponding eigenspace for large, sparse symmetric matrices. In Proc. 1974 IEEE Conference on Decision and Control, IEEE Press, New York, 505-509.
45. Cullum, J., and Donath, W. E. (1974b). A block generalization of the symmetric s-step Lanczos algorithm. IBM T. J. Watson Research Center, RC 4845. (May 1974).
46. Cullum, J., Donath, W. E., and Wolfe, P. (1975). The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices. Mathematical Programming Study 3, 35-55.
47. Cullum, J. (1978). The simultaneous computation of a few of the algebraically largest and smallest eigenvalues of a large, symmetric, sparse matrix. BIT 18, 265-275.
48. Cullum, J. (1979). The effective choice of the smoothing norm in regularization. Math. Comp. 33, 149-170.
49. Cullum, J., and Willoughby, R. A. (1979). Lanczos and the computation in specified intervals of the spectrum of large sparse real symmetric matrices. In [Duff 1979], 220-255.
50. Cullum, J., and Willoughby, R. A. (1979b). Fast modal analysis of large, sparse but unstructured symmetric matrices. In Proc. 18th IEEE Conf. Decision Contr., IEEE Press, New York, 45-53.
51. Cullum, J., (1980). Ill-posed deconvolutions: regularization and singular value decompositions. In 19th Proc. IEEE Conf. Decision Contr., IEEE Press, New York, 29-35.
52. Cullum, J., and Willoughby, R. A. (1980). The Lanczos phenomenon - an interpretation based upon conjugate gradient optimization. Linear Algebra Appl. 29, 63-90.
53. Cullum, J., and Willoughby, R. A. (1980b). Computing eigenvectors (and eigenvalues) of large, symmetric matrices using Lanczos tridiagonalization. In Lecture Notes in Mathematics 773, 46-63. Watson, G. A. (Ed.) Springer, New York.
54. Cullum, J., and Willoughby, R. A. (1980c). Computing eigenvalues of large symmetric matrices-an implementation of a Lanczos algorithm with no reorthogonalization. Part II. Computer programs. IBM T. J. Watson Research Center, RC 8298.
55. Cullum, J., and Willoughby, R. A. (1981). Computing eigenvalues of very large symmetric matrices-an implementation of a Lanczos algorithm with no reorthogonalization. J. Comput. Phys. 44, 329-358.
56. Cullum, J., Willoughby, R. A., and Lake, M. (1983). A Lanczos algorithm for computing singular values and vectors of large matrices. SIAM J. Sci. Statist. Comput. 4, 197-215.
57. Cullum, J., and Willoughby, R. A. (1984). Lanczos Algorithms for Large Symmetric Matrices: Volume 2, Users Guide. Birkhauser, Boston.
58. Daniel, J. W., Gragg, W. B., Kaufman, L., and Stewart, G. W. (1976). Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization. Math. Comp. 30, 772-795.
59. Davidson, E. R. (1975). The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real symmetric matrices. J. Comput. Phys. 17, 87-94.
60. Davidson, E. R. (1983). Matrix eigenvector methods. In Methods in Computational Molecular Physics. Diercksen, G. H. F. and Wilson, S. (Eds.), Reidel, Boston, 95-113.
61. Davis, C., and Kahan, W. (1970). The rotation of eigenvectors by a perturbation. III. SIAM J. Numer. Anal. 7, 1-46.
62. Dean, P. (1967). Atomic vibrations in solids. J. Inst. Math. Appl. 3, 98-165.
63. Dean, P. (1972). The vibrational properties of disordered systems: numerical studies. Rev. Modern Phys. 44, 127-168.
64. Dehesa, J. S. (1978). The Lanczos method and asymptotical level density of a physical system. Lett. Nuovo Cimento 23, 301-305.
65. Dehesa, J. S. (1981). Lanczos method of tridiagonalization. Jacobi matrices and physics. J. Comput. Appl. Math. 7, 249-259.
66. Deift, P., Nanda, T., and Tomei, C. (1983). Ordinary differential equations and the symmetric eigenvalue problem. SIAM J. Numer. Anal. 20, 1-22.
67. Donath, W. E. (1970). Stochastic model of the computer logic design process. IBM T. J. Watson Research Center, R 3136.
68. Donath, W. E., and Hoffman, A. J. (1973). Lower bounds for partitioning of graphs. IBM J. Res. Develop. 17, 420-425.
69. Donath, W. E. (1974). Equivalence of memory to "random logic". IBM J. Res. Develop. 18, 401-407.
70. Dongarra, J. J., Moler, C. B., and Wilkinson, J. H. (1983). Improving the accuracy of computed eigenvalues and eigenvectors. SIAM J. Numer. Anal. 20, 23-45.
71. Doyle, J. C., and Stein, G. (1981). Multivariable feedback design: Concepts for classical/modern synthesis. IEEE Trans. AC-26, 4-16.
72. Dubrulle, A. A. (1970). A short note on the implicit QL algorithm for symmetric tridiagonal matrices. Numer. Math. 15, 450.
73. Duff, I. S. (1977). A survey of sparse matrix research. IEEE Proc. 65, 500-535.
74. Duff, I. S., and Stewart, G. W. (1979). Sparse Matrix Proceedings 1978, SIAM Press, Philadelphia.
75. Duff, I. S. (Ed.) (1981). Sparse Matrices and Their Uses. IMA Numerical Analysis Group Conference, Academic Press, New York.
76. Duff, I. S. (1982). Research directions in sparse matrix computations. Harwell Report AERE-R10547.
77. Dyson, F. J. (1953). The dynamics of a disordered linear chain. Phys. Rev. 92, 1331-1338.
78. Eberlein, P. J. (1971). On the diagonalization of complex symmetric matrices. J. Inst. Math. Anal. 7, 377-383.
79. Eckart, C., and Young, G. (1936). The approximation of one matrix by another of lower rank. Psychometrika 1, 211-218.
80. Edwards, J. T., and Thouless, D. J. (1972). Numerical studies of localization in disordered systems. J. Phys. C 5, 807-820.
81. Edwards, J. T., Licciardello, D. C., and Thouless, D. J. (1979). Use of the Lanczos method for finding complete sets of eigenvalues of large sparse symmetric matrices. J. Inst. Math. Appl. 23, 277-283.
82. Eisenstat, S. C., Schultz, M. H., and Sherman, A. H. (1981). Algorithms and data structures for sparse symmetric Gaussian elimination. SIAM J. Sci. Statist. Comput. 2, 225-237.
83. EISPACK Guide (1976). Matrix Eigensystem Routines - EISPACK Guide. Smith, B. T., Boyle, J. M., Garbow, B. S., Ikebe, Y., Klema, V. C., and Moler, C. B. Lecture Notes in Computer Science 6, Second Edition, Springer, New York.
84. EISPACK Guide (1977) Matrix Eigensystem Routines - EISPACK Guide Extension. Garbow, B. S., Boyle, J. M., Dongarra, J. J., and Moler, C. B. Lecture Notes in Computer Science 51, Second Edition, Springer, New York.
85. Ekstrom, M. P., and Rhoads, R. L. (1974). On the application of eigenvector expansion for numerical deconvolution, J. Comput. Phys. 14, 319-340.
86. Englman, R. (1972) The Jahn-Teller Effect in Molecules and Crystals. Wiley-Interscience, New York.
87. Ericsson, T., and Ruhe, A. (1980). The spectral transformation Lanczos method for the numerical solution of large sparse generalized symmetric eigenvalue problems. Math. Comp. 35, 1251-1268.
88. Ericsson, T. (1982). Some properties of the eigenvectors of a symmetric tridiagonal matrix. Report UMINF-99.82, U. Umeä.
89. Ericsson, T. and Ruhe, A. (1982). STLM-a software package for the spectral transformation Lanczos algorithm. Report UMINF-101.82, U. Umeä.
90. Ericsson, T. (1983). Implementation and applications of the spectral transformation Lanczos algorithm. In Lecture Notes in Mathematics, vol. 973, Springer, New York, 177-188.
91. Ericsson, T. (1983b). Algorithms for large sparse symmetric generalized eigenvalue problems. Report UMINF-108.83. U. Umeä.
92. Erisman, A. M., Neves, K. W., and Dwarakanath, M. H. (Eds.) (1980). Electric Power Problems: The Mathematical Challenge. SIAM, Philadelphia.
93. Fan, K. (1949). On a theorem of Weyl concerning eigenvalues of linear transformations. Proc. Nat. Acad. Sci. USA 35, 652-655.
94. Feler, M. G. (1974). Calculation of eigenvectors of large matrices. J. Comput. Phys. 14, 341-349.
95. Fiedler, M. and Ptak, V. (1962). On matrices with non-positive off-diagonal elements and positive principal minors. Czech. Math. J. 12, 382-400.
96. Fisher, N. J., and Howard, L. E. (1980). Gravity interpretation with the aid of quadratic programming. Geophysics 45, 403-419.
97. Forsythe, G. F., (1968). On the asymptotic directions of the s-dimensional conjugate gradients method. Numer. Math. 11, 57-76.
98. Forsythe, G. E., Malcolm, M. A., and Moler, C. B. (1977). Computer Methods for Mathematical Computations. Prentice-Hall, Englewood Cliffs, New Jersey.
99. Francis, J. G. F. (1961/1962). The QR transformation - a unitary analogue to the LR transformation. Comput. J. 4, 1: 265-271, 2: 332-345.
100. Freudenberg, J. S., Looze, D. P., and Cruz. J. B. (1982). Robust analysis using singular value decomposition. Internat. J. Control 35, 95-116.
101. Frik, G., and Lunde Johnsen, T. (1975). Note on the ill-conditioned eigenvalue problem in elastic vibration. Comput. Methods. Appl. Mech. Engrg. 6, 65-77.
102. Gantmacher, F. R. (1959). The Theory of Matrices. I, II. Chelsea, New York.
103. Gehring, G. A., and Gehring, K. A. (1975). Co-operative Jahn-Teller Effects. Reports on Progress in Physics 38, 1-89.
104. Geogakis, C., Aris, R., and Amundson, N. R. (1977). Studies in the control of tubular reactors - 2. Stabilization by modal control. Chem. Eng. Sci. 32, 1371-1379.
105. George, A., and Liu, J. W. H. (1980). A fast implementation of the minimum degree algorithm using quotient graphs. ACM TOMS 6, 337-358.
106. George, A., and Liu, J. W. H. (1981). Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, Englewood Cliffs, NJ.
107. George, A., and Ng, E. (1983). On row and column orderings for sparse least square systems. SIAM J. Numer. Anal. 20, 326-344.
108. Gerlakh, N. I., Zueva, N. M., and Solovyey, L. S. (1978). Linear theory of a helical MHD instability. Magnetohydrodynamics 14, 431-435.
109. Gill, P. E., Murray, W., and Wright, M. H. (1981). Practical Optimization. Academic Press, New York.
110. Givens, W. (1954). Numerical computation of the characteristic values of a real symmetric matrix. Report ORNL-1574, Oak Ridge, Tennessee.
111. Godunov, S. K., and Prokopov, G. P. (1970). A method of minimal iterations for evaluating the eigenvalues of an elliptic operator. USSR Comp. Math. Math. Phys. 10, 141-154.
112. Golub, G. H., and Kahan, W. (1965). Calculating the singular values and pseudoinverse of a matrix. SIAM J. Numer. Anal. 2, 205-224.
113. Golub, G. H. (1968). Least squares, singular values and matrix approximations. Apl. Mat: 13, 44-51.
114. Golub, G. H., and Reinsch, C. (1970). Singular value decomposition and least squares solutions. Numer. Math. 14, 181-195.
115. Golub, G. H., Underwood, R., and Wilkinson, J. H. (1972). The Lanczos algorithm for the symmetric Ax = λBx problem. Report Stan-CS-72-270, Stanford.
116. Golub, G. H. (1973). Some modified eigenvalue problems. SIAM Rev. 15., 318-334.
117. Golub, G. H. (1973b). Some uses of the Lanczos algorithm in numerical linear algebra. In Topics in Numerical Analysis. Miller, J. J. H. (Ed.), Academic Press, New York, 173-184.
118. Golub, G. H. (1974). Methods for computing eigenvalues of sparse matrix equations. In Actas Del Seminario Sombre Methodos Numericos Modernos, Vol. 1, Pereyra V. (Ed.), Univ. Central de Venezuela, 125-148.
119. Golub, G. H., and Wilkinson, J. H. (1976). Ill-conditioned eigensystems and the computation of the Jordan canonical form. SIAM Rev. 18, 578-619.
120. Golub, G. H., and Underwood, R. (1977). The block Lanczos method for computing eigenvalues. In Mathematical Software III. Rice, J. R. (Ed.), Academic Press, New York, 361-377.
121. Golub, G. H., Luk, F. T., and Overton, M. L. (1981). A block Lanczos method for computing the singular values and corresponding singular vectors of a matrix. ACM TOMS 7, 149-169.
122. Gruber, R. (1975). HYMMIA - band matrix package for solving eigenvalue problems. Comput. Phys. Comm. 10, 30-41.
123. Gupta, K. K. (1973). On a combined Strum sequence inverse iteration technique for eigenproblem solution of spinning structures. Internat. J. Numer. Methods Engrg. 7, 509-518.
124. Gupta, K. K. (1974). Eigenproblem solution of damped structural systems. Internat. J. Numer. Methods Engrg. 8, 877-911.
125. Gupta, K. K. (1976). On a numerical solution of the supersonic panel flutter eigenproblem. Internat. J. Numer. Methods Engrg. 10, 637-645.
126. Gupta, K. K. (1978). On a numerical solution of the plastic buckling problem of structures. Internat. J. Numer. Methods Engrg. 12, 941-947.
127. Gupta, K. K. (1978b). Development of a finite dynamic element for free vibration analysis of two-dimensional structures. Internat. J. Numer. Methods Engrg. 12, 1311-1327.
128. Gupta, K. K. (1979). Finite dynamic element formulation for a plane triangular element. Internat. J. Numer. Methods Engrg. 14, 1431-1448.
129. Gustavson, F. G. (1972). Some basic techniques for solving sparse systems of linear equations. In Sparse Matrices and Their Applications. Rose, D. J. and Willoughby, R. A., (Eds.), Plenum, New York, 41-52.
130. Hamming, R. W. (1973). Numerical Methods for Scientists and Engineers. McGraw-Hill, New York.
131. Hamming, R. W. (1974). The frequency approach in numerical analysis. In Studies in Numerical Analysis, Academic Press, New York, 151-175.
132. Hanson, R. J., and Phillips, J. L. (1975). An adaptive numerical method for solving linear Fredholm equations of the first kind. Numer. Math. 24, 291-307.
133. Hanson, R. J., and Norris, M. J. (1981). Analysis of measurements based on the singular value decomposition. SIAM J. Sci. Statist. Comput. 2, 363-373.
134. HARWELL Subroutine Library (1981). Compiled by M.J. Hopper. Computer Science and Systems Division, Atomic Energy Research Establishment, Harwell, Oxfordshire, England.
135. Haydock, R. (1980). The recursive solution of the Schrodinger equation. Solid State Phys. 35, 215-294.
136. Haydock, R. and Thorpe, R. (Eds.) (1981). Excitations in Disordered Systems. Plenum, New York.
137. Henrici, P. (1962). Bounds for iterates, inverses, spectral variation and fields of values of non-normal matrices, Numer. Math. 4, 24-40.
138. Hestenes, M. R., and Karush, W. (1951). A method of gradients for the calculation of the characteristic roots and vectors of a real symmetric matrix. J. Res. Nat. Bur. Standards Sect. B. 47, 471-478.
139. Hestenes, M. R., and Stiefel, E. (1952). Method for conjugate gradients for solving linear systems. J. Res. Nat. Bur. Standards Sect. B. 49, 409-436.
140. Hestenes, M. R. (1956). The conjugate-gradient method for solving linear equations. In Proc. Sixth Symposium Appl. Math., 83-102.
141. Hestenes, M. R. (1980). Conjugate Direction Methods in Optimization. Springer-Verlag, New York.
142. Hodges, D. H. (1979). Aeromechanical stability analysis for bearingless rotor helicopters. J. Amer. Helicopter Soc. 24, 2-9.
143. Hoffman, A. J., and Wielandt, H. W. (1953) The variation of the spectrum of a normal matrix. Duke Math. J. 20, 37-40.
144. Hori, J. (1968). Spectral Properties of Disordered Chains and Lattices. Pergamon Press, New York.
145. Householder, A. S. (1958). Generated error in rotational tridiagonalization. J. Assoc. Comput. Mach. 5, 335-338.
146. Householder, A. S. (1964). The Theory of Matrices in Numerical Analysis. Blaisdell, New York.
147. Huang, T. C. and Parrish, W. (1978). Qualitative analysis of complicated mixtures by profile fitting x-ray diffractometer patterns. Adv. x-Ray Anal. 21, 275-288.
148. Huang, T. C., Parrish, W. and Ayers, G. L. (1980). A rapid and precise computer method for qualitative x-ray fluorescence analysis. IBM San Jose Research Center, RJ 2912.
149. Jacobs. D. (Ed.) (1977). The State of the Art in Numerical Analysis. Academic Press, New York.
150. Jacobs, D. (Ed.) (1978). Numerical Software - Needs and Availability. Academic Press, New York.
151. Jennings, A., and Orr, D. R. L. (1971). Application of the simultaneous iteration method to undamped vibration problems. Internat. J. Numer. Methods Engr. 3, 13-24.
152. Jennings, A., and Stewart, W. J. (1975). Simultaneous iteration for partial eigensolution of real matrices. J. Inst. Math. Appl. 15, 351-361.
153. Jennings, A. (1977). Matrix Computations for Engineers and Scientists, Wiley, New York.
154. Jennings, A., and Agar, T. J. S. (1979). Progressive simultaneous inverse iteration for symmetric eigenvalue problems. Comput. & Structures 14, 51-61.
155. Jennings, A. (1980). Eigenvalue methods for vibration analysis. Shock Vibr. Digest 12, 3-19.
156. Jennings, A. (1981). Eigenvalue methods and the analysis of structural vibrations. In [Duff 1981] 109-138.
157. Jennings, A. (1982). Bounds for the singular values of a matrix. IMA J. Numer. Anal. 2, 459-474.
158. Jensen, P. S. (1972). The solution of large eigenproblems by sectioning. SIAM J. Numer. Anal. 9, 534-545.
159. Jensen, P. S. (1973). An inclusion theorem related to inverse iteration. Linear Algebra Appl. 6, 209-215.
160. Kahan, W. (1966). When to neglect off-diagonal elements of symmetric tridiagonal matrices. Report CS-42, Stanford.
161. Kahan, W. (1967). Inclusion theorems for clusters of eigenvalues of Hermitian matrices. Report, U. Toronto.
162. Kahan, W. (1972). Private communication.
163. Kahan, W., and Parlett, B. N. (1974). An analysis of Lanczos algorithms for symmetric matrices. Report ERL-M467, UC Berkeley
164. Kahan, W., and Parlett, B. N. (1976). How far should one go in the Lanczos process. In [Bunch 1976], 131-144.
165. Kahan, W., Parlett, B. N., and Jiang, E. (1982). Residual bounds on approximate eigensystems of nonnormal matrices. SIAM J. Numer. Anal. 19, 470-484.
166. Kaniel, S. (1966). Estimates for some computational techniques in linear algebra. Math. Comp. 20, 369-378.
167. Karush, W. (1951). An iterative method for finding characteristic vectors of a symmetric matrix. Pacific J. Math. 1, 233-248.
168. Kirkpatrick, S., and Eggarter, T. P. (1972). Localized states of a binary alloy. Phys. Rev. B 6, 3589-3600.
169. Kirkpatrick, S. (1979). Models of disordered materials. In Eight lectures in the Proc. of the Ecole d'Ete de Physique. Balion, R., Maynard, R. and Toulouse, G. (Eds.) North Holland, Amsterdam, 324-403.
170. Kreuzer, K. G., Miller, and Berger, W. A. (1981). The Lanczos algorithm for self-adjoint operators. Phys. Lett. A 81, 429-432.
171. Kublanovskaya, V. N. (1961). On some algorithms for solving the complete problem of proper values. Soviet Math. Dokl. 2, 17-19.
172. Kupchinov, I. I., and Ivanova, M. M. (1973). The application of eigenvalues in goedesy. Geod. Mapp. Photogramm. 15, 40-43.
173. Lanczos, C. (1950). An iterative method for the solution of the eigenvalue problem of linear differential and integral operators. J. Res. Nat. Bur. Standards, Sect. B 45, 255-282.
174. Lanczos, C. (1952). Solution of systems of linear equations by minimized iterations. J. Res. Nat. Bur. Standards, Sect. B 49, 33-53.
175. Lanczos, C. (1961). Linear Differential Operators. Van Nostrand, New York.
176. Landauer, R. (1970). Electrical resistance of disordered one-dimensional lattices. Philos. Mag. 21, 863-867.
177. Lawson, C., and Hanson, R. (1974). Solving Least Squares Problems. Prentice-Hall, Englewood Cliffs, New Jersey.
178. Lewis, J. G. (1977). Algorithms for sparse matrix eigenvalue problems. PhD Thesis and Report CS-77-595, Stanford.
179. Lewis, J. G., and Grimes, R. G. (1981). Practical Lanczos algorithms for solving structural engineering problems. In [Duff 1981], 349-355.
180. Licciardello, D. C., and Thouless, D. J. (1975). Conductivity and mobility edges for two-dimensional disordered systems. J. Phys. C 8, 4157-4170.
181. Licciardello, D. C., and Thouless, D. J. (1978). Conductivity and mobility edges in disordered systems. II. Futher calculations for the square and diamond lattices. J. Phys. C 11, 925-936.
182. LINPACK User's Guide. (1979). Dongarra, J. J., Bunch, J. R., Moler, C. B., and Stewart, G. W. SIAM Press, Philadelphia.
183. Lonquet-Higgens, H. C., Öpik, U., Pryce, M. H. L., and Sack, R. A. (1958). Studies of the Jahn-Teller effect. II. The dynamical problem. Proc. Roy. Soc. 244A, 1-16.
184. Luenberger, D. G. (1973). Introduction to Linear and Nonlinear Programming. Addison-Wesley, Reading, Massachusetts.
185. Luk, F. T. (1980). Computing the singular-value decomposition on the ILLIAC IV ACM TOMS 5, 524-539.
186. Marcus, M. (1960). Basic theorems in matrix theory. Natl. Bur. Standards Appl. Math. Ser. 57.
187. Martin, R. S., and Wilkinson, J. H. (1968). Reduction of the symmetric eigenproblem Ax = λBx and related problems to standard form. Numer. Math. 11, 99-110.
188. Martin, R. S., and Wilkinson, J. H. (1968b). The implicit QL algorithm. Numer. Math. 12, 377-383.
189. McCormick, S. F. (1981). A mesh refinement method for Ax = λBx. Math. Comp. 36, 485-498.
190. Meirovitch, L. (1980). Computational Methods in Structural Dynamics. Sijthoff & Noordhoff, Rockville, MD
191. Moler, C. B., and Stewart, G. W. (1973). An algorithm for generalized matrix eigenvalue problems. SIAM J. Numer. Anal. 10, 241-256.
192. Moler, C. B., and Shavitt, I. (Eds.) (1978). Numerical Algorithms in Chemistry: Algebraic Methods. NRCC, Lawrence Berkeley Labs.
193. Moore, B. C. (1981). Principal component analysis in linear systems: Controllability, observability, and model reduction. IEEE Trans. AC-26, 17-32.
194. Moro, G., and Freed, J. H. (1981). Calculation of ESR spectra and related Fokker-Planck forms by the use of the Lanczos algorithm. J. Chem. Phys. 74, 3757-3773.
195. NASTRAN Users Manual (1977). NASA Langley Research Center, Hampton, Virginia.
196. Nesbet, R. K. (1981). Large matrix techniques in quantum chemistry and atomic physics. In [Duff 1981], 161-174.
197. Newman, M., and Pipano, A. (1977). Fast model extraction in NASTRAN via the FEER computer program, NASTRAN Users Manual, NASA Langley Research Center, Hampton, Virginia, 485-506.
198. Nikolai, P. J. (1979). Algorithm 538. Eigenvectors and eigenvalues of real generalized symmetric matrices by simultaneous iteration. ACM TOMS 5, 118-125.
199. Nour-Omid, B., Parlett, B. N., and Taylor, R. L. (1983). Lanczos versus subspace iteration for solution of eigenvalue problems. Internat. J. Numer. Methods Engrg. 19, 859-871.
200. Nour-Omid, B., Parlett, B. N., and Taylor, R. L. (1983b). A Newton-Lanczos method for solution of nonlinear finite element equations. Comput. & Structures 16, 241-252.
201. O'Brien, M. C. M., and Evangelou, S. N. (1980). The calculation of absorption band shapes in dynamic Jahn-Teller systems by the use of the Lanczos algorithm. J. Phys. C 13, 611-623.
202. Ojaive, I. U., and Newman, M. (1970). Vibration modes of large structures by an automatic matrix-reduction method. AIAA J. 8, 1234-1239.
203. O'Leary, D. P., Stewart, G. W., and Vandergraft, J. S. (1979). Estimating the largest eigenvalue of a positive definite matrix. Math. Comp. 33, 1289-1292.
204. O'Leary, D. P. (1980). The block conjugate gradient algorithm and related methods. Linear Algebra Appl. 29, 293-322.
205. O'Leary, D. P. (1980b). Estimating matrix condition numbers. SIAM J. Sci. Statist. Comput. 1, 205-209.
206. O'Leary, D. P., and Simmons, J. A. (1981). A bidiagonalization-regularization procedure for large scale discretization of ill-posed problems. SIAM J. Sci. Statist. Comput. 2, 474-489.
207. Ortega, J. M. (1960). On Sturm sequences for tridiagonal matrices. J. Assoc. Comput. Mach. 7, 260-263.
208. Ostrowski, A. M. 1937 On determinants with dominant diagonal. Comment. Math. Helv. 10, 69-96. (German).
209. Ostrowski, A. M. (1958-59). On the convergence of the Rayleigh quotient iteration for the computation of the characteristic roots and vectors. Arch. Rational Mech. Anal. 1, 233-241
210. Ostrowski, A. M. (1958-59). On the convergence of the Rayleigh quotient iteration for the computation of the characteristic roots and vectors. Arch. Rational Mech. Anal. 2, 423-428
211. Ostrowski, A. M. (1958-59). On the convergence of the Rayleigh quotient iteration for the computation of the characteristic roots and vectors. Arch. Rational Mech. Anal. 3, 325-340, 341-347, 472-481
212. Ostrowski, A. M. (1958-59). On the convergence of the Rayleigh quotient iteration for the computation of the characteristic roots and vectors. Arch. Rational Mech. Anal. 4, 153-165.
213. Paige, C. C. (1971). The computation of eigenvalues and eigenvectors of very large sparse matrices. Ph.D. Thesis, U. London.
214. Paige, C. C. (1972). Computational variants of the Lanczos method for the eigenproblem. J. Inst. Math. Appl. 10, 373-381.
215. Paige, C. C. (1974). Bidiagonalization of matrices and solution of linear equations. SIAM J. Numer. Anal. 11, 197-209.
216. Paige, C. C. (1974b). Eigenvalues of perturbed Hermitian matrices. Linear Algebra Appl. 8, 1-10.
217. Paige, C. C. and Saunders, M. A. (1975). Solution of sparse indefinite systems of linear equations. SIAM J. Numer. Anal. 12, 617-629.
218. Paige, C. C. (1976). Error analysis of the Lanczos algorithms for tridiagonalizing a symmetric matrix. J. Inst. Math. Appl. 18, 341-349.
219. Paige, C. C. (1980). Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem. Linear Algebra Appl. 34, 235-258.
220. Paige, C. C. and Saunders, M. A. (1982). LSQR: an algorithm for sparse linear equations and sparse least squares. ACM TOMS 8, 43-71.
221. Pandey, K. C. (1983). Theory of semiconductor surface reconstruction: Si(111)-7×7, Si(111)-2×1, and GaAs(110). Physica 117B&118B, 761-766.
222. Parlett, B. N. (1968). Global convergence of the basic QR algorithm on Hessenberg matrices. Math. Comp. 22, 803-817.
223. Parlett, B. N., and Reinsch, C. (1969). Balancing a matrix for calculation of eigenvalues and eigenvectors. Numer. Math. 13, 293-304.
224. Parlett, B. N., and Poole W. G. (1973). A geometric theory for the QR, LU, and power iterations. SIAM J. Numer. Anal. 10, 389-412.
225. Parlett, B. N., and Scott, D. S. (1977). The Lanczos algorithm with implicit deflation. Report ERL-M77/70, UC Berkeley.
226. Parlett, B. N., and Scott, D. S. (1979). The Lanczos algorithm with selective reorthogonalization. Math. Comp. 33, 217-238.
227. Parlett, B. N. (1980). The Symmetric Eigenvalue Problem. Prentice-Hall, Englewood Cliffs, NJ.
228. Parlett, B. N. (1980b). How to solve (K-λM)z = 0 for large K and M. Numer. Methods Engrg. 1, 97-106.
229. Parlett, B. N., and Reid, J. K. (1981). Tracking the progress of the Lanczos algorithm for large symmetric matrices. IMA J. Numer. Anal. 1, 135-155.
230. Parlett, B. N., Simon, H., and Stringer, L. M. (1982). On estimating the largest eigenvalue with the Lanczos algorithm. Math. Comp. 38, 153-165.
231. Parlett, B. N. (1982). Two monitoring schemes for the Lanczos algorithm. In Computing Methods in Applied Sciences and Engineering. V. Glowinski, R. and Lions, J. L., (Eds.) North-Holland, Amsterdam, 27-34.
232. Parlett, B. N., Taylor, D., and Liu, Z-S (1983). The look ahead Lanczos algorithm for large unsymmetric eigenproblems. In Sixth International Conference on Computing Methods in Applied Science and Engineering, Versailles, France.
233. Parrish, W. (1980). Advances in computerized x-ray diffractometry and x-ray analysis. IBM San Jose Research Center, RJ 2774.
234. Peters, G., and Wilkinson, J. H. (1969). Eigenvalues of Ax = λBx with band symmetric A and B. Comput. J. 12, 398-404.
235. Peters, G., and Wilkinson, J. H. (1970). Ax = λBx and the generalized eigenvalue problem. SIAM J. Numer. Anal. 7, 479-492.
236. Peters, G., and Wilkinson, J. H. (1974). In Accuracy of computed eigensystems and invariant subspaces. Studies in Numerical Analysis, Academic Press, New York, 115-135.
237. Peters, G., and Wilkinson, J. H. (1979). Inverse iteration, ill-conditional equations and Newton's method. SIAM Rev. 21, 339-360.
238. The PFORT Verifier (1974). Ryder, B. G. Software-Practice and Experience 4, 359-377.
239. PFORT Verifier (1981). Ryder, B. G., and Hall, A. D. Bell Laboratory Computer Science Technical Report 12.
240. Platzman, G. W. (1972). North Atlantic ocean: Preliminary description of normal modes. Science 178, 156-157.
241. Platzman, G. W. (1972b). Two dimensional free oscillations in natural basins. J. Phys. Oceanogr. 2, 117-138.
242. Platzman, G. W. (1975). Normal modes of the Atlantic and Indian oceans. J. Phys. Oceanogr. 5, 201-221.
243. Platzman, G. W. (1978). Normal modes of the world ocean. Part I. Design of finite-element barotropic model. J. Phys. Oceanogr. 8, 323-343.
244. Platzman, G. W. (1979). A Kelvin wave in the eastern north Pacific ocean. J. Geophys. Res. 84, 2525-2528.
245. Reid, J. K. (1971). On the method of conjugate gradients for the solution of large sparse systems of linear equations. In Large Sparse Sets of Linear Equations. Reid, J. K. (Ed.), Academic Press, New York, 231-254.
246. Reid, J. K. (1980). A survey of sparse matrix computation. In [Erisman 1980], 41-69.
247. Ruhe, A. (1974). SOR-methods for the eigenvalue problem with large sparse matrices. Math. Comp. 28, 695-710.
248. Ruhe, A. (1974b). Iterative eigenvalue algorithms for large symmetric matrices. In Numerische Behandlung von Eigenwertaufgaben. L. Collatz, ed. Birkhauser, Basel, 97-115.
249. Ruhe, A. (1975). On the closeness of eigenvalues and singular values for almost normal matrices. Linear Algebra Appl. 11, 87-93.
250. Ruhe, A. (1976). Computation of eigenvalues and eigenvectors. In Sparse Matrix Techniques. Barker, V. A. (Ed.), Springer, New York, 130-184.
251. Ruhe, A. (1979). Implementation aspects of band Lanczos algorithms for computation of eigenvalues of large sparse symmetric matrices. Math. Comp. 33, 680-687.
252. Rutishauser, H. (1959). Theory of gradient methods. In Refined Iterative Methods for Computation of the Solution and the Eigenvalues of Self-Adjoint Boundary Value Problems. Engeli, M., Ginsburg, J., Rutishauser, H., and Stiefel, E. L. Eds. Birkhauser, Basel.
253. Rutishauser, H. (1969). Computational aspects of F. L. Bauer's simultaneous iteration method. Numer. Math. 13: 4-13.
254. Rutishauser, H. (1970). Simultaneous iteration methods for symmetric matrices. Numer. Math. 16, 205-223.
255. Saad, Y. (1980). On the rates of convergence of the Lanczos and the block-Lanczos methods. SIAM J. Numer. Anal. 17, 687-706.
256. Saad, Y. (1982). The Lanczos biorthogonalization algorithm and other oblique projection methods for solving large unsymmetric systems. SIAM J. Numer. Anal. 19, 485-506.
257. Sahasrabudhe, S. C. and Vaidya, P. M. (1979). Estimation of singular values of an image matrix. IEEE Trans. ASSP-27, 434-436.
258. Schwarz, H. R. (1968). Tridiagonalization of a symmetric band matrix. Numer. Math. 12, 231-241.
259. Schwarz, H. R., Rutishauser, H. and Stiefel, E. (1973). Numerical Analysis of Symmetric Matrices. Prentice-Hall, Englewood Cliffs, New Jersey.
260. Schwarz, H. R. (1974). The eigenvalue problem (A-λB)x = 0 for symmetric matrices of high order. Comput. Methods Appl. Mech. Engrg. 3, 11-28.
261. Schwarz, H. R. (1974b). The method of coordinate overrelaxation for (A-λB)x = 0. Numer. Math. 23, 135-151.
262. Schwarz, H. R. (1977). Two algorithms for treating Ax = λBx. Comput. Methods Appl. Mech. Engrg. 12, 181-199.
263. Scott, D. S. (1978). Analysis of the symmetric Lanczos algorithm. Ph.D. Thesis, UC Berkeley.
264. Scott, D. S. (1979). Block Lanczos software for symmetric eigenvalue problems. ORNL Report CSD-48, Oak Ridge, Tennessee.
265. Scott, D. S. (1979b). How to make the Lanczos algorithm converge slowly. Math. Comp. 33, 239-247.
266. Scott, D. S. (1980). The advantages of inverted operators in Rayleigh-Ritz approximations. SIAM J. Sci. Statist. Comput. 3, 68-75.
267. Scott, D. S. (1981). The Lanczos algorithm. In Sparse Matrices and Their Uses, Duff, I. S. (Ed.), Academic Press, New York, 139-159.
268. Scott, D. S. (1981b). Solving sparse symmetric generalized eigenvalue problem without factorization. SIAM J. Numer. Anal. 18, 102-110.
269. Scott, D. S., and Ward, R. C. (1982). Solving symmetric-indefinite quadratic lamda-matrix problems without factorization. SIAM J. Sci. Statist. Comput. 3, 58-67.
270. + J. Chem. Phys. 74, 3240-3248.
271. Shavitt, I. (1970). Modification of Nesbet's algorithm for the iterative evaluation of eigenvalues and eigenvectors of large matrices. J. Comput. Phys. 6, 124-130.
272. Shavitt, I., Bender, C. F., Pipano, A., and Hosteny, R. P. (1973). The iterative calculation of several of the lowest or highest eigenvalues and corresponding eigenvectors of very large symmetric matrices. J. Comput. Phys. 11, 90-108.
273. Simon, H. D. (1982) The Lanczos algorithm for solving symmetric linear systems. PhD Thesis UC Berkeley.
274. Simon, H. D. (1984). The Lanczos algorithm with partial reorthogonalization. Math. Comp. 42, 115-142.
275. Slonczewski, J. C., Müller, K. A., and Berlinger, W. (1970). Dynamic Jahn-Teller effect of an impurity in a spontaneously distorted crystal. Phys. Rev. B 1, 3545-3551.
276. Smithies, F. (1958). Integral Equations. Cambridge University Press.
277. SPARSPAK User Guide (1979). George, A., Liu, J. W. H., and Ng, E. CS Dept. Tech. Report. U. Waterloo.
278. Stein, J., and Krey, U. (1979). Numerical studies on the Anderson localization. Z. Phys. B 34, 287-296.
279. Stewart, G. W. (1973). Introduction to Matrix Computations. Academic Press, New York.
280. Stewart, G. W. (1973b). Error and perturbation bounds for subspaces associated with certain eigenvalue problems. SIAM Rev. 15, 727-764.
281. Stewart, G. W. (1974). The numerical treatment of large eigenvalue problems. In Information Processing 74 North Holland, Amsterdam 666-672.
282. Stewart, G. W. (1975). Methods of simultaneous iteration for calculating eigenvectors of matrices. In Topics in Numerical Analysis II. Miller, J. J. H. (Ed.), Academic Press, New York, 185-196.
283. Stewart, G. W. (1976). A bibliographical tour of the large, sparse generalized eigenvalue problem. In [Bunch, 1976], 113-130.
284. Stewart, G. W. (1977). On the perturbation of pseudo-inverses, projections and linear least squares problems. SIAM Rev. 9, 634-662.
285. Stewart, G. W. (1978). Perturbation theory for the generalized eigenvalue problem. In Recent Advances in Numerical Analysis, Academic Press, New York, 193-206.
286. Stewart, W. J., and Jennings, A. (1981). A simultaneous iteration algorithm for real matrices. ACM TOMS 7, 184-198.
287. Stiefel, E. (1958). Kernel polynomials in linear algebra and their numerical applications. Nat. Bur. Standards Appl. Math. Ser. 49, 1-22.
288. Symm, H. J., and Wilkinson, J. H. (1980). Realistic error bounds for a simple eigenvalue and its associated eigenvector. Numer. Math. 35, 113-126.
289. Szyld, D. B., and Widlund, O. B. (1979) Applications of conjugate gradient type methods to eigenvalue calculations. In Advances in Computer Methods for Partial Differential Equations. III. Proc. Third IMACS Internat. Symposium, Lehigh U., Bethlehem, Pennsylvania, 167-173.
290. Takahashi, H. (1981) On the Lanczos method in eigenvalue problems. In Proc. Kyoto U. Symp., 119-139.
291. Taussky, O., and Marcus, M. (1962). Eigenvalues of finite matrices. In Survey of Numerical Analysis, Todd, J. A. (Ed.), McGraw-Hill, New York, 279-297.
292. Taussky, O. (1963). On the variation of the characteristic roots of a finite matrix under various changes of its elements. In Recent Advances in Matrix Theory, Schneider, H. (Ed.), U. Wisconsin Press, 125-138.
293. Thouless, D. J. (1974). Electrons in disordered systems and the theory of localization. Physics Reports (Sect. C of Phys. Letters) 13, 93-142.
294. Tikhonov, A. N., and Arsennin, V. Y. (1977). Solution of Ill-posed Problems. Wiley, New York.
295. Underwood, R. (1975). An iterative block Lanczos method for the solution of large sparse symmetric eigenproblems. Ph. D. Thesis and Report, STAN-CS-75-496, Stanford.
296. van der Vorst, H. A. (1982). A generalized Lanczos scheme. Math. Comp. 39, 559-561.
297. van Kats, J. M., and van der Vorst, H. A. (1976). Numerical results of the Paige-style Lanczos method for the computation of extreme eigenvalues of large sparse matrices. Acad. Comp. Centrum Report TR-7, U. Utrecht
298. van Kats, J. M., and van der Vorst, H. A. (1977). Automatic monitoring of Lanczos schemes for symmetric or skew symmetric generalized eigenvalue problems. Acad. Comp. Centrum Report TR-7, U. Utrecht.
299. Van Loan, C. F. (1976). Generalizing the singular value decomposition. SIAM J. Numer. Anal. 13, 76-82.
300. Van Ness, J. E., Brasch, F. M., Jr., Landaren, G. L. and Naumann, S. T. (1980). Analytical investigation of dynamic instability occurring at Powerton station. IEEE Trans. PAS-99, 1386-1395.
301. Varah, J. M. (1970). Computing invariant subspaces of a general matrix when the eigensystem is poorly conditioned. Math. Comp. 24, 137-149.
302. Varah, J. M. (1973). On the numerical solution of ill-conditioned linear systems with applications to ill-posed problems. SIAM J. Numer. Anal. 10, 257-267.
303. Varah, J. M. (1975). A lower bound for the smallest singular value of a matrix. Linear Algebra Appl. 11, 3-5.
304. Varah, J. M. (1979). A practical examination of some numerical methods for linear discrete ill-posed problems. SIAM Rev. 21, 100-111.
305. Varah, J. M. (1983). Pitfalls in the numerical solution of linear ill-posed problems. SIAM J. Sci. Statist. Comput. 4, 164-176.
306. Varga, R. S. (1962). Matrix Iterative Analysis. Prentice-Hall, Englewood Cliffs, New Jersey.
307. Varga, R. S. (1976). M-matrix theory and recent results in numerical linear algebra. In [Bunch 1976], 375-387.
308. Ward, R. C., and Gray, L. J. (1978). Eigensystem computation for skew-symmetric matrices and a class of symmetric matrices. ACM TOMS 4, 278-285.
309. Weaire, D., and Hodges, C. (1978). Anderson localization and the recursion method. J. Phys. C. 11, L685-L689.
310. Weaver, W., Jr., and Yoshida, D. M. (1971). The eigenvalue problem for banded matrices. Comput. & Structures 1, 651-664.
311. Webster's Third New International Dictionary Unabridged, G & C. (1971). Merriam Co., Springfield, MA.
312. Weingarten, V. I., Ramanathan, R. K., Chen, C. N. (1983). Lanczos eigenvalue algorithm for large structures on a minicomputer. Comput. & Structures 16, 253-257.
313. Weyl, H. (1949). Inequalities between the two kinds of eigenvalues of a linear transformation. Proc. Nat. Acad. Sci. USA 35, 408-411.
314. Whitehead, R. R. (1972). A numerical approach to nuclear shell-model calculations. Nucl. Phys. A182, 290-300.
315. Whitehead, R. R., Watt, A., Cole, B. J., and Morrison, I. (1977). Computational methods for nuclear shell-model calculations. In Advances in Nuclear Physics, Baranger, M., and Vogt, E. (Eds.), Plenum Press, New York, 123-176.
316. Wiberg, T. (1973). A combined Lanczos and conjugate gradient method for the eigenvalue problem of large sparse matrices. Report UM1NF-42.73, U. Umeä.
317. Wiberg, T. (1979). A convergence theorem for the Lanczos algorithm for computing eigenvalues of large sparse matrices. Report UM1NF-77.79, U. Umeä.
318. Wilkinson, J. H. (1958). The calculation of eigenvectors of codiagonal matrices. Comput. J. 1, 90-96.
319. Wilkinson, J. H. (1958b). The calculation of eigenvectors by the method of Lanczos. Comput. J. 1, 148-152.
320. Wilkinson, J. H. (1960). Householder's method for the solution of the algebraic eigenproblem. Comput. J. 3, 23-27.
321. Wilkinson, J. H. (1962). Calculation of the eigenvalues of a symmetric tridiagonal matrix by the method of bisection. Numer. Math. 4, 362-367.
322. Wilkinson, J. H. (1962b). Calculation of the eigenvectors of a symmetric tridiagonal matrix by inverse iteration. Numer. Math. 4, 368-376.
323. Wilkinson, J. H. (1965). The Algebraic Eigenvalue Problem. Oxford University Press, New York.
324. Wilkinson, J. H. (1968). Global convergence of tridiagonal QR with origin shift. Linear Algebra Appl. 1, 409-420.
325. Wilkinson, J. H., and Reinsch, C. (1971). Handbook for Automatic Computation. Vol. II. Linear Algebra. Vol. II. Springer-Verlag, New York.
326. Wilkinson, J. H. (1972). Inverse iteration in theory and practice. Symposia Mathematica 10, 361-379.
327. Wilkinson, J. H. (1977). Some recent advances in numerical linear algebra. In [Jacobs 1977], 3-53.
328. Wilkinson, J. H. (1978). Singular-value decomposition - basic aspects. In [Jacobs 1978], 109-135.
329. Winant, C. D., Inman, D. L., and Nordstrom, C. E. (1975). Description of seasonal beach changes using empirical eigenfunctions. J. Geophys. Res. 80, 1979-1984.
330. Winkelman, J. R., Chow, J. H., Bowler, B. C., and Avramovic, B. (1981). An analysis of interarea dynamics of multi-machine systems. IEEE Trans PAS 400, 754-763.
331. Yale Sparse Matrix Package. (1982). Eisenstat, S. C., Gursky, M. C., Schultz, H. M., and Sherman, A. H. I-Symmetric Codes. Inter. J. Numer. Methods Engrg. 18, 1145-1151.
332. Yale Sparse Matrix Package. (1982b). Eisenstat, S. C., Gursky, M. C., Schultz, H. M., and Sherman, A. H. II-Nonsymmetric Codes. CS Report 114, Yale.