Some Modified Matrix Eigenvalue Problems
Gene Howard Golub · SIAM Review · 1973
We consider the numerical calculation of several matrix eigenvalue problems which require some manipulation before the standard algorithms may be used. This includes finding the stationary values of a quadratic form subject to linear constraints and determining the eigenvalues of a matrix which is modified by a matrix of rank one. We also consider several inverse eigenvalue problems. This includes the problem of determining the coefficients for the Gauss–Radau and Gauss–Lobatto quadrature rules. In addition, we study several eigenvalue problems which arise in least squares.
Cited by 728 works. doi:10.1137/1015032
Authors
References
- The algebraic eigenvalue problem
- The Algebraic Eigenvalue Problem
- Singular value decomposition and least squares solutions
- Numerical methods for solving linear least squares problems
- Testing for Serial Correlation in Least-Squares Regression When Some of the Regressors are Lagged Dependent Variables
- Approximate Calculation of Integrals
- Approximate Calculation of Integrals.
- Calculation of Gauss Quadrature Rules
- Numerical Methods for Computing Angles Between Linear Subspaces
- On the Stationary Values of a Second-Degree Polynomial on the Unit Sphere