Type of Exam

I- MODIFIED TRUE OR FALSE

-significant figures
II- PROBLEM SOLVING
1st Part
-Newton
-Secant
-False Postion
2nd Part
-Gauss Seidel
-Gauss Elimination
-Graphical method ng Linear. Yung kumukuha ng Intersection
-Bisection
-Cramer’s Rule

Mga wala
-Simple Fixed
-Graphical method ng Root Finding
-Gauss Jordan
 SIGNIFICANT FIGURES
• Non-zero digits are ALWAYS significant
13.55 has four significant figures (1, 3, 5, 5).
• any zero contained between two non-zero numbers is significant
1.05 has three significant figures (1, 0, 5); the zero is enclosed by non-
zero digits and should be counted.
• leading zeroes are never significant
0.0501 - three significant figures (5, 0, 1); the leading zeroes are
ignored, the third zero is enclosed by two non-zero digits and is
therefore significant.
• final or trailing zeroes are significant only after a decimal point
0.00500 - three significant figures (5, 0, 0); the leading zeroes do
not count (as per Rule 3) but the two trailing zeroes are considered to
be significant as they come after a decimal point. So in this example
the three significant figures are the 5 and the final two zeroes.
500 - one significant figure (5); there is no decimal point and
therefore the two zeroes do not add anything to the "precision" of the
number. However, if a decimal point is present then these zeroes will
become significant, as per example 5).
Error Definition
• truncation errors, which result when approximations are used to represent exact
mathematical procedures

• round-off errors, which result when numbers having limited significant figures are used to
represent exact numbers.

𝑇𝑟𝑢𝑒 𝑉𝑎𝑙𝑢𝑒 = 𝐴𝑝𝑝𝑟𝑜𝑥 + 𝐸𝑡

𝐸𝑡 = 𝑇𝑟𝑢𝑒 𝑉𝑎𝑙𝑢𝑒 − 𝐴𝑝𝑝𝑟𝑜𝑥
Et =exact value of the error = true error

𝑇𝑟𝑢𝑒 𝑒𝑟𝑟𝑜𝑟 𝑇𝑟𝑢𝑒 𝑒𝑟𝑟𝑜𝑟−𝐴𝑝𝑝𝑟𝑜𝑥

𝐸𝑡 = 𝑇𝑟𝑢𝑒 𝑉𝑎𝑙𝑢𝑒 𝑥100% ; 𝐸𝑡 = 𝑥100% (always absolute)
𝑇𝑟𝑢𝑒 𝑉𝑎𝑙𝑢𝑒

𝑋𝑛𝑒𝑤−𝑋𝑜𝑙𝑑
𝐸𝑎 = 𝑥100% (always Absolute)
𝑋𝑛𝑒𝑤

1
Area of Triangle: 𝐴 = (𝑏)(ℎ)
2

Area of Square: 𝐴 = 𝑠𝑖𝑑𝑒 𝑥 𝑠𝑖𝑑𝑒

Area of Circle= 𝐴 = 𝜋𝑟 2
 BRACKETING METHOD
 GRAPHICAL METHOD (HINDI KASAMA SA EXAM)
-simple method for obtaining an estimate of the root of the equation f(x) = 0 is to make a plot of
the function and observe where it crosses the x axis. This point, which represents the x value for
which f(x) = 0, provides a rough approximation of the root
 BISECTION METHOD
-Alternatively called binary chopping, internal halving or Bolzano’s
method
-One type of incremental search method in which the interval is always divided in half.

-If a function changes sign over an interval, the function value at the midpoint is evaluated. The
location of the root is then determined as lying at the midpoint of the subinterval within which
the sign change occurs. The process is repeated to obtain refined estimates.

Example:
Solve: 𝑓(𝑥) = 𝑥 2 − 3.
Given the interval [1,2]
Iteration Xl Xu F(Xl) F(Xu) Xm F(Xm)
(A) (B) (C) (D) (E) (F)
1 1 2 -2 1 1.5 -0.75
2 1.5 2 -0.75 1 1.75 0.062
3 1.5 1.75 -0.75 0.062 1.625 -0.359
4 1.625 1.75 -0.359 0.062 1.6875 -0.1523

5 1.6875 1.75 -0.1523 0.0625 1.7188 -0.0458

Calculator Method
𝐴+𝐵
𝐶 = 𝐴2 − 3: 𝐷 = 𝐵2 − 3: 𝐸 = : 𝐹 = 𝐸2 − 3
2

SAMPLE PROBLEM
SOLVE: f(x) =𝑥 2 − 3. Given the interval [1,2]
 FALSE POSTION METHOD
-if f(xl) is much closer to zero than f(xu), it is likely that the root is closer to xl than to xu
-An alternative method that exploits this graphical insight is to join f(xl) and f(xu) by a straight
line.
-The intersection of this line with the x axis represents an improved estimate of the root. The
fact that the replacement of the curve by a straight linengives a “false position” of the root is the
origin of the name, method of false position, or in Latin, regula falsi.
-It is also called the linear interpolation method.

Formula
𝑓(𝑥𝑙)
𝑋𝑛 = 𝑋𝑙 + (𝑋𝑢 − 𝑋𝑙)((𝑓(𝑥𝑙)−𝐹(𝑥𝑢)))

Example Problem

Calculator Method
𝑐
𝐶 = 𝐴3 − 𝐴 − 1: 𝐷 = 𝐵3 − 𝐵 − 1: 𝐸 = 𝐴 + (𝐵 − 𝐴) ( ) : 𝐹 = 𝐸3 − 𝐸 − 1
𝐶−𝐷
 OPEN METHOD
 SIMPLE FIXED POINT ITERATION (HINDI KASAMA SA EXAM)
-also called, one-point iteration or successive substitution)
by rearranging the function f(x) = 0 so that x is on the left-
hand side of the equation:
x = g(x)

Example problem.
Use simple fixed-point iteration to locate the root of
e -x- x. = 0

𝑇𝑣 − 𝐴𝑝𝑝𝑟𝑜𝑥
𝐸𝑡 = (100)
𝑇𝑣
 NEWTHON RHAPSON METHOD

Example Problem Statement.

Use Newton Rhapson method to estimate the root of

Calculator Method: NEWTHON RHAPSON

𝐵
𝐵 = 𝐴3 + 2𝐴 − 2: 𝐶 = 𝐴2 + 2: 𝐷 = 𝐴 −
𝐶
 SECANT METHOD
A potential problem in implementing the Newton-Raphson method is the evaluation of the
derivative. Although this is not inconvenient for polynomials and many other functions, there
are certain functions whose derivatives may be extremely difficult or inconvenient to evaluate.
𝑋1 − 𝑋0
𝑋2 = 𝑋0 − 𝑓(𝑋0)( )
𝑓(𝑋1) − 𝑓(𝑋0)
Example Problem:Approximate root of the equation 𝑥 3 +
2𝑥 2 + 𝑥 − 1 = 0 using secant method is 0.4655
(after 5 iteration)

Iteration X0 X1 f(X0) f(X1) X2 f(X2)

a b c d e f
1 0 1 -1 3 0.25 -0.6094
2 1 0.25 3 -0.6094 0.3766 -0.2863
3 0.25 0.3766 -0.6094 -0.2863 0.4888 0.0835
4 0.3766 0.4888 -0.2863 0.0835 0.4635 -0.0073
5 0.4888 0.4635 0.0835 -0.0073 0.4655 -0.0002

Calculator Method: NEWTHON RHAPSON

𝐵−𝐴
𝐶 = 𝐴3 + 2𝐴2 + 𝐴 − 1: 𝐷 = 𝐵3 + 2𝐵2 + 𝐵 − 1: 𝐸 = 𝐴 − 𝐶 ( ) : 𝐹 = 𝐸3 + 𝐸3 + 𝐸 − 1: 𝐴
𝐷−𝐶
= 𝐵: 𝐵 = 𝐸
GRAPHICAL METHOD
-obtainable for two equations by plotting them on Cartesian coordinates with one axis
corresponding to x1 and the other to x2. Because we are dealing with linear systems, each
equation is a straight line. This can be easily illustrated for the general equations
CRAMER’S RULE
-states that each unknown in a system of linear algebraic equations may be expressed as a
fraction of two determinants with denominator D and with the numerator obtained from D by
replacing the column of coefficients of the unknown in question by the constants b1, b2, . . . ,
bn. For example, x1 would be computed as
 Elimination
-basic strategy is to multiply the equations by constants so that one of the unknowns
will be eliminated when the two equations are combined. The result is a single equation
that can be solved for the remaining unknown. This value can then be substituted into
either of the original equations to compute the other variable.

Example

3x+2y=18
-x+2y=2

Solution
[3x+2y=18 ]-1 (X=4,Y=3)
[-x+2y=2 ]3
NAIVE GAUSS ELIMINATION
- Forward Elimination of Unknowns. The first phase is designed to reduce the set of equations to
an upper triangular system (Fig. 9.3). The initial step will be to eliminate the first unknown, x1,
from the second through the nth equations.

Sample Problem using Gauss Elimination

Formula:
𝐸
3x-0.1y-0.2z=7.85 𝑥 − 𝑌 (𝑦)
0.1x+7y-0.3z=19.3
0.3x-0.2y+10z=71.4
GAUSS JORDAN (HINDI KASAMA SA EXAM)
- a variation of Gauss elimination. The major difference is that when an unknown is eliminated in
the Gauss-Jordan method, it is eliminated from all other equations rather than just the
subsequent ones. In addition, all rows are normalized by dividing them by their pivot elements.
Thus, the elimination step results in an identity matrix rather than a triangular matrix (Fig. 9.9).
Consequently, it is not necessary to employ back substitution to obtain the solution
 GAUSS-SEIDEL
-Iterative or approximate methods provide an alternative to the elimination methods described
to this point. Such approaches are similar to the techniques we developed to obtain the roots of
a single equation in Chap. 6. Those approaches consisted of guessing a value and then using a
systematic method to obtain a refined estimate of the root. Because the present part of the
book deals with a similar problem- obtaining the values that simultaneously satisfy a set of
equations we might suspect that such approximate methods could be useful in this context.
The Gauss-Seidel method is the most commonly used iterative method. Assume that we are
given a set of n equations:

[A] {X] = {B}

Suppose that for conciseness we limit ourselves to a 3 X 3 set of equations. If the diagonal
elements are all nonzero, the first equation can be solved for X 1, the second for X2, and the third
for X3; to yield

𝑏1 − 𝑎12𝑥2 − 𝑎13𝑥3
𝑋1 =
𝑎11
Solve the linear system by Jacobe and Gauss-Seidel Method
 Calculator Method: Jacobe
2𝐵 − 3𝐶 − 1 3𝐴 − 𝐶 + 2 −2𝐴 + 𝐵 + 3
𝐴: 𝐵: 𝐶: 𝐷 = :𝐸 = :𝐹 =
5 4 −7

Calculator Method: Gauss-Seidel Method

2𝐵 − 3𝐶 − 1 3𝐴 − 𝐶 + 2 −2𝐴 + 𝐵 + 3
𝐴: 𝐵: 𝐶: 𝐴 = :𝐵 = :𝐶 =
5 4 −7