The characteristic polynomial condenses a matrix's essential properties into a single expression. For a matrix , it is defined as . The roots of this polynomial are the eigenvalues, the scalars that scale eigenvectors. Eigenvalues capture fundamental behaviors in systems of differential equations, vibrations, and Markov processes. Understanding the characteristic polynomial thus reveals whether solutions grow, decay, or oscillate.
The coefficients of the characteristic polynomial relate directly to invariants of . For a 2Γ2 matrix, the polynomial is . Here denotes the trace and the determinant. For a 3Γ3 matrix, the cubic includes as well. These relationships allow one to derive eigenvalue sums and products without directly solving the polynomial.
Augustin-Louis Cauchy and others studied matrices via determinants in the nineteenth century, leading to the notion of the characteristic equation. The CayleyβHamilton theorem, proved in the 1850s, states that every matrix satisfies its own characteristic polynomial. This surprising fact provides a route to compute matrix functions and proves fundamental in control theory and beyond.
Take . The trace is . The determinant is . Evaluating the determinant of gives . Solving this cubic yields eigenvalues , , and .
By inputting the matrix coefficients, this calculator automates these steps, computing the polynomial coefficients and presenting them in a readable format. For larger systems, the characteristic polynomial can guide numerical methods like the QR algorithm. In control engineering, the roots indicate system stability through their location in the complex plane. In quantum mechanics, the characteristic polynomials of operators correspond to measurable observables. The polynomial thus bridges theoretical and applied disciplines.
Because the characteristic polynomial is a determinant, its coefficients are symmetric functions of the eigenvalues. This symmetry means that permuting eigenvalues leaves the polynomial unchanged, reflecting the underlying algebraic multiplicities. Additionally, knowing the characteristic polynomial allows computation of the matrix's minimal polynomial, which in turn reveals the size of Jordan blocks. Working through examples with this calculator provides intuition for these subtle relationships.
Compute the Walsh-Hadamard transform of a sequence using a fast butterfly algorithm.
Explore Stokes theorem on the unit disk with a custom vector field. Compute the line integral around the boundary and the surface integral of the curl.
Compute the discrete convolution of two finite sequences for signal processing and probability.