Abstract
The computation of the eigenvalues of a square matrix is a problem of considerable difficulty. The naive idea, according to which it is enough to compute the characteristic polynomial and then find its roots, turns out to be hopeless because of Abel’s theorem, which states that the general equation P(x) = 0, where P is a polynomial of degree d ≥ 5, is not solvable using algebraic operations and roots of any order. For this reason, there exists no direct method, even an expensive one, for the computation of Sp(M).
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Serre, D. (2010). Approximation of Eigenvalues. In: Matrices. Graduate Texts in Mathematics, vol 216. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-7683-3_13
Download citation
DOI: https://doi.org/10.1007/978-1-4419-7683-3_13
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-7682-6
Online ISBN: 978-1-4419-7683-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)