Abstract
We extend the perturbation theory of Višik, Ljusternik and Lidskii to the case of eigenvalues of matrix pencils. This extension allows us to solve certain degenerate cases of this theory. We show that the first order asymptotics of the eigenvalues of a perturbed matrix pencil can be computed generically by methods of min-plus algebra and optimal assignment algorithms. We illustrate this result by discussing a singular perturbation problem considered by Najman.
| Translated title of the contribution | Perturbation of eigenvalues of matrix pencils and the optimal assignment problem |
|---|---|
| Original language | French |
| Pages (from-to) | 103-108 |
| Number of pages | 6 |
| Journal | Comptes Rendus Mathematique |
| Volume | 339 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 15 Jul 2004 |
Fingerprint
Dive into the research topics of 'Perturbation of eigenvalues of matrix pencils and the optimal assignment problem'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver