<?xml version="1.0" encoding="UTF-8"?>

<record version="9" id="1483">
 <title>triangular matrix</title>
 <name>TriangularMatrix</name>
 <created>2002-01-16 07:46:11</created>
 <modified>2007-04-19 12:22:47</modified>
 <type>Definition</type>
<parent id="2464">matrix</parent>
 <creator id="1863" name="Wkbj79"/>
 <author id="1863" name="Wkbj79"/>
 <author id="2" name="akrowne"/>
 <classification>
	<category scheme="msc" code="15-00"/>
	<category scheme="msc" code="65-00"/>
 </classification>
 <defines>
	<concept>upper triangular</concept>
	<concept>lower triangular</concept>
	<concept>upper triangular matrix</concept>
	<concept>lower triangular matrix</concept>
	<concept>right triangular</concept>
	<concept>right triangular matrix</concept>
	<concept>left triangular</concept>
	<concept>left triangular matrix</concept>
 </defines>
 <preamble>\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}

%\usepackage{psfrag}
%\usepackage{graphicx}
%\usepackage{xypic}</preamble>
 <content>\PMlinkescapeword{even}

\section{Triangular Matrix}

Let $n$ be a positive integer.

An \emph{upper triangular matrix} is of the form:

$$ \begin{bmatrix}
a_{11} &amp; a_{12} &amp; a_{13} &amp; \cdots &amp; a_{1n} \\
   0   &amp; a_{22} &amp; a_{23} &amp; \cdots &amp; a_{2n} \\
   0   &amp;   0    &amp; a_{33} &amp; \cdots &amp; a_{3n} \\
\vdots &amp; \vdots &amp; \vdots &amp; \ddots &amp; \vdots \\
   0   &amp;   0    &amp;    0   &amp; \cdots &amp; a_{nn}
\end{bmatrix} $$

An upper triangular matrix is sometimes also called \emph{right triangular}.

A \emph{lower triangular matrix} is of the form:

$$ \begin{bmatrix}
a_{11} &amp;   0    &amp;   0    &amp; \cdots &amp;    0   \\
a_{21} &amp; a_{22} &amp;   0    &amp; \cdots &amp;    0   \\
a_{31} &amp; a_{32} &amp; a_{33} &amp; \cdots &amp;    0   \\
\vdots &amp; \vdots &amp; \vdots &amp; \ddots &amp; \vdots \\
a_{n1} &amp; a_{n2} &amp; a_{n3} &amp; \cdots &amp; a_{nn} 
\end{bmatrix} $$

A lower triangular matrix is sometimes also called \emph{left triangular}.

Note that upper triangular matrices and lower triangular matrices must be square matrices.

A \emph{triangular matrix} is a matrix that is an upper triangular matrix or lower triangular matrix.  Note that some matrices, such as the identity matrix, are both upper and lower triangular.  A matrix is upper and lower triangular simultaneously if and only if it is a diagonal matrix.

Triangular matrices allow numerous algorithmic shortcuts in many situations. For example, if $A$ is an $n\times n$ triangular matrix, the equation $Ax=b$ can be solved for $x$ in at most $n^2$ operations.

In fact, triangular matrices are so useful that much computational linear algebra begins with factoring (or decomposing) a general matrix or matrices into triangular form.  Some matrix factorization methods are the Cholesky factorization and the LU-factorization. Even including the factorization step, enough later operations are typically avoided to yield an overall time savings.

\section{Properties}

Triangular matrices have the following properties (\PMlinkescapetext{prefix} ``triangular'' with either ``upper'' or ``lower'' uniformly):

\begin{itemize}
\item The inverse of a triangular matrix is a triangular matrix.
\item The product of two triangular matrices is a triangular matrix.
\item The determinant of a triangular matrix is the product of the diagonal elements.
\item The eigenvalues of a triangular matrix are the diagonal elements.
\end{itemize}

The last two properties follow easily from the cofactor expansion of the triangular matrix.</content>
</record>
