The computation of eigenvalues and eigenvectors of very large sparse matrices
Several methods are avi1iible for computing elgenvalues and eigenveotors of large sparse matrices, but as yet no outstandingly good algorithm is generally known. For the synimetric matrix case one of the most elegant algorithms thetiretically is the method of m1rini1zed iterations developed by Lancz...
| Main Author: | |
|---|---|
| Published: |
University of London
1971
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.307848 |