Matrices and Determinants:

Square matrix:
-A square matrix is a matrix with the same number of rows and columns. - A square matrix A is called invertible or non-singular if there exists a matrix B such that AB = BA= In, where B = A1 -A square matrix is singular if and only if its determinant is 0.

Symmetric Matrix:
-A symmetric matrix is a square matrix that is equal to its transpose. Let A be a symmetric matrix. Then:

-. For every symmetric real matrix A there exists a real orthogonal matrix Q such that D = QTAQ is a diagonal matrix. -Every real symmetric matrix is Hermitian, and therefore all its eigenvalues are real. -If A1 exists, it is symmetric if and only if A is symmetric. -If A2 is symmetric if A is symmetric or skew-Symmetric. - A symmetric n n matrix is determined by n(n + 1)/2 scalars (the number of entries on or above the main diagonal).

Orthogonal Matrix:
-An orthogonal matrix is a square matrix whose transpose is equal to its inverse: AT = A-1 which entails ATA = AAT = I where I is the identity matrix.

-The determinant of any orthogonal matrix is +1 or 1.

- The determinant of any orthogonal matrix is +1 if all the eigenvalues are positive. -If is an eigen value of an orthogonal matrix then 1/ is an eigen value.

Diagonal Matrix:
-A diagonal matrix is a matrix (usually a square matrix) in which the entries outside the main diagonal () are all zero. For example, the following matrix is diagonal:

-Any square diagonal matrix is also a symmetric matrix.

-The eigenvalues of diagonal matrix are the first row elements.

Hermitian Matrix :
- An Hermitian matrix (or self-adjoint matrix) is a square matrix with complex entries that is equal to its own conjugate transpose that is,

- For example,

- The entries on the main diagonal (top left to bottom right) of any Hermitian matrix are necessarily real. - A matrix that has only real entries is Hermitian if and only if it is a symmetric matrix. - The product of two Hermitian matrices A & B will only be Hermitian if they commute, i.e., if AB = BA. - An is Hermitian if A is Hermitian and n is an integer.

Nilpotent matrix :
-A nilpotent matrix is a square matrix A such that An=0 for some positive integer n (degree of A).

Skew-symmetric matrix :
-A skew-symmetric (or antisymmetric or antimetric]) matrix is a square matrix A whose transpose is also its negative; that is, it satisfies the equation A = AT - For example, the following matrix is skew-symmetric:

- All main diagonal entries of a skew-symmetric matrix must be zero, so the trace is zero. - If A = (aij) is skew-symmetric, aij = aji; hence aii = 0.

Skew-Hermitian matrix :
-A square matrix with complex entries is said to be skew-Hermitian or antihermitian if its conjugate transpose is equal to its negative.

where

denotes the conjugate transpose of a matrix. In component form, this means that

for all i and j, where ai,j is the i,j-th entry of A, and the overline denotes complex conjugation. -The eigenvalues of a skew-Hermitian matrix are all purely imaginary. -All entries on the main diagonal of a skew-Hermitian matrix have to be pure imaginary (the number zero is also considered purely imaginary).

Transpose of Matrix:
-The transpose of a matrix A is another matrix AT (also written A, Atr or At) created by any one of the following equivalent actions: reflect A over its main diagonal (which runs top-left to bottom-right) to obtain AT write the rows of A as the columns of AT write the columns of A as the rows of AT -Formally, the (i,j) element of AT is the (j,i) element of A.

Properties:
For matrices A, B and scalar c we have the following properties of transpose:

Taking the transpose is an involution (self inverse).

The transpose respects addition.

Note that the order of the factors reverses. From this one can deduce that a square T 1 T T 1 matrix A is invertible if and only if A is invertible, and in this case we have (A ) = (A ) . By induction this result extends to the general case of multiple matrices, where we find that (A1A2...Ak-1Ak)T = AkTAkT T T 1 ... A2 A1 .

The transpose of a scalar is the same scalar. Together with (2), this states that the transpose is a linear map from the space of m n matrices to the space of all n m matrices.

The determinant of a square matrix is the same as that of its transpose. The dot product of two column vectors a and b can be computed as

which is written as aibi in Einstein notation. If A has only real entries, then ATA is a positive-semidefinite matrix.

The transpose of an invertible matrix is also invertible, and its inverse is the transpose of the inverse of the original matrix. The notation AT is often used to represent either of these equivalent expressions. If A is a square matrix, then its eigenvalues are equal to the eigenvalues of its transpose.

Special transpose matrices:

-A square matrix whose transpose is equal to itself is called a symmetric matrix; that is, A is symmetric if

-A square matrix whose transpose is equal to its negative is called skew-symmetric matrix; that is, A is skew-symmetric if

-For a square matrix A, A+AT is a Symmetric Matrix. - For a square matrix A, A-AT is a skew-Symmetric Matrix.

-A square matrix whose transpose is also its inverse is called an orthogonal matrix; that is, A is
orthogonal if AA = A A = In
T T

the identity matrix, i.e. A = A .