Matrices: types & basic operations

Introduction

Matrices provide a compact way to represent and manipulate systems of linear equations, transformations, and data. In engineering mathematics, matrices are essential tools for expressing rotations, solving simultaneous equations, representing linear maps, and handling numerical algorithms.


Definition of a Matrix

A matrix is a rectangular arrangement of numbers written in rows and columns.
An m × n matrix has m rows and n columns.

Example of a 3 × 3 matrix:

 A = \begin{bmatrix} a_{11} & a_{12} & a_{13} \\ a_{21} & a_{22} & a_{23} \\ a_{31} & a_{32} & a_{33} \end{bmatrix}

Each element is denoted by a_{ij}, meaning row i, column j.


Types of Matrices

Row Matrix

A matrix with one row.

 \begin{bmatrix} a_1 & a_2 & a_3 \end{bmatrix}

Column Matrix

A matrix with one column.

 \begin{bmatrix} a_1 \\ a_2 \\ a_3 \end{bmatrix}

Square Matrix

A matrix with an equal number of rows and columns (n × n).

Diagonal Matrix

A square matrix where all off-diagonal elements are zero.

 \begin{bmatrix} d_1 & 0 & 0 \\ 0 & d_2 & 0 \\ 0 & 0 & d_3 \end{bmatrix}

Scalar Matrix

A diagonal matrix with all diagonal elements equal.

 \begin{bmatrix} k & 0 & 0 \\ 0 & k & 0 \\ 0 & 0 & k \end{bmatrix}

Identity Matrix

A special scalar matrix with 1 on the diagonal.

 I = \begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{bmatrix}

Zero (Null) Matrix

All elements are zero.

 O = \begin{bmatrix} 0 & 0 \\ 0 & 0 \end{bmatrix}

Upper and Lower Triangular Matrices

Upper triangular: elements below main diagonal are zero.

 \begin{bmatrix} a_{11} & a_{12} & a_{13} \\ 0 & a_{22} & a_{23} \\ 0 & 0 & a_{33} \end{bmatrix}

Lower triangular: elements above diagonal are zero.

Symmetric Matrix

A square matrix where a_{ij} = a_{ji}.

Skew-Symmetric Matrix

a_{ij} = -a_{ji}, and diagonal elements are zero.

Orthogonal Matrix

A matrix whose transpose equals its inverse:

 Q^T Q = I

These represent pure rotations (common in aerospace dynamics).


Basic Matrix Operations

Matrix Addition

Two matrices can be added only if they have the same dimensions.

If

 A = \begin{bmatrix} a_{11} & a_{12} \\ a_{21} & a_{22} \end{bmatrix} \quad \text{and} \quad B = \begin{bmatrix} b_{11} & b_{12} \\ b_{21} & b_{22} \end{bmatrix}

then

 A + B = \begin{bmatrix} a_{11}+b_{11} & a_{12}+b_{12} \\ a_{21}+b_{21} & a_{22}+b_{22} \end{bmatrix}

Scalar Multiplication

Multiply every entry by the scalar:

 kA = \begin{bmatrix} ka_{11} & ka_{12} \\ ka_{21} & ka_{22} \end{bmatrix}


Matrix Multiplication

Matrix multiplication is defined when the number of columns of the first matrix equals the number of rows of the second.

If A is (m × n) and B is (n × p), then AB is (m × p).

Example:

 A = \begin{bmatrix} a_{11} & a_{12} \\ a_{21} & a_{22} \end{bmatrix} ,\quad B = \begin{bmatrix} b_{11} & b_{12} \\ b_{21} & b_{22} \end{bmatrix}

Then:

 AB = \begin{bmatrix} a_{11}b_{11} + a_{12}b_{21} & a_{11}b_{12} + a_{12}b_{22} \\ a_{21}b_{11} + a_{22}b_{21} & a_{21}b_{12} + a_{22}b_{22} \end{bmatrix}

Important Properties

Matrix multiplication is:

  • Not commutative:
    AB \neq BA (in general)
  • Associative:

A(BC) = (AB)C

Distributive:

A(B+C) = AB + AC


Transpose of a Matrix

The transpose of A, written as A^T, is obtained by interchanging rows and columns.

 A = \begin{bmatrix} a & b \\ c & d \\ e & f \end{bmatrix} \quad\Rightarrow\quad A^T = \begin{bmatrix} a & c & e \\ b & d & f \end{bmatrix}


Determinant of a Matrix

For a 2 × 2 matrix:

 \det(A) = \begin{vmatrix} a & b \\ c & d \end{vmatrix} = ad - bc

For a 3 × 3 matrix:

 \det(A) = \begin{vmatrix} a_{11} & a_{12} & a_{13} \\ a_{21} & a_{22} & a_{23} \\ a_{31} & a_{32} & a_{33} \end{vmatrix}

A matrix is invertible only if its determinant is non-zero.


Inverse of a Matrix

The inverse of A is denoted A^{-1} and satisfies:

 A A^{-1} = I

It exists only when \det(A) \neq 0.


Conclusion

Matrices form the backbone of linear algebra. Understanding types of matrices and operations like addition, multiplication, transpose, and determinant lays the foundation for advanced topics such as solving systems of equations, eigenvalues, eigenvectors, and transformations—topics essential for engineering fields including aerospace.

Shopping Cart
Scroll to Top