Scribd
Upload
46 views

Topic Numarical Lasd A

The document discusses the elimination of unknowns method for solving linear algebraic equations. It involves combining equations in a way that eliminates one unknown, resulting in a single equation that can be solved. This value is then substituted back into the original equations to solve for the other unknowns. Specifically, it involves: 1) Multiplying equations by constants to eliminate a term when the equations are combined 2) Extending the method to systems with more than two equations by repeatedly eliminating unknowns from the modified equations 3) Resulting in an upper triangular system of equations that can be directly solved to find each unknown value step-by-step.

Uploaded by

MR.MUSAAB ALMAIDAN
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
46 views

Topic Numarical Lasd A

The document discusses the elimination of unknowns method for solving linear algebraic equations. It involves combining equations in a way that eliminates one unknown, resulting in a single equation that can be solved. This value is then substituted back into the original equations to solve for the other unknowns. Specifically, it involves: 1) Multiplying equations by constants to eliminate a term when the equations are combined 2) Extending the method to systems with more than two equations by repeatedly eliminating unknowns from the modified equations 3) Resulting in an upper triangular system of equations that can be directly solved to find each unknown value step-by-step.

Uploaded by

MR.MUSAAB ALMAIDAN
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/ 4

LINEAR ALGEBRAIC EQUATIONS

c) The Elimination of Unknowns:

Removing unknowns by combining equations is an algebraic approach that can be shown for
two sets of equations.

For a set of two equations:


a11x1 + a12x2 = b1
a21x1 + a22x2 = b2
The simple strategy is to multiply the equations by the constants, so that one of the unknowns
will get out of the equations when the two equations are combined, which results a single
equation. The single equation can be solved for the remaining unknown.
This value can then be substituted for any of the original equations to calculate the other
variable.

Multiply first equation by the coefficient of x1, a21 and second equation by the coefficient of
x1, a11 to eliminate the first term, x1:
a11a21x1 + a12a21x2 = b1a21
a21a11x1 + a22a11x2 = b2a11

Subtract first equation from second equation to eliminate the first term, x1:
a22a11x2 + a12a21x2 = b2a11 – b1a21
x2 = (b2a11 – b1a21)/(a22a11 – a12a21)

x2 can be substituted for one of the original equations to calculate the term x1.

Example: Use the elimination of unknowns to solve the following equations:


3x1 + x2 = 18
-x1 + 2x2 = 2

Solution: Multiply first equation by (-1) and the second equation by (3) to eliminate the first
term, x1:
3x1 + x2 = 18 x (-1) → -3x1 - 2x2 = -18
-x1 + 2x2 = 2 x (3) → -3x1 + 6x2 = 6
We need to subtract first equation from second equation to eliminate the first term, x1:

Hence, we get the value of x2, which is equal to 3


Finally, x2 can be substituted for one of the original equations to calculate the term x1.
3x1 + 2(3) = 18 → x1 = 4

The elimination of unknowns can be extended to the systems with three or more equations.
However, the numerous calculation methods required for larger systems make it extremely
tedious to apply.

The Naive Gauss Elimination:

The elimination of unknowns was used to solve a pair of simultaneous equations, including
more than 3 equations.
For a nxn system, as given below:
a11x1 + a12x2 + ………………….. + a1nxn = b1
a21x1 + a22x2 + ………………….. + a2nxn = b2
a31x1 + a32x2 + ………………….. + a3nxn = b3
. . . .
. . . .
. . . .
an1x1 + an2x2 + ………………….. + annxn = bn
The procedure consisted of two steps:
1. The equations were manipulated to eliminate one of the unknowns from the equations. The
result of this elimination step was that we had one equation with one unknown. The equations
were manipulated to remove one of the unknowns from the equations. The end of this
elimination step was to have one equation with one unknown.
In detail:
a) We need to eliminate x1 from second to nth equations
- Multiply 1st equation by a21/a11 and subtract it from the 2nd equation. This is the
new 2nd equation.
- Multiply 1st equation by a31/a11 and subtract it from the 3rd equation. This is the new
3rd equation.
- …..
- …..
- Multiply 1st equation by an1/a11 and subtract it from the nth equation. This is the new
nth equation.
Modified system is as given below:
a11x1 + a12x2 + a13x3 +………………….. + a1nxn = b1
a’22x2 + a’23x3 + ………………….. + a’2nxn = b’2
a’32x2 + a’33x3 + ………………….. + a’3nxn = b’3
. . . .
. . . .
a’n2x2 + a’n3x3 + ………………….. + a’nnxn = b’n

b) We need to eliminate x2 from 3rd to nth equations


- Multiply the modified 2nd equation by a’32/a’22 and subtract the obtained result from
the 3rd equation. This is the new 3rd equation.
- Multiply the modified 2nd equation by a’42/a’22 and subtract the obtained result from
the 4th equation. This is the new 4th equation.
- …..
- Multiply the modified 2nd equation by a’n2/a’22 and subtract the obtained result from
the nth equation. This is the new nth equation.
Modified system is as given below:
a11x1 + a12x2 + a13x3 +………………….. + a1nxn = b1
a’22x2 + a’23x3 + ………………….. + a’2nxn = b’2
a’’33x3 + ………………….. + a’’3nxn = b’’3
The procedure needs to be continued and the final modification in the sequence is to use the
(n-1)th equation to eliminate the xn-1 term from the nth equation. The modified system will
have been turned into an upper triangular system.

The final modified system will be in the form as given below:


a11x1 + a12x2 + a13x3 +………………….. + a1nxn = b1
a’22x2 + a’23x3 + ………………….. + a’2nxn = b’2
a’’33x3 + ………………….. + a’’3nxn = b’’3
+ a(n-1)nnxn = bn(n-1)
2. As a result, this equation can be solved directly and the result back-substituted into one of
the original equations given above to solve for the remaining unknown. This simple approach
can be extended to large sets of equations by modifying a systematic scheme or algorithm to
remove the unknowns.

RERENCES:
S.C. Chapra and R.P. Canale, “Numerical Methods for Engineers”, 6th ed., McGraw-Hill,,
NY, 2010
Richard L. Burden and J. Douglas Faires, “Numerical Analysis”, 9th ed., Brooks/Cole,
Cengage Learning, Canada.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy