Scribd
Upload
2 views

1.-numerical-methods-ee4a

The document outlines numerical methods for solving mathematical problems, including error calculations and various techniques for finding roots of equations such as the Bisection Method and False-Position Method. It also covers methods for solving linear algebraic equations and curve fitting, as well as numerical differentiation and integration techniques. Key concepts include absolute, relative, and percentage errors, along with step-by-step procedures for iterative methods.

Uploaded by

Rio Alexis Paladan
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

1.-numerical-methods-ee4a

The document outlines numerical methods for solving mathematical problems, including error calculations and various techniques for finding roots of equations such as the Bisection Method and False-Position Method. It also covers methods for solving linear algebraic equations and curve fitting, as well as numerical differentiation and integration techniques. Key concepts include absolute, relative, and percentage errors, along with step-by-step procedures for iterative methods.

Uploaded by

Rio Alexis Paladan
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 16

NUMERICAL

METHOD FOR ENGINEERS


Numerical Methods
• are techniques by which mathematical problems are
formulated so that they can be solved with arithmetic
operations.
• method of obtaining solution by subjecting the original
problem to a series of steps or repetitions.
Error
• is the difference between the actual (true) value of a
quantity and the computed (approximate) value.

• Absolute Error = | 𝒙 − 𝒙′ | or | true value – approx. value |

𝒙 − 𝒙′
• Relative Error = | 𝒙 |

𝒙 − 𝒙′
• Percentage Error = 100 * | |
𝒙
ROOTS OF EQUATION

Bracketing Method
a. Graphical Method
b. Bisection Method
c. False-Position Method
Open Method
a. Simple Fixed-Point Iteration
b. Newton-Raphson Method
c. Secant Method

LINEAR ALGEBRAIC EQUATION

a. Gauss Elimination
b. Gauss-Jordan Method
c. Gauss-Seidel Method
d. Jacobi Method
CURVE FITTING
Least-Square Regression
a. Linear Regression
b. Polynomial Regression
Interpolation
a. Newton Divided Difference Interpolating Polynomials
b. Lagrange Interpolating Polynomials
NUMERICAL DIFFERENTIATION AND INTEGRATION
a. Trapezoidal Rule
b. Rectangular Rule
BRACKET METHOD
• Bracketing methods determine successively smaller
intervals (brackets) that contain a root.
• When the interval is small enough, then a root has been
found.
• They generally use the intermediate value theorem, which
asserts that if a continuous function has values of
opposite signs at the end points of an interval, then the
function has at least one root in the interval.
Graphical Method
A simple method for obtaining an estimate of the roots of the equation
f(x) = 0 , is to make a plot of the function and observe where it intersects
the x- axis.
Ex. 𝑓 𝑥 = −0.5𝑥 2 + 2.5𝑥 + 4.5
10
x f(x)
5
5 4.5
0
6 1.5 0 5 10 15
-5
7 - 2.5
8 -7.5 -10

9 -13.5 -15
10 -20.5 -20
-25
Bisection Method
Method in which the interval is always divided in half step .

Step in Solving Bisection Method


a. Choose lower Xl and upper Xu guesses for the root such that
function changes sign over the interval.
b. An estimate of the root Xr is determined by
𝑋𝑟 = (𝑋𝑙 + 𝑋𝑢) /2
c. For evaluations to determine in which sub interval the root
lies
1. if f(Xl)f(Xr)< 0, 𝑠𝑒𝑡 𝑋𝑢 = 𝑋𝑟 𝑎𝑛𝑑 𝑟𝑒𝑡𝑢𝑟𝑛 𝑡𝑜 𝑠𝑡𝑒𝑝 𝑏
2. if f(Xl)f(Xr)> 0, 𝑠𝑒𝑡 𝑋𝑙 = 𝑋𝑟 𝑎𝑛𝑑 𝑟𝑒𝑡𝑢𝑟𝑛 𝑡𝑜 𝑠𝑡𝑒𝑝 𝑏
3.if(Xl)f(Xr)= 0, 𝑡ℎ𝑒 𝑟𝑜𝑜𝑡 𝑖𝑠 𝑒𝑞𝑢𝑎𝑙 𝑡𝑜 𝑋𝑟 𝑡𝑒𝑟𝑚𝑖𝑛𝑎𝑡𝑒 𝑡ℎ𝑒 𝑐𝑜𝑚𝑝𝑢𝑡𝑎𝑡𝑖𝑜𝑛
Disadvantages of Bisection Method.
• bisection method cannot detect multiple roots.
• Slow convergence
1st iteration
a. f(6)= 1.5, f(7) = -2.5
b. let Xl = 6, Xu = 7

𝑋𝑟 = 𝑋𝑙 + 𝑋𝑢 /2
= (6 + 7) / 2
=6.5
c. evaluate
f(Xl)f(Xr) =f(6)*f(6.5)
(1.5)*(-0.375)= -0.5625
Therefore f(Xl)*f(Xr)<0,𝑠𝑒𝑡 𝑋𝑢 = 𝑋𝑟 𝑎𝑛𝑑 𝑟𝑒𝑡𝑢𝑟𝑛 𝑡𝑜 𝑠𝑡𝑒𝑝 𝑏
2nd iteration
a. Xl=6 Xu= 6.5
b. 𝑋𝑟 = 𝑋𝑙 + 𝑋𝑢 /2
= (6 + 6.5) / 2
=6.25
c. evaluate
f(Xl)f(Xr) =f(6)f(6.25)
(1.5)(0.59375)= 0.890625
Therefore f(Xl)f(Xr)>0,𝑠𝑒𝑡 𝑋𝑙 = 𝑋𝑟 𝑎𝑛𝑑 𝑟𝑒𝑡𝑢𝑟𝑛 𝑡𝑜 𝑠𝑡𝑒𝑝 𝑏
3rd iteration
a. Xl=6.25 Xu= 6.5
b. 𝑋𝑟 = 𝑋𝑙 + 𝑋𝑢 /2
= (6.25 + 6.5) / 2
=6.375
c. evaluate
f(Xl)f(Xr) =f(6.25)f(6.375)
(1.5)(0.11718)= 0.069580
Therefore f(Xl)f(Xr)=0, root is equal to Xr, terminate the
computation
False-Position Method
Alternative method that exploits the graphical insight is to join f(Xl) and
f(Xu) by a straight line. The intersection of the line with X axis represents
an improved estimate of the root.

𝑓(𝑋𝑙) 𝑓(𝑋𝑢)
𝑋𝑙−𝑋𝑟
= 𝑋𝑟−𝑋𝑢

𝐹(𝑋𝑢)(𝑋𝑙−𝑋𝑢)
𝑋𝑟 = 𝑋𝑢 - 𝐹 𝑋𝑙 −𝐹(𝑋𝑢)
Disadvantages of False Position Method.
• One of the interval definitions can get stuck.
• It may slowdown in unfavorable situations.

1. if f(Xl)f(Xr) < 0, 𝑠𝑒𝑡 𝑋𝑢 = 𝑋𝑟


2. if f(Xl)f(Xr) > 0, 𝑠𝑒𝑡 𝑋𝑙 = 𝑋𝑟
3. if(Xl)f(Xr) = 0, 𝑡ℎ𝑒 𝑟𝑜𝑜𝑡 𝑖𝑠 𝑒𝑞𝑢𝑎𝑙 𝑡𝑜 𝑋𝑟
1st Iteration
Xl=6 f(x)=1.5
Xu=7 f(x)= -2.5

(−2.5)(6−7)
Xr = 7- = 6.375; f(x) = 0.11718
1.5−(−2.5)

f(Xl)*f(Xr)
1.5*(0.11718) = 0.17577

Therefore f(Xl)f(Xr)>0, 𝑠𝑒𝑡 𝑋𝑙 = 𝑋𝑟


2nd Iteration
Xl=6.375 f(x) = 0.11718
Xu=7 f(x) = -2.5

(−2.5)(6.375−7)
Xr=7- = 6.4029; f(x) = 0.00932608
0.11718−(−2.5)
f(Xl)*f(Xr)
0.11718*(0.00932608) = 0.0010928

Small enough for an error, therefore f(Xl)f(Xr)=0

You might also like