Abstract
In this presentation we review iterative projection methods for sparse nonlinear eigenvalue problems which have proven to be very efficient. Here the eigenvalue problem is projected to a subspace V of small dimension which yields approximate eigenpairs. If an error tolerance is not met then the search space V is expanded in an iterative way with the aim that some of the eigenvalues of the reduced matrix become good approximations to some of the wanted eigenvalues of the given large matrix. Methods of this type are the nonlinear Arnoldi method, the Jacobi–Davidson method, and the rational Krylov method.
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.
