24/7 Pet Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Polynomial matrix - Wikipedia

    en.wikipedia.org/wiki/Polynomial_matrix

    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.

  3. Matrix polynomial - Wikipedia

    en.wikipedia.org/wiki/Matrix_polynomial

    A matrix polynomial identity is a matrix polynomial equation which holds for all matrices A in a specified matrix ring M n (R). Matrix polynomials are often demonstrated in undergraduate linear algebra classes due to their relevance in showcasing properties of linear transformations represented as matrices, most notably the Cayley–Hamilton ...

  4. Vandermonde matrix - Wikipedia

    en.wikipedia.org/wiki/Vandermonde_matrix

    Vandermonde matrix. In linear algebra, a Vandermonde matrix, named after Alexandre-Théophile Vandermonde, is a matrix with the terms of a geometric progression in each row: an matrix. with entries , the jth power of the number , for all zero-based indices and . [1] Some authors define the Vandermonde matrix as the transpose of the above matrix.

  5. Perron–Frobenius theorem - Wikipedia

    en.wikipedia.org/wiki/Perron–Frobenius_theorem

    Let = be an positive matrix: > for ,.Then the following statements hold. There is a positive real number r, called the Perron root or the Perron–Frobenius eigenvalue (also called the leading eigenvalue, principal eigenvalue or dominant eigenvalue), such that r is an eigenvalue of A and any other eigenvalue λ (possibly complex) in absolute value is strictly smaller than r, |λ| < r.

  6. Minimal polynomial (linear algebra) - Wikipedia

    en.wikipedia.org/wiki/Minimal_polynomial_(linear...

    Minimal polynomial (linear algebra) In linear algebra, the minimal polynomial μA of an n × n matrix A over a field F is the monic polynomial P over F of least degree such that P(A) = 0. Any other polynomial Q with Q(A) = 0 is a (polynomial) multiple of μA . The following three statements are equivalent : λ is a root of μA, λ is a root of ...

  7. Companion matrix - Wikipedia

    en.wikipedia.org/wiki/Companion_matrix

    Companion matrix. In linear algebra, the Frobenius companion matrix of the monic polynomial is the square matrix defined as. Some authors use the transpose of this matrix, , which is more convenient for some purposes such as linear recurrence relations (see below). is defined from the coefficients of , while the characteristic polynomial as ...

  8. Characteristic polynomial - Wikipedia

    en.wikipedia.org/wiki/Characteristic_polynomial

    Characteristic polynomial. In linear algebra, the characteristic polynomial of a square matrix is a polynomial which is invariant under matrix similarity and has the eigenvalues as roots. It has the determinant and the trace of the matrix among its coefficients. The characteristic polynomial of an endomorphism of a finite-dimensional vector ...

  9. Circulant matrix - Wikipedia

    en.wikipedia.org/wiki/Circulant_matrix

    Any circulant is a matrix polynomial (namely, the associated polynomial) in the cyclic permutation matrix : − − where is given by the companion matrix. The set of × circulant matrices forms an - dimensional vector space with respect to addition and scalar multiplication. This space can be interpreted as the space of functions on the cyclic ...