Abstract
We consider quadratic eigenvalue problems in which the coefficient matrices, and hence the eigenvalues and eigenvectors, are functions of a real parameter. Our interest is in cases in which these functions remain differentiable when eigenvalues coincide. Many papers have been devoted to numerical methods for computing derivatives of eigenvalues and eigenvectors, but most require the eigenvalues to be well separated. The few that consider close or repeated eigenvalues place severe restrictions on the eigenvalue derivatives. We propose, analyze, and test new algorithms for computing first and higher order derivatives of eigenvalues and eigenvectors that are valid much more generally. Numerical results confirm the effectiveness of our methods for tightly clustered eigenvalues.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.