Abstract

This work presents a new algorithm to compute eigenpairs of large unsymmetric matrices. Using the Induced Dimension Reduction method (IDR(s)), which was originally proposed for solving systems of linear equations, we obtain a Hessenberg decomposition, from which we approximate the eigenvalues and eigenvectors of a matrix. This decomposition has two main advantages. First, IDR(s) is a short-recurrence method, which is attractive for large scale computations. Second, the IDR(s) polynomial used to create this Hessenberg decomposition is also used as a filter to discard the unwanted eigenvalues. Additionally, we incorporate the implicitly restarting technique proposed by D.C. Sorensen, in order to approximate specific portions of the spectrum and improve the convergence.

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 call

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.