Abstract
This paper proposes the Lanczos type of biconjugate residual (BCR) algorithm for solving the quadratic inverse eigenvalue problem L 2 X Λ 2 + L 1 X Λ + L 0 X = 0 where L 2 , L 1 and L 0 should be partially bisymmetric under a prescribed submatrix constraint. An analysis reveals that the algorithm obtains the solutions of the constrained quadratic inverse eigenvalue problem in finitely many steps in the absence of round-off errors. Finally numerical results are performed to confirm the analysis and to illustrate the efficiency of the proposed algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have