G. Estrin
- 1 ESTRIN, G. Proe. Western Joint Comput. Conf. (May, 1960), 33-0.Google Scholar
- 2 JacoBI, C. G. J. Crelle's J. Math. 30 (1840), 51-95.Google Scholar
- 3 WHITE, P. A. J. SIAM 6, 4 (Dee. 1958), 393-437.Google Scholar
- 4 CIARGENAU, H., aND MURPHY, G.M. The Mathematics of Physics and Chemistry. D. Van Nostrand Co., Inc., pp. 304-316.Google Scholar
- 5 Bonnwic,, E. Matrix Calcuhs. Interscienee, 1956, pp. 181-182.Google Scholar
- 6 GREGORY', R.T. Math. Tables Aids Coat, put. 7 (1953), 215-220.Google Scholar
- 7 GOLDSTINE, H. H.; MURrtY, F. J.; VON NEVZN, J. J. ACM 6, 1 (Jan. 1959), 59-96. Google Scholar
- 8 FORSYTHE, G. E., AND HENRICI, P. Trans. Amer. Math. Soc. 94 (Jan. 1960), 1-23.Google Scholar
- 9 CORBATO, F.J. MI HD12, SAP-704, Floating trap matrix diagonalization subroutine. MIT Computation Center.Google Scholar
- 10 University of Illinois, Digital Computer Laboratory, Rep. No. 80, Oct. 1957.Google Scholar
- 11 GIVENS, W. A method of computing eigenvalues and eigenvectors suggested by classi cal results on symmetric matrices. Nat. Bur. Stand. Appl. Math. Series. 29, p. 117-122.Google Scholar
- 12 GIVENS, W. Numerical computation of the characteristic values of a REAL symmetric matrix. ORNL 1574 (Physics), Mar. 1954.Google Scholar
- 13 Fox, P.; ROTENBERG, A.; WETHERALL, E. Eigenvalue eigenveetor code NUMXEV and NUMLEV. AEC Computing and Applied Msthematies Center, New York University.Google Scholar
Index Terms
- Organization of a ``Fixed-Plus-Variable'' Structure Computer for Computation of Eigenvalues and Eigenvectors of Real Symmetric Matrices
Recommendations
Parallel computation of the eigenvalues of symmetric Toeplitz matrices through iterative methods
This paper presents a new procedure to compute many or all of the eigenvalues and eigenvectors of symmetric Toeplitz matrices. The key to this algorithm is the use of the ''Shift-and-Invert'' technique applied with iterative methods, which allows the ...
Nonpositive Eigenvalues of Hollow, Symmetric, Nonnegative Matrices
Among hollow, symmetric $n$-by-$n$ nonnegative matrices, it is shown that any number $k$, $2\leq k\leq n-1$ of nonpositive eigenvalues is possible. However, as $n$ grows, small numbers of nonpositive eigenvalues become increasingly rare. In particular, if ...
Accurate Eigenvalues and SVDs of Totally Nonnegative Matrices
We consider the class of totally nonnegative (TN) matrices---matrices all of whose minors are nonnegative. Any nonsingular TN matrix factors as a product of nonnegative bidiagonal matrices. The entries of the bidiagonal factors parameterize the set of ...
Comments