Matrices are essential tools for organizing and manipulating data in various professional fields across Kenya. Whether managing resource allocation in county government offices, analyzing financial transactions in SACCOs, or scheduling in hospitals, matrices provide a structured way to handle complex information. Mastery of matrix types and operations equips diploma-level students with the ability to solve practical problems involving multiple variables efficiently. This chapter focuses on understanding different matrix types and performing basic matrix operations up to order 3 by 3, fundamental for decision-making and data analysis in diverse sectors.

6.1 Matrices

A matrix is a rectangular arrangement of numbers in rows and columns, enclosed in brackets. Matrices are used to store data, to describe systems of linear equations and to model transformations, so they appear in circuit analysis, structural calculations, inventory records and computer graphics. The size of a matrix is written as rows × columns, so a matrix with 2 rows and 3 columns is a 2 × 3 matrix. This topic describes the main types of matrix, each with its special properties.

6.1.1 Types

Matrices are named by their shape and by the pattern of their elements. Recognising the type tells you which operations are possible and which shortcuts apply. Example: an electrical workshop records the number of three kinds of cable sold in each of four weeks, and the record forms a 4 × 3 matrix, while the totals for one week form a row matrix.

6.1.1.1 Row

A row matrix has only one row and any number of columns, so its size is 1 × n. It is used to hold one record with several attributes. Example: a technician records the resistance of four resistors in ohms as the 1 × 4 matrix:

[ 10  22  47  100 ]

• Size: A row matrix has size 1 × n.
• Use: It holds a single list of values, such as readings taken in turn.
• Multiplication: A 1 × n row matrix can be multiplied by an n × 1 column matrix to give a single number.
• Transpose: Turning a row matrix on its side gives a column matrix.
• Limitation: Two row matrices cannot be multiplied unless one is first transposed, because the inner sizes do not match.

6.1.1.2 Column

A column matrix has only one column and any number of rows, so its size is m × 1. It is used to hold a single quantity measured several times or for several items. Example: the number of units of a product sold on each of four days is written as the 4 × 1 matrix:

[ 12 ]
[ 18 ]
[ 15 ]
[ 20 ]

• Size: A column matrix has size m × 1.
• Use: It holds values of one variable over several periods or items.
• Vector form: In linear algebra a column matrix is a column vector.
• Multiplication: An m × 1 column matrix multiplied by a 1 × n row matrix gives an m × n matrix.
• Equations: In a system of equations the unknowns and the constants are written as column matrices.

6.1.1.3 Square

A square matrix has the same number of rows and columns, so its size is n × n. Determinants, inverses and traces are defined only for square matrices, so they are central to solving systems of equations. Example: three currents in a three-loop circuit lead to a 3 × 3 coefficient matrix:

[ 4  -1   0 ]
[-1   5  -2 ]
[ 0  -2   6 ]

• Size: The number of rows equals the number of columns, for example 2 × 2 or 3 × 3.
• Main diagonal: The elements running from the top left to the bottom right are the main diagonal.
• Determinant: Only a square matrix has a determinant.
• Inverse: Only a square matrix can have an inverse, and only when its determinant is not zero.
• Systems of equations: A system with as many equations as unknowns has a square coefficient matrix.

6.1.1.4 Zero

A zero matrix, also called a null matrix, has every element equal to zero, and it can be of any size. It plays the same role in matrix addition as the number zero does in ordinary addition. Example: a 2 × 3 zero matrix records no sales of three items on each of two days:

[ 0  0  0 ]
[ 0  0  0 ]

• Size: A zero matrix can be of any size, written 0 or O.
• Addition: Adding a zero matrix to any matrix of the same size leaves it unchanged.
• Multiplication: Multiplying any matrix by a zero matrix of compatible size gives a zero matrix.
• Subtraction: Subtracting a matrix from itself gives a zero matrix.
• Use: It is used to start a record before data are entered.

6.1.1.5 Identity

An identity matrix is a square matrix with 1 on the main diagonal and 0 everywhere else. It is written I, and it works like the number 1 in multiplication. Example: the 3 × 3 identity matrix is:

[ 1  0  0 ]
[ 0  1  0 ]
[ 0  0  1 ]

• Form: All diagonal elements are 1, and all other elements are 0.
• Multiplication: For any matrix A of compatible size, A × I = A and I × A = A.
• Size: It is always square, and the size is stated as I₂, I₃ and so on.
• Inverse: A matrix multiplied by its inverse gives the identity matrix.
• Special case: It is a diagonal matrix in which every diagonal element is 1.

6.1.1.6 Diagonal

A diagonal matrix is a square matrix in which all elements outside the main diagonal are zero. The diagonal elements themselves may be any numbers, including zero. Example: a matrix that scales three quantities by the factors 2, 5 and 3 is:

[ 2  0  0 ]
[ 0  5  0 ]
[ 0  0  3 ]

• Form: Only the main diagonal can hold non-zero elements.
• Determinant: It is the product of the diagonal elements, here 2 × 5 × 3 = 30.
• Multiplication: Multiplying two diagonal matrices of the same size gives a diagonal matrix whose elements are the products of the matching diagonal elements.
• Inverse: It exists when no diagonal element is zero, and its diagonal elements are the reciprocals of the originals.
• Relationship: The identity matrix and the square zero matrix are special diagonal matrices.

Chapter Summary

This chapter introduced matrices and their various types, including row, column, square, zero, identity, and diagonal matrices, each serving specific roles in engineering computations. It then covered matrix operations such as addition, subtraction, and multiplication for matrices up to size 3 by 3, emphasizing the step-by-step procedures essential for handling engineering data. The concept of the inverse of a matrix was explored in detail, beginning with the calculation of the determinant, followed by the transpose and adjoint, leading to the determination of the inverse matrix. These foundational tools were applied to solve systems of simultaneous linear equations involving up to three variables using three methods: the inverse method, Cramer's rule, and row reduction. Through these methods, students learned to efficiently solve engineering problems involving multiple unknowns. The chapter combined theoretical understanding with practical calculation techniques to build competence in manipulating matrices for real-world engineering scenarios.