Abstract
Given a pair of n×n matrices A and B, we consider the problem of finding values λ such that the matrix A+λB has a multiple eigenvalue. Our approach solves the problem using only the standard matrix computation tools. By formulating the problem as a singular two-parameter eigenvalue problem, we construct matrices Δ1 and Δ0 of size 3n2×3n2 with the property that the finite regular eigenvalues of the singular pencil Δ1−λΔ0 are the values λ such that A+λB has a multiple eigenvalue. We show that these values can be computed numerically from Δ1 and Δ0 by the staircase algorithm.
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.
