Characteristic Polynomial
Computes the characteristic polynomial (and the inverse of the matrix, if requested) using the Faddeew-Leverrier method.
charpoly(a, info = FALSE)
a |
quadratic matrix; size should not be much larger than 100. |
info |
logical; if true, the inverse matrix will also be reported. |
Computes the characteristic polynomial recursively. In the last step the determinant and the inverse matrix can be determined without any extra cost (if the matrix is not singular).
Either the characteristic polynomial as numeric vector, or a list with
components cp, the characteristic polynomial, det, the
determinant, and inv, the inverse matrix, will be returned.
Hou, S.-H. (1998). Classroom Note: A Simple Proof of the Leverrier–Faddeev Characteristic Polynomial Algorithm, SIAM Review, 40(3), pp. 706–709.
a <- magic(5) A <- charpoly(a, info = TRUE) A$cp roots(A$cp) A$det zapsmall(A$inv %*% a)
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.