Dog Breeds Information and More
  Komondor - Dog Breeds Facts and Information Dog Breeds Selector A to Z dog breeds Forums

 
Dog names
Dog training
Toy dogs
Intelligence
Dog health
Dog worship
Ticks

 
Golden Retriever
Labrador Retriever
Jack Russell
 
Find a Breed
 
Dog Breeds Encyclopedia
 

Toeplitz matrix

In the mathematical discipline of linear algebra, a Toeplitz matrix, named after Otto Toeplitz, or diagonal constant matrix is a special kind of matrix where each descending diagonal from left to right is constant. For instance, the following matrix is Toeplitz:

\begin{bmatrix} a & b & c & d & e \\ f & a & b & c & d \\ g & f & a & b & c \\ h & g & f & a & b \\ j & h & g & f & a  \end{bmatrix}.
Contents

Definition

A mxn matrix A of the form

A = \begin{bmatrix}   a_{0} & a_{-1} & a_{-2} & \ldots & \ldots  &a_{-n+1}  \\   a_{1} & a_0  & a_{-1} &  \ddots   &  &  \vdots \\   a_{2}    & a_{1} & \ddots  & \ddots & \ddots& \vdots \\   \vdots &  \ddots & \ddots &   \ddots  & a_{-1} & a_{-2}\\  \vdots &         & \ddots & a_{1} & a_{0}&  a_{-1} \\ a_{m-1} &  \ldots & \ldots & a_{2} & a_{1} & a_{0} \end{bmatrix}

is called a Toeplitz matrix. If the i,j element of A is denoted Ai,j, then we have

Ai,j = ai - j.

Properties

Generally, a matrix equation Ax = b has n equations to solve, but if A is Toeplitz, then the system has only 2n-1 degrees of freedom. One could therefore expect that solution of a Toeplitz system would therefore be easier. In fact, this property can be investigated by the transformation AUn - UmA, which has rank 2, when Uk is the down-shift operator. Specifically, we can by simple calculation show that

AU_n-U_mA= \begin{bmatrix} a_{-1} & \dots & a_{-n+1} & 0 \\        &       &          & -a_{-n+1} \\        &       &          & \vdots \\  0     &       &          & -a_{m-n-1} \end{bmatrix}

where empty places in the matrix are replaced by zeros.

Notes

These matrices have uses in computer science because it can be shown that the addition of two Toeplitz matrices can be done in O(n) time and the matrix multiplication of two Toeplitz matrices can be done in O(n log n) time. Toeplitz systems of form Ax = b can be solved by Levinson recursion.

They are also closely connected with Fourier series, because the multiplication operator by a trigonometric polynomial, compressed to a finite-dimensional space, can be represented by such a matrix.

If a Toeplitz matrix has the additional property that ai = ai + n, then it is a circulant matrix.

External link

Toeplitz and Circulant Matices: A Review, by R. M. Gray

The contents of this article are licensed from Wikipedia.org under the
GNU Free Documentation License. How to see transparent copy