Answers are grounded in this paper and cite their sources.
The following nonlinear eigenvalue problem is studied : Let T(λ ) be an n × n matrix, whose elements are analytical functions of the complex number λ. We seek λ and vectors x and y, such that T(λ )x = 0, and yH T(λ ) = 0. Several algorithms for the numerical solution of this problem are studied. These algorithms are extensions of algorithms for the linear eigenvalue problem such as inverse iteration and the $QR$ algorithm, and algorithms that reduce the nonlinear problem into a sequence of linear problems. It is found that this latter method can be extended into a global strategy, finding a complete basis of eigenvectors in the cases where it is proved that such a basis exists. Numerical tests, performed in order to compare the different algorithms, are reported, and a few numerical examples illustrating their behavior are given.
No takes yet. Share an insight, caveat, or question.
Axel Ruhe (1973) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: