Scribd
Upload
6 views14 pages

Linear Equations

Uploaded by

Mubiru Habiira
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views14 pages

Linear Equations

Uploaded by

Mubiru Habiira
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 14

KAMPALA Western Campus

INTERNATIONAL P.O Box 71, Bushenyi, Uganda


E-mail: [email protected]
UNIVERSITY

FACULTY OF SCIENCE AND TECHNOLOGY


DEPARTMENT OF BASIC SCIENCES
PROGRAM: BMS, BPH, BCM

COURSE UNIT: Applied Mathematics.


YEAR: ONE
SEMESTER: ONE

Module 3:
Linear Equations
Use of Cramer’s rule, use of calculators, Computers and Row
Reduction to echelon form
1.0 Objective.
By the end of this module, you should be able to solve the
system of linear equations with any of the methods listed
above.

1.1 Cramer’s Rule.


In linear algebra, Cramer's rule is an explicit formula for the
solution of a system of linear equations with as many
equations as unknowns, valid whenever the system has a
unique solution. It expresses the solution in terms of
the determinants of the (square) coefficient matrix and of
matrices obtained from it by replacing one column by the
column vector of right-hand-sides of the equations. It is
named after Gabriel Cramer (1704–1752), who published the
rule for an arbitrary number of unknowns in 1750.
KAMPALA Western Campus
INTERNATIONAL P.O Box 71, Bushenyi, Uganda
E-mail: [email protected]
UNIVERSITY

Colin Maclaurin also published special cases of the rule in


1748 (and possibly knew of it as early as 1729).

Cramer's rule implemented in a naïve way is computationally


inefficient for systems of more than two or three equations.

In the case of n equations in n unknowns, it requires


computation of n + 1 determinants, while Gaussian
elimination produces the result with the same computational
complexity as the computation of a single determinant.

Cramer's rule can also be numerically unstable even for 2×2


systems. However, it has recently been shown that Cramer's
rule can be implemented in O(n3) time, which is comparable to
more common methods of solving systems of linear equations,
such as Gaussian elimination (consistently requiring 2.5 times
as many arithmetic operations for all matrix sizes), while
exhibiting comparable numeric stability in most cases.

1.2 Mathematical Definition of Cramer’s Rule.

Given a system of linear equations below;

The ith component of the solution:


KAMPALA Western Campus
INTERNATIONAL P.O Box 71, Bushenyi, Uganda
E-mail: [email protected]
UNIVERSITY

Example 1
Use Cramer’s rule to find the solution of the following
system of equation;

Solution.
 First form the matrix containing the coefficients of the

variables. I.e. of the form;

Let

 Obtain the determinant of the formed matrix


Det

Det
Det
Det or

 Obtain the determinants of the corresponding


variables.
KAMPALA Western Campus
INTERNATIONAL P.O Box 71, Bushenyi, Uganda
E-mail: [email protected]
UNIVERSITY

For , replace the first column of matrix A ie

with the solution column, ie,

Therefore

Therefore,

For , replace the second column of matrix A ie

With the solution column, ie,

Therefore

Therefore,
KAMPALA Western Campus
INTERNATIONAL P.O Box 71, Bushenyi, Uganda
E-mail: [email protected]
UNIVERSITY

For ,replace the third column of matrix A ie

With the solution column, ie,

Therefore

Example 2
Use Cramer’s Rule to solve for values of and in the equations
below.

Solution.

Let

Det or

Solution Column is
KAMPALA Western Campus
INTERNATIONAL P.O Box 71, Bushenyi, Uganda
E-mail: [email protected]
UNIVERSITY
KAMPALA Western Campus
INTERNATIONAL P.O Box 71, Bushenyi, Uganda
E-mail: [email protected]
UNIVERSITY

2.1 Row Reduction to Echelon Form

In linear algebra, a matrix is in Echelon Form if it has the shape


resulting from a Gaussian elimination. All rows consisting of only
zeroes are at the bottom. the leading coefficient (also called the
pivot) of a nonzero row is always strictly to the right of the leading

coefficient of the row above it. i.e

Example 1
Using row reduction to echelon form, solve the system of linear
equations below.

Solution.
First extract the matrices by taking the coefficients of the
variables.

Eliminate the variables and bring the solution matrix close to


the coefficient matrix.
KAMPALA Western Campus
INTERNATIONAL P.O Box 71, Bushenyi, Uganda
E-mail: [email protected]
UNIVERSITY
Row
Row
Row

Row
Row
Row

Row
Row
Row

Row
Row
Row
KAMPALA Western Campus
INTERNATIONAL P.O Box 71, Bushenyi, Uganda
E-mail: [email protected]
UNIVERSITY

Row
Row
Row

Therefore, , and

Example 2
Using row reduction to echelon form, solve the system of linear
equations below.

Solution.
First extract the matrices by taking the coefficients of the
variables.

Eliminate the variables and bring the solution matrix close to


the coefficient matrix.
KAMPALA Western Campus
INTERNATIONAL P.O Box 71, Bushenyi, Uganda
E-mail: [email protected]
UNIVERSITY

Row
Row
Row

Row
Row
Row

Row
Row
Row

Row
Row
Row
KAMPALA Western Campus
INTERNATIONAL P.O Box 71, Bushenyi, Uganda
E-mail: [email protected]
UNIVERSITY

Row
Row
Row

Therefore, , and

Example 3.
Use Echelon Form to solve for values of and in the equations
below.

Solution

First extract the matrices by taking the coefficients of the


variables.
KAMPALA Western Campus
INTERNATIONAL P.O Box 71, Bushenyi, Uganda
E-mail: [email protected]
UNIVERSITY

Eliminate the variables and bring the solution matrix close to


the coefficient matrix.

Row
Row
Row

Row
Row
Row
KAMPALA Western Campus
INTERNATIONAL P.O Box 71, Bushenyi, Uganda
E-mail: [email protected]
UNIVERSITY

Row
Row

Row

Row
Row
Row

Row
Row
Row

At this point, bring back the variables in the equation.

Therefore, , and
KAMPALA Western Campus
INTERNATIONAL P.O Box 71, Bushenyi, Uganda
E-mail: [email protected]
UNIVERSITY

You might also like