Abstract
The main purpose of this work is to give a generalization of the Subspace Iteration Method to compute the largest eigenvalues and their corresponding eigenvectors of the matrix pencil $A-lambda B$. An effective single shift procedure is given. Several numerical experiments are presented to illustrate the effectiveness of the proposed methods.
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 callDisclaimer: 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.
