Abstract
Given n + 1 pairs of complex numbers and vectors (closed under complex conjugation), the inverse quadratic eigenvalue problem is to construct real symmetric or anti-symmetric matrix C and real symmetric matrix K of size n × n so that the quadratic pencil Q ( λ ) = λ 2 I n + λ C + K has the given n + 1 pairs as eigenpairs. Necessary and sufficient conditions under which this quadratic inverse eigenvalue problem is solvable are obtained. Numerical algorithms for solving the problem are developed. Numerical examples illustrating these solutions are presented.
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.