Abstract
Two different Lanczos-type methods for the linear response eigenvalue problem are analyzed. The first one is a natural extension of the classical Lanczos method for the symmetric eigenvalue problem while the second one was recently proposed by Tsiper specially for the linear response eigenvalue problem. Our analysis leads to bounds on errors for eigenvalue and eigenvector approximations by the two methods. These bounds suggest that the first method can converge significantly faster than Tsiper’s method. Numerical examples are presented to support this claim.
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.
