Frobenius normal form Guide, Meaning , Facts, Information and Description

In linear algebra, the Frobenius normal form of a matrix is a normal form that reflects the structure of the minimal polynomial of a matrix.

The idea of the companion matrix of a polynomial demonstrates this relationship to some extent. If one has the companion matrix C of a polynomial p, the characteristic polynomial of C is p. But polynomials can of course be factored. Can the companion matrix then be simplified to reflect this fact? Yes it can, and this is where the Frobenius normal form aids us.

Given an arbitrary matrix, we can calculate block matrices which are companion matrices, each of which correspond to factors of the minimal polynomial. These blocks can be put together to create the Frobenius normal form.

The coefficients of the factors of the minimal polynomial become entries in the Frobenius normal form in a similar fashion to the companion matrix. Where the minimal polynomial is identical to the characteristic polynomial, the Frobenius normal form is the companion matrix of the characteristic polynomial. This fact has an important consequence. Since the matrix consists of elements from some field, and the characteristic polynomial consists of elements from the matrix, and the Frobenius normal form contains elements that are coefficients of the characteristic polynomial, then the Frobenius normal form is not constrained to the complexes as the Jordan normal form is, another normal form that is commonly used. This leads to the alternate name for this form, the rational canonical form (for example, if the matrix was over Q).

The Frobenius normal form F of a matrix A is generally calculated by means of a similarity transformation. What this implies is that there is an invertible matrix P so P^-1AP=F. Since every matrix has a characteristic polynomial, then every matrix can be transformed by a similarity transformation to its Frobenius normal form.

Table of contents

1 Motivating example 2 General case 3 External links 3.1 Algorithms

Motivating example

For example, consider:

The characteristic polynomial of A is x⁶+6x⁴+12x²+8 = (x² +2 )³ = p(x). The minimal polynomial of this matrix is x² +2 .

We will then have one block in the Frobenius normal form as

The characteristic polynomial of A₁ is indeed x² +2.

Since p factors into solely x² +2 terms, we expect the other two blocks comprising the normal form of the matrix to be identical to A₁. So, we can simply write down the Frobenius normal form:

The characteristic and minimal polynomials of F are the same to that of A, which we would expect, since F can be obtained via a similarity transformation P⁻¹AP=F, and determinants are similarity invariant. For this matrix A, P is

General case

In general, if M is some n×n matrix, there is an invertible matrix P such that P⁻¹MP=F where

where the M_is are the companion matrices of what are known as the invariant polynomials of M. If M_i is the companion matrix of a polynomial f_i(x), and the characteristic polynomial of M is p(x), then

Each f_i divides f_i+1, if one writes the companion matrices M_i such that as i increases, so does the number of rows/columns of M_i. The polynomial f_t then is the minimal polynomial of M.

External links

• Rational Canonical Form (Mathworld)

Algorithms

• An O(n³) Algorithm for Frobenius Normal Form
• An Algorithm for the Frobenius Normal Form (pdf)
• A rational canonical form Algorithm (pdf)

This is an Article on Frobenius normal form. Page Contains Information, Facts Details or Explanation Guide About Frobenius normal form

	Web www.E-paranoids.com