A univariate polynomial matrix P of degree p is defined as:
where denotes a matrix of constant coefficients, and is non-zero. Thus a polynomial matrix is the matrix-equivalent of a polynomial, with each element of the matrix satisfying the definition of a polynomial of degree p.
An example 3×3 polynomial matrix, degree 2:
- A polynomial matrix over a field with determinant equal to a non-zero element of that field is called unimodular, and has an inverse that is also a polynomial matrix. Note that the only scalar unimodular polynomials are polynomials of degree 0 – nonzero constants, because an inverse of an arbitrary polynomial of higher degree is a rational function.
- The roots of a polynomial matrix over the complex numbers are the points in the complex plane where the matrix loses rank.
Note that polynomial matrices are not to be confused with monomial matrices, which are simply matrices with exactly one non-zero entry in each row and column.
If by λ we denote any element of the field over which we constructed the matrix, by I the identity matrix, and we let A be a polynomial matrix, then the matrix λI − A is the characteristic matrix of the matrix A. Its determinant, |λI − A| is the characteristic polynomial of the matrix A.
- E.V.Krishnamurthy, Error-free Polynomial Matrix computations, Springer Verlag, New York, 1985
|This linear algebra-related article is a stub. You can help Wikipedia by expanding it.|