Scribd
Upload
57 views3 pages

Main Types of Matrices

The document discusses different types of matrices including: 1) Diagonal matrices which have non-zero entries only on the main diagonal. 2) Triangular matrices which have either zero entries above (lower triangular) or below (upper triangular) the main diagonal. 3) Identity matrices which have 1s on the main diagonal and 0s elsewhere.

Uploaded by

vijay kumar honnali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
57 views3 pages

Main Types of Matrices

The document discusses different types of matrices including: 1) Diagonal matrices which have non-zero entries only on the main diagonal. 2) Triangular matrices which have either zero entries above (lower triangular) or below (upper triangular) the main diagonal. 3) Identity matrices which have 1s on the main diagonal and 0s elsewhere.

Uploaded by

vijay kumar honnali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Main types[edit]

Example with n =
Name
3

Diagonal matrix

Lower triangular
matrix

Upper triangular matrix

Diagonal and triangular matrix[edit]


If all entries of A below the main diagonal are zero, A is called an upper triangular matrix.
Similarly if all entries of A above the main diagonal are zero, A is called a lower triangular matrix.
If all entries outside the main diagonal are zero, A is called a diagonal matrix.
Identity matrix[edit]
Main article: Identity matrix
The identity matrix In of size n is the n-by-n matrix in which all the elements on the main
diagonal are equal to 1 and all other elements are equal to 0, for example,

It is a square matrix of order n, and also a special kind of diagonal matrix. It is called an
identity matrix because multiplication with it leaves a matrix unchanged:
AIn = ImA = A for any m-by-n matrix A.
A nonzero scalar multiple of an identity matrix is called a scalar matrix. If the matrix
entries come from a field, the scalar matrices form a group, under matrix multiplication,
that is isomorphic to the multiplicative group of nonzero elements of the field.
Symmetric or skew-symmetric matrix[edit]
A square matrix A that is equal to its transpose, that is, A = AT, is a symmetric matrix. If
instead, A is equal to the negative of its transpose, that is, A = −AT, then A is a skew-
symmetric matrix. In complex matrices, symmetry is often replaced by the concept
of Hermitian matrices, which satisfy A∗ = A, where the star or asterisk denotes
the conjugate transpose of the matrix, that is, the transpose of the complex
conjugate of A.
By the spectral theorem, real symmetric matrices and complex Hermitian matrices have
an eigenbasis; that is, every vector is expressible as a linear combination of
eigenvectors. In both cases, all eigenvalues are real.[27] This theorem can be generalized
to infinite-dimensional situations related to matrices with infinitely many rows and
columns, see below.
Invertible matrix and its inverse[edit]
A square matrix A is called invertible or non-singular if there exists a matrix B such that
AB = BA = In ,[28][29]
where In is the n×n identity matrix with 1s on the main diagonal and 0s elsewhere.
If B exists, it is unique and is called the inverse matrix of A, denoted A−1.
Definite matrix[edit]
Positive definite
Indefinite matrix
matrix

Points such that


Points such that

(Ellipse).
(Hyperbola).

A symmetric real matrix A is called positive-definite if the associated quadratic form


f (x) = xTA x
has a positive value for every nonzero vector x in Rn. If f (x) only yields negative
values then A is negative-definite; if f does produce both negative and positive
values then A is indefinite.[30] If the quadratic form f yields only non-negative
values (positive or zero), the symmetric matrix is called positive-semidefinite (or
if only non-positive values, then negative-semidefinite); hence the matrix is
indefinite precisely when it is neither positive-semidefinite nor negative-
semidefinite.
A symmetric matrix is positive-definite if and only if all its eigenvalues are
positive, that is, the matrix is positive-semidefinite and it is invertible. [31] The table
at the right shows two possibilities for 2-by-2 matrices.
Allowing as input two different vectors instead yields the bilinear
form associated to A:[32]
BA (x, y) = xTAy.
In the case of complex matrices, the same terminology and result apply,
with symmetric matrix, quadratic form, bilinear form,
and transpose xT replaced respectively by Hermitian matrix, Hermitian
form, sesquilinear form, and conjugate transpose xH.

You might also like