Abstract
Many engineering and scientific applications require the computation of eigenvalues of large, sparse but unstructured symmetric matrices. Existing algorithms can be used to compute a few extreme eigenvalues (and corresponding eigenvectors). Using ideas from optimization theory and abandoning classical requirements of global orthogonality, we construct a Lanczos algorithm for computing not just the extreme eigenvalues of such matrices, but in fact all of the eigenvalues. The storage requirements are small, and this procedure has worked well on matrices with various eigenvalue distributions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.