Solution of Simultaneous Linear Algebraic Equations

Definition

A system of simultaneous linear algebraic equations is a set of two or more linear equations involving the same variables (e.g., $x, y, z$) that must all be satisfied simultaneously. The objective of solving these systems numerically is to find the values of the variables that satisfy all equations in the set, typically expressed in the matrix form $AX = B$.

Main Content

1. Direct Methods

Direct methods, such as Gaussian Elimination, provide an exact solution to the system in a finite number of steps, assuming no round-off errors occur.
These methods involve transforming the system into an upper triangular matrix form, making it easy to solve via back substitution.

2. Iterative Methods

Iterative methods, such as Jacobi or Gauss-Seidel, start with an initial guess and refine the solution through repeated cycles until the result converges to a desired accuracy.
These are particularly useful for very large, sparse systems where direct methods might be computationally expensive or lead to memory overflow.

3. Matrix Representation

A system of linear equations can be represented as $AX = B$, where $A$ is the coefficient matrix, $X$ is the column vector of unknowns, and $B$ is the constants vector.
Visualizing this in a grid structure helps in applying row operations:

| a11  a12  a13 |   | x |   | b1 |
| a21  a22  a23 | * | y | = | b2 |
| a31  a32  a33 |   | z |   | b3 |

Working / Process

1. Augmented Matrix Formation

Arrange the coefficients and constant terms into a single augmented matrix $[A|B]$.
Ensure that the equations are aligned in the same variable order (e.g., all $x$ terms in the first column, $y$ in the second, etc.).

2. Elimination Process

Use elementary row operations (swapping rows, multiplying rows by constants, or adding multiples of rows) to transform the coefficient matrix into an Upper Triangular form.
This creates a staircase pattern of zeros below the main diagonal, simplifying the calculation of the last variable.

| 1  a  b | d |  (Row 1)
| 0  1  c | e |  (Row 2)
| 0  0  1 | f |  (Row 3)

3. Back Substitution

Once the matrix is in upper triangular form, start from the last row (which now represents a single variable equation) to find the value of the last variable.
Substitute this known value into the row above it to solve for the next variable, continuing upward until all unknowns are determined.

Advantages / Applications

Civil Engineering: Calculating forces and moments in structural frameworks and trusses.
Electrical Engineering: Solving for currents and voltages in complex circuit networks using Kirchhoff's laws.
Data Science: Used in linear regression models to find optimal parameters that fit a set of data points.

Summary

Simultaneous linear equations find the intersection point of multiple linear constraints.
Direct methods yield exact results, while iterative methods approach the solution through successive approximations.
Key terms to remember: Augmented Matrix, Pivoting, Back Substitution, Convergence, and Coefficient Matrix.
A system is solvable when it has a unique solution, infinite solutions, or no solution depending on the consistency of the equations.