Abstract
A restarted nonsymmetric Lanczos algorithm is given for computing eigenvalues and both right and left eigenvectors. The restarting limits the storage so that finding eigenvectors is practical. Restarting also makes it possible to deal with roundoff error in new ways. We give a scheme for avoiding near-breakdown and discuss maintaining biorthogonality. A system of linear equations can be solved simultaneously with the eigenvalue computations. Deflation from the presence of the eigenvectors allows the linear equations to generally have good convergence in spite of the restarting. The right and left eigenvectors generated while solving the linear equations can be used to help solve systems with multiple right-hand sides.
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.
