The decompositional approach to matrix computation

Computing in Science and Engineering

Volumn 2, Issue 1, 2000, Pages 50-59

  Stewart, G W ^a  

^a Univ of Maryland ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347737736     PISSN: 15219615     EISSN: None     Source Type: Journal    
DOI: 10.1109/5992.814658     Document Type: Article

References (58)

1. P.S. Dwyer, Linear Computations, John Wiley & Sons, New York, 1951.
2. A.S. Householder, Principles of Numerical Analysis, McCraw-Hill, New York, 1953.
3. J.H. Wilkinson and C. Reinsch, Handbook for Automatic Computation, Vol. II, Linear Algebra, Springer-Verlag, New York, 1971.
4. B.S. Garbow et al., "Matrix Eigensystem Routines - Eispack Guide Extension," Lecture Notes in Computer Science, Springer-Verlag, New York, 1977.
5. J.J. Dongarra et al., LINPACK User's Guide, SIAM, Philadelphia, 1979.
6. E. Anderson et al., LAPACK Users' Guide, second ed., SIAM, Philadelphia, 1995.
7. J.J. Dongarra et al., "An Extended Set of Fortran Basic Linear Algebra Subprograms," ACM Trans. Mathematical Software, Vol. 14, 1988, pp. 1-17.
8. J.J. Dongarra et al., "A Set of Level 3 Basic Linear Algebra Subprograms," ACM Trans. Mathematical Software, Vol. 16, 1990, pp. 1-17.
9. C.L. Lawson et al., "Basic Linear Algebra Subprograms for Fortran Usage," ACM Trans. Mathematical Software, Vol. 5, 1979, pp. 308-323.
10. A. Cayley, "A Memoir on the Theory of Matrices," Philosophical Trans. Royal Soc. of London, Vol. 148, 1858, pp. 17-37.
11. C.C. Mac Duffee, The Theory of Matrices, Chelsea, New York, 1946.
12. P.S. Dwyer, "A Matrix Presentation of Least Squares and Correlation Theory with Matrix Justification of Improved Methods of Solution," Annals Math. Statistics, Vol. 15, 1944, pp. 82-89.
13. H. Jensen, An Attempt at a Systematic Classification of Some Methods for the Solution of Normal Equations, Report No. 18, Geodætisk Institut, Copenhagen, 1944.
14. J. von Neumann and H.H. Coldstine, "Numerical Inverting of Matrices of High Order," Bull. Am. Math. Soc., Vol. 53, 1947, pp. 1021-1099.
15. A.S. Householder, The Theory of Matrices in Numerical Analysis, Dover, New York, 1964.
16. W. Givens, Numerical Computation of the Characteristic Values of a Real Matrix, Tech. Report 1574, Oak Ridge Nat'l Laboratory, Oak Ridge, Tenn., 1954.
17. J.H. Wilkinson, "Error Analysis of Direct Methods of Matrix Inversion," J. ACM, Vol. 8, 1961, pp. 281-330.
18. J.H. Wilkinson, The Algebraic Eigenvalue Problem, Clarendon Press, Oxford, U.K., 1965.
19. Å. Björck, Numerical Methods for Least Squares Problems, SIAM, Philadelphia, 1996.
20. B.N. Datta, Numerical Linear Algebra and Applications, Brooks/ Cole, Pacific Grove, Calif., 1995.
21. J.W. Demmel, Applied Numerical Linear Algebra. SIAM, Philadelphia, 1997.
22. N.J. Higham, Accuracy and Stability of Numerical Algorithms, SIAM, Philadelphia, 1996.
23. B.N. Parlett, The Symmetric Eigenvalue Problem, Prentice-Hall, Englewood Cliffs, N.J., 1980; reissued with revisions by SIAM, Philadelphia, 1998.
24. G.W. Stewart, Introduction to Matrix Computations, Academic Press, New York, 1973.
25. G.W. Stewart, Matrix Algorithms I: Basic Decompositions, SIAM, Philadelphia, 1998.
26. D.S. Watkins, Fundamentals of Matrix Computations, John Wiley & Sons, New York, 1991.
27. C.F. Gauss, Theoria Motus Corporum Coelestium in Sectionibus Conicis Solem Ambientium [Theory of the Motion of the Heavenly Bodies Moving about the Sun in Conic Sections], Perthes and Besser, Hamburg, Germany, 1809.
28. C.F. Gauss, "Disquisitio de elementis ellipticis Palladis [Disquisition on the Elliptical Elements of Pallas]," Commentatines societatis regiae scientarium Gottingensis recentiores, Vol. 1, 1810.
29. C. Benoît, "Note sur une méthode de résolution des équations normales provenant de l'application de la méthode des moindres cárres a un systém d'équations linéares en nombre inférieur 'a celui des inconnues. - application de la méthode à la resolution d'un systéme défini d'équations linéares (Procédé du Commandant Cholesky) [Note on a Method for Solving the Normal Equations Arising from the Application of the Method of Least Squares to a System of Linear Equations whose Number Is Less than the Number of Unknowns-Application of the Method to the Solution of a Definite System of Linear Equations]," Bullétin Géodésique (Toulouse), Vol. 2, 1924, pp. 5-77.
30. L.N. Trefethen and R.S. Schreiber, "Average-Case Stability of Gaussian Elimination," SIAM J. Matrix Analysis and Applications, Vol. 11, 1990, pp. 335-360.
31. L.N. Trefethen and D. Bau III, Numerical Linear Algebra, SIAM, Philadelphia, 1997, pp. 166-170.
32. C.G.J. Jacobi, "Über einen algebraischen Fundamentalsatz und seine Anwendungen [On a Fundamental Theorem in Algebra and Its Applications]," Journal für die reine und angewandte Mathematik, Vol. 53, 1857, pp. 275-280.
33. E. Schmidt, "Zur Theorie der linearen und nichtlinearen Integralgleichungen. I Teil, Entwicklung willkürlichen Funktionen nach System vorgeschriebener [On the Theory of Linear and Nonlinear Integral Equations. Part I, Expansion of Arbitrary Functions by a Prescribed System]," Mathematische Annalen, Vol. 63, 1907, pp. 433-476.
34. P.S. Laplace, Theorie Analytique des Probabilites [Analytical Theory of Probabilities], 3rd ed., Courrier, Paris, 1820.
35. A.S. Householder, "Unitary Triangularization of a Nonsymmetric Matrix," J. ACM, Vol. 5, 1958, pp. 339-342.
36. D. Bogert and W.R. Burris, Comparison of Least Squares Algorithms, Tech. Report ORNL-3499, V.1, S5.5, Neutron Physics Div., Oak Ridge Nat'l Laboratory, Oak Ridge, Tenn., 1963.
37. G.H. Golub, "Numerical Methods for Solving Least Squares Problems," Numerische Mathematik, Vol. 7, 1965, pp. 206-216.
38. J.J.M. Cuppen, "A Divide and Conquer Method for the Symmetric Eigenproblem," Numerische Mathematik, Vol. 36, 1981, pp. 177-195.
39. M. Gu and S.C. Eisenstat, "Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem," SIAM J. Matrix Analysis and Applications, Vol. 15, 1994, pp. 1266-1276.
40. J. Demmel and K. Veselic, "Jacobi's Method Is More Accurate than QR," SIAM J. Matrix Analysis and Applications, Vol. 13, 1992, pp. 1204-1245.
41. A.L. Cauchy, "Sur l'equation á l'aide de laquelle on détermine les inégalites séculaires des mouvements des planétes [On the Equation by which the Inequalities for the Secular Movement of Planets Is Determined]," Oeuvres Completes (II, e Séie), Vol. 9, 1829.
42. C.G.J. Jacobi, "Über ein leichtes Verfahren die in der Theorie der Säculärstörungen vorkommenden Gleichungen numerisch aufzulösen [On an Easy Method for the Numerical Solution of the Equations that Appear in the Theory of Secular Perturbations]," Journal für die reine und angewandte Mathematik, Vol. 30, 1846, pp. 51-594.
43. J.H. Wilkinson, "Householder's Method for the Solution of the Algebraic Eigenvalue Problem," Computer J., Vol. 3, 1960, pp. 23-27.
44. R.H. Bartels and G.W. Stewart, "Algorithm 432: The Solution of the Matrix Equation AX - BX = C," Comm. ACM, Vol. 8, 1972, pp. 820-826.
45. G.H. Golub, S. Nash, and C. Van Loan, "Hessenberg-Schur Method for the Problem AX + XB = C," IEEE Trans. Automatic Control, Vol. AC-24, 1979, pp. 909-913.
46. J.G.F. Francis, "The QR Transformation, Parts I and II," Computer J., Vol. 4, 1961, pp. 265-271, 1962, pp. 332-345.
47. J.G.F. Francis, "The QR Transformation, Parts I and II," Computer J., Vol. 4, 1961, pp. 265-271, 1962, pp. 332-345.
48. J. Schur, "Über die charakteristischen Würzeln einer linearen Substitution mit einer Anwendung auf die Theorie der Integral gleichungen [On the Characteristic Roots of a Linear Transformation with an Application to the Theory of Integral Equations]," Mathematische Annalen, Vol. 66, 1909, pp. 448-510.
49. M. Gu and S.C. Eisenstat, "A Divide-and-Conquer Algorithm for the Bidiagonal SVD," SIAM J. Matrix Analysis and Applications, Vol. 16, 1995, pp. 79-92.
50. E. Beltrami, "Sulle funzioni bilineari [On Bilinear Functions]," Giornale di Matematiche ad Uso degli Studenti Delle Universita, Vol. 11, 1873, pp. 98-106.
51. An English translation by D. Boley is available in Tech. Report 90-37, Dept. of Computer Science, Univ. of Minnesota, Minneapolis, 1990.
52. C. Jordan, "Memoire sur les formes bilineaires [Memoir on Bilinear Forms]," Journal de Mathematiques Pures et Appliquees, Deuxieme Serie, Vol. 19, 1874, pp. 35-54.
53. G.H. Golub and W. Kahan, "Calculating the Singular Values and Pseudo-Inverse of a Matrix," SIAM J. Numerical Analysis, Vol. 2, 1965, pp. 205-224.
54. E.G. Kogbetliantz, "Solution of Linear Systems by Diagonalization of Coefficients Matrix," Quarterly of Applied Math., Vol. 13, 1955, pp. 123-132.
55. T.F. Chan, "Rank Revealing QR Factorizations," Linear Algebra and Its Applications, Vol. 88/89, 1987, pp. 67-82.
56. G.W. Stewart, "An Updating Algorithm for Subspace Tracking," IEEE Trans. Signal Processing, Vol. 40, 1992, pp. 1535-1541.
57. Z. Bai and J.W. Demmel, "Computing the Generalized Singular Value Decomposition," SIAM J. Scientific and Statistical Computing, Vol. 14, 1993, pp. 1464-1468.
58. C.B. Moler and G.W. Stewart, "An Algorithm for Generalized Matrix Eigenvalue Problems," SIAM J. Numerical Analysis, Vol. 10, 1973, pp. 241-256.