Content deleted Content added
Cuzkatzimhut (talk | contribs) started article |
Seacactus 13 (talk | contribs) No edit summary |
||
Line 1:
In mathematics, [[linear algebra]], the '''Faddeev–LeVerrier algorithm''' is a recursive method to calculate the coefficients of the [[characteristic polynomial]] <math>p(\lambda)=\det (\lambda I_n - A)</math> of a square [[matrix]], {{mvar|A}}, named after [[Dmitry Konstantinovich Faddeev]] and
[[Urbain Le Verrier]]. Calculation of this polynomial yields the [[eigenvalues]]s of ''A'' as its roots; as a matrix polynomial in ''A'' itself it vanishes by the fundamental [[Cayley–Hamilton theorem]]. Calculating determinants, however, is computationally cumbersome, whereas this efficient algorithm is computationally vastly more efficient.
| |||