The simultaneous computation of a few of the algebraically largest and smallest eigenvalues of a large, sparse, symmetric matrix
- 1 September 1978
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 18 (3) , 265-275
- https://doi.org/10.1007/bf01930896
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- On the numerical solution of the eigenvalue problem of the laplace operator by a capacitance matrix methodComputing, 1978
- The minimization of certain nondifferentiable sums of eigenvalues of symmetric matricesPublished by Springer Nature ,1975
- A block Lanczos algorithm for computing the q algebraically largest eigenvalues and a corresponding eigenspace of large, sparse, real symmetric matricesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1974
- An iterative method for finding characteristic vectors of a symmetric matrixPacific Journal of Mathematics, 1951
- On a Theorem of Weyl Concerning Eigenvalues of Linear Transformations IProceedings of the National Academy of Sciences, 1949