This content is licensed under Creative Commons Attribution/Share-Alike License 3.0 (Unported). That means you may freely redistribute or modify this content under the same license conditions and must attribute the original author by placing a hyperlink from your site to this work https://planetcalc.com/8267/. Also, please do not modify any references to the original work (if any) contained in this content.
In linear algebra, the characteristic polynomial of an n×n square matrix A is a polynomial that is invariant under matrix similarity and has the eigenvalues as roots. The polynomial pA(λ) is monic (its leading coefficient is 1), and its degree is n. The calculator below computes coefficients of a characteristic polynomial of a square matrix using the Faddeev–LeVerrier algorithm. You can find theory and formulas below the calculator.
Given a square matrix A, we want to find a polynomial whose zeros are the eigenvalues of A. For a diagonal matrix A, the characteristic polynomial is easy to define: if the diagonal entries are a1, a2, a3, etc., then the characteristic polynomial will be:
This works because the diagonal entries are also the eigenvalues of this matrix.
For a general matrix A, one can proceed as follows. A scalar λ is an eigenvalue of A if and only if there is an eigenvector v ≠ 0 such that
(where I is the identity matrix).
Since v is non-zero, the matrix λ I − A is singular (non-invertible), which means that its determinant is 0. Thus the roots of the function det(λ I − A) are the eigenvalues of A, and it is clear that this determinant is a polynomial in λ.1
In matrix form polynomial in λ looks like this:
In scalar form
where, cn = 1 and c0 = (−1)n det A.
The coefficients can be found using the recursive Faddeev–LeVerrier algorithm (first published in 1840 by Urbain Le Verrier, in present form redeveloped by Dmitry Konstantinovich Faddeev and others).
The coefficients of the characteristic polynomial are determined recursively from the top down, by dint of the auxiliary matrices M2,
The calculator uses this algorithm to compute the coefficients. It can also output auxiliary matrix M for each step.