Perturbation of eigenvalues of matrix pencils and optimal assignment problem

Details Perturbation of eigenvalues of matrix pencils and optimal assignment problem Perturbation of eigenvalues of matrix pencils and optimal assignment problem

2004-02-26

arxiv.org/abs/math/0402438v1

C. R. Acad. Sci. Paris, Ser. I 339 (2004), pages 103--108.

Mathematics

Spectral Theory

8 pages

Scientific paper

10.1016/j.crma.2004.05.001

We consider a matrix pencil whose coefficients depend on a positive parameter $\epsilon$, and have asymptotic equivalents of the form $a\epsilon^A$ when $\epsilon$ goes to zero, where the leading coefficient $a$ is complex, and the leading exponent $A$ is real. We show that the asymptotic equivalent of every eigenvalue of the pencil can be determined generically from the asymptotic equivalents of the coefficients of the pencil. The generic leading exponents of the eigenvalues are the "eigenvalues" of a min-plus matrix pencil. The leading coefficients of the eigenvalues are the eigenvalues of auxiliary matrix pencils, constructed from certain optimal assignment problems.

Affiliated with

Also associated with

No associations

Rating

Perturbation of eigenvalues of matrix pencils and optimal assignment problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Perturbation of eigenvalues of matrix pencils and optimal assignment problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Perturbation of eigenvalues of matrix pencils and optimal assignment problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-130441