PRACTICAL MATHEMATICS

Simultaneous Linear Equations

Contents

  1. Basic Examples with Two Unknowns
  2. Gaussian Elimination
  3. General Theory
  4. Example Using the General Theory

Basic Examples with Two Unknowns

In the simultaneous equations

a11x1 + a12x2 = b1
a21x1 + a22x2 = b2,

x1 and x2 are the unknowns, a11, a12, a21 and a22 are given numbers called the coefficients, and b1 and b2 are given numbers on the right sides of the equations. A pair of values for x1 and x2 which make both equations true at the same time is called a solution of the equations.

The examples below show that the pair of equations may have

The number of solutions depends on the values of a11, a12, a21, a22, b1 and b2. If the equations have one unique solution, a quick method of calculating it is by means of the formulas:

x1 = (a22b1 - a12b2)/(a11a22 - a12a21)
x2 = (-a21b1 + a11b2)/(a11a22 - a12a21)

The expression (a11a22 - a12a21) is called the determinant of the system of equations. If the determinant is zero, then the above formulas cannot be used and the equations have either infinite many solutions or no solution.

If b1 and b2 are both zero, the pair of equations is called homogeneous. If b1 and b2 are not both zero, the pair of equations is called non-homogeneous.

Example 1: Non-Homogeneous Equations with One Solution

x1 + x2 = 1
x1 - x2 = 0
Fig. 1.

There is one unique solution x1 = 1/2, x2 = 1/2, at the point where the two graphs intersect.

Example 2: Homogeneous Equations with One Solution

x1 + x2 = 0
x1 - x2 = 0
Fig. 2.

There is one unique solution, the trivial solution x1 = 0, x2 = 0, at the origin where the two graphs intersect.

Example 3: Non-Homogeneous Equations with Infinitely Many Solutions

x1 + x2 = 1
2x1 + 2x2 = 2
Fig. 3.

There are infinitely many solutions because the two equations are represented by the same graph. Every point on the graph is a solution.

Example 4: Homogeneous Equations with Infinitely Many Solutions

x1 + x2 = 0
2x1 + 2x2 = 0
Fig. 4.

There are infinitely many non-trivial solutions because the two equations are represented by the same graph through the origin. Every point on the graph is a solution.

Example 5: Inconsistent Equations.

x1 + x2 = 1
x1 + x2 = 0
Fig. 5.

There is no solution because the two graphs are parallel; they have no point of intersection.

Gaussian Elimination

Gaussian elimination is a practical method of solving simultaneous linear equations. It is easy to see from the results of this method whether the equations are consistent or inconsistent, and whether consistent equations have one unique solution or infinitely many solutions.

The following examples show the method.

Example: Three Equations and Four Unknowns

3x1 + 2x2 + 2x3 - 5x4 = 8
0.6x1 + 1.5x2 + 1.5x3 - 5.4x4 = 2.7
1.2x1 - 0.3x2 - 0.3x3 + 2.4x4 = 2.1

Use the first equation to eliminate x1 from the second and third equations as follows:

3x1 + 2x2 + 2x3 - 5x4 = 8
0x1 + 1.1x2 + 1.1x3 - 4.4x4 = 1.1
0x1 - 1.1x2 - 1.1x3 + 4.4x4 = -1.1

Use the second equation to eliminate x2 from the third equation.

3x1 + 2x2 + 2x3 - 5x4 = 8
0x1 + 1.1x2 + 1.1x3 - 4.4x4 = 1.1
0x1 + 0x2 + 0x3 - 0x4 = 0

No more eliminations are possible. The last equation is reduced to the true numerical statement

0 = 0.

This shows that the equations are consistent. Since the number of equations is less than the number of unknowns, there are infinitely many solutions. For example, we can give any numbers we choose to x3 and x4. Then the second equation gives x2, and (using this value of x2) the first equation gives x1.

Example: Inconsistent Equations

3x1 + 2x2 + 2x3 - 5x4 = 8
0.6x1 + 1.5x2 + 1.5x3 - 5.4x4 = 2.7
1.2x1 - 0.3x2 - 0.3x3 + 2.4x4 = 2.0

These equations are the same as the equations in the above example except that the right side of the third equation is 2.0 instead of 2.1. After the Gaussian elimination method has been done we get

3x1 + 2x2 + 2x3 - 5x4 = 8
0x1 + 1.1x2 + 1.1x3 - 4.4x4 = 1.1
0x1 + 0x2 + 0x3 - 0x4 = -0.1

The last equation is reduced to the false numerical statement

0 = -0.1

This shows that the equations are inconsistent, and that the equations have no solution.

EXERCISES

Solve the following sets of simultaneous linear equations.

Exercise 1: 4x - 3y + z = 11
2x + y - 4z = -1
x + 2y - 2z = 1
Exercise 2: 4x - 3y + z = 0
2x + y - 4z = 0
x + 2y - 2z = 0
Exercise 3: x + 5y + 3z = 0
2x + 7y + 4z = 0
x + 2y + z = 0
Exercise 4: x + 5y + 3z = 1
2x + 7y + 4z = 2
x + 2y + z = 3
Exercise 5: x + 5y + 3z = 1
2x + 7y + 4z = 4
x + 2y + z = 3

General Theory

Suppose we have m simultaneous equations with n unknowns:

a11x1 + ... + a1nxn = b1
...   ...   ...   ...
am1x1 + ... + amnxn = bm

Inconsistent Equations

If the Gaussian elimination method produces a false numerical statement 0 = c, where c is not zero, then the equations are inconsistent and there is no solution.

One Unique Solution

If the equations are consistent and the Gaussian elimination method produces exactly n non-zero equations, then the simultaneous equations have one unique solution.

Infinitely Many Solutions

If the equations are consistent and the Gaussian elimination method produces r non-zero equations, where r < n, then r unknowns are determined in terms of the remaining n - r unknowns. These remaining n - r unknowns can be given any chosen values.

The number r of non-zero equations produced by the Gaussian elimination method is called the rank of the system of equations.

Homogeneous Equations (b1 = 0, ..., bm = 0)

If the equations are homogeneous, then there is a trivial solution x1 = 0, ..., xn = 0. There are non-trivial solutions if and only if r < n; then there are exactly n - r linearly independent non-trivial solutions

(x1(1), ..., xn(1)), ..., (x1(n-r), ..., xn(n-r)).

The general solution of a homogeneous system with r < n is a linear combination of these solutions:

x1 = c1x1(1) + ... + cn-rx1(n-r)
...   ...   ...   ...
xn = c1xn(1) + ... + cn-rxn(n-r)

where the coefficients c1, ..., cn-r can be given any values we choose.

Example Using the General Theory

3x1 + 2x2 + 2x3 - 5x4 = 8
0.6x1 + 1.5x2 + 1.5x3 - 5.4x4 = 2.7
1.2x1 - 0.3x2 - 0.3x3 + 2.4x4 = 2.1

As shown above, Gaussian elimination reduces these equations to:

3x1 + 2x2 + 2x3 - 5x4 = 8
0x1 + 1.1x2 + 1.1x3 - 4.4x4 = 1.1

A particular solution, obtained by putting x3 = 0 and x4 = 0, is

x1 = 2, x2 = 1, x3 = 0, x4 = 0.

The complementary homogeneous equations with the same coefficients as the original equations are:

3x1 + 2x2 + 2x3 - 5x4 = 0
0.6x1 + 1.5x2 + 1.5x3 - 5.4x4 = 0
1.2x1 - 0.3x2 - 0.3x3 + 2.4x4 = 0

Gaussian elimination reduces these equations to:

3x1 + 2x2 + 2x3 - 5x4 = 0
0x1 + 1.1x2 + 1.1x3 - 4.4x4 = 0

Since r = 2 and n = 4, we have r < n. Since n - r = 2, it follows that there exist exactly 2 linearly independent solutions. For example, by putting x3(1) = 1, x4(1) = 0, and x3(2) = 0, x4(2) = 1, we get:

x1(1) = 0, x2(1) = -1, x3(1) = 1, x4(1) = 0,
x1(2) = -1, x2(2) = 4, x3(2) = 0, x4(2) = 1.

This gives the general solution of the homogeneous equations as follows:

x1 = c1.0 + c2.(-1) = -c2
x2 = c1.(-1) + c2.4 = -c1 + 4c2
x3 = c1.1 + c2.0 = c1
x4 = c1.0 + c2.1 = c2

The general solution of the complementary homogeneous equations is also called the complementary solution of the original non-homogeneous equations. The general solution of the original non-homogeneous equations is:

General Solution = Particular Solution + Complementary Solution

In this example the general solution of the original non-homogeneous equations is therefore:

x1 = 2 - c2
x2 = 1 - c1 + 4c2
x3 = 0 + c1
x4 = 0 + c2

By R. H. B. Exell, 2001. King Mongkut's University of Technology Thonburi.
Back to Home Page