Abstract
Generalized eigenvalue problems are often solved by a combination of inverse iteration and the Rayleigh–Ritz procedure. In this paper we show that significant advantages can be obtained in this context by applying the Rayleigh–Ritz procedure to an inverted operator, either explicitly while using subspace iteration or implicitly by applying the Lanczos algorithm to the inverted operator. Since the Lanczos algorithm is much more powerful than subspace iteration it should be used whenever possible.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: SIAM Journal on Scientific and Statistical Computing
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.
