0% found this document useful (0 votes)
6 views

Numerical Method Introduction (1)

Numerical methods are mathematical tools used to solve numerical problems that cannot be solved analytically, often implemented as numerical algorithms in programming. These methods involve approximating solutions through iterative processes, allowing for quick convergence to an answer within an acceptable error range. The document also discusses significant figures, Taylor's series, and various applications of numerical methods in scientific computing.

Uploaded by

Ello Jidan
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
0% found this document useful (0 votes)
6 views

Numerical Method Introduction (1)

Numerical methods are mathematical tools used to solve numerical problems that cannot be solved analytically, often implemented as numerical algorithms in programming. These methods involve approximating solutions through iterative processes, allowing for quick convergence to an answer within an acceptable error range. The document also discusses significant figures, Taylor's series, and various applications of numerical methods in scientific computing.

Uploaded by

Ello Jidan
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/ 27

Numerical

Methods
Dr. Ida Herawati
Waskito Pranowo, M.T.
11202
Numerical Methods

The Pure Mathematics The Applied Mathematics

Differential Equation
Algebra
Probability and Statistics
Trigonometry Advanced Engineering Mathematics
Geometry Numerical Methods
Calculus Chemistry
Physics
Numerical
Mechanics
Methods = Structural Theory
Approximate Design and Engineering
Solution
Numerical Method
Numerical method is a mathematical tool designed to solve numerical
problems.
The implementation of a numerical method with an appropriate
convergence check in a programming language is called a numerical
algorithm.
Numerical methods allow us to approximately solve math problems,
specifically ones that we can’t solve analytically.
Numerical Methods

Analytical solution involves framing Numerical solution means making


the problem in a well-understood guesses at the solution and testing
form and calculating the exact whether the problem is solved well
enough to stop.
solution.
Applying a set of logical steps to
solve our problem that are proven to
find the exact answer to the
problem.
𝑥+1=0
𝑥+1−1=0 −1
𝑥 = −1
Numerical Methods
What if finding that exact answer takes too long or is impossible?

Numerical method: plugging in inputs, checking how close we are to the


solution, adjusting our input and repeating this process until we get within
a set amount of error (an acceptable level of incorrectness set by us).

Although we rarely reach an exact answer, we can get really close to the
answer much quicker than solving analytically.

Computation time increases if allowable error decreases


Numerical Methods

𝑥+1=0
Iteration 1: Iteration 2: Iteration 3:
1 1
𝑥=0 𝑥=−
𝑥= 2
2
1 1
0+1=0 − +1=0
+1=0 2
2
3 1
1≠0 ≠0
≠0 2
2
Answer off by 3/2 Answer off by 0 Answer off by 1/2
Numerical Methods
Off by Off by Off by
1/2 1 3/2

-1/2 0 3/2

Therefore, our answer must be somewhere to the left of -1/2


Numerical Methods
Exact Solution: 𝑥 2 + 8𝑥 + 15 = 0
𝑥+3 𝑥+5 =0
𝑥 = −3 𝑎𝑛𝑑 𝑥 = −5
Approximate Solution: 𝑥 2 + 8𝑥 + 15 = 0
𝑥=2
2 2 + 8 2 + 15 ≠ 0

Convergence (Newton- 𝑓 𝑥𝑛
𝑥𝑛+1 = 𝑥𝑛 −
Raphson Method): 𝑓′ 𝑥𝑛
𝑥𝑛 2 + 8𝑥𝑛 + 15
𝑥𝑛+1 = 𝑥𝑛 −
2𝑥𝑛 + 8
Numerical Methods
Convergence (Newton-Raphson Method):
2 2
+ 8 2 + 15
𝑥𝑛+1 = 2 − = −0.917
2 2 +8
−0.917 2 + 8 −0.917 + 15
𝑥𝑛+1 = −0.917 − = −2.296
2 −0.917 + 8

−2.296 2 + 8 −2.296 + 15
𝑥𝑛+1 = −2.296 − = −2.855
2 −2.296 + 8

−2.855 2 + 8 −2.855 + 15
𝑥𝑛+1 = −2.855 − = −2.991
2 −2.855 + 8
−2.991 2 + 8 −2.991 + 15
𝑥𝑛+1 = −2.991 − = −𝟑
2 −2.991 + 8
Numerical Methods
Numerical Methods
Numerical Methods
Numerical method is a must in scientific computing.
Numerical Methods
Numerical Methods
Numerical Methods
Numerical Methods
Introduction to numerical methods

Errors Linear Equation Optimization

Partial
Numerical
Root Finding Differential
Integral
Equation

Ordinary
Numerical
Interpolation Differential
Differentiation
Equation
Significant Figures
Significant figures are the digits in the number that are reliable.

They include:
• All non-zero numbers
• Zeros between two non-zeros digits

Non-significant figures:
• Leading zeros
• Trailing zeros (without decimal point)
Significant Figures
846 has 3 significant figures. 846
3546 has 4 significant figures. 3546

504 has 3 significant figures. 504


7006 has 4 significant figures. 7006
Significant Figures
Trailing Zeros

500 has only 1 significant figure. 500

500. (with decimal point) has 3 500.


significant figures.

500.0 has 4 significant figures. 500.0


Significant Figures
Leading Zeros

0.075 has 2 significant figures. 0.075

0.00007 has only 1 significant 0.00007


figure.

0.0050380 has 5 significant figures 0.0050380


Significant Figures
How many significant figures are there?

4250
7080
5030.
0.00703
0.08060
5030.0
750.04640
Significant Figures

The mathematical operation of significant figures →


the least digits of significant figures

4.6 has 2 significant figures.


3.53 has 3 significant figures.

4.6 x 3.53 = 16.192

The answer is:


16
Significant Figures

Significant figures = True Value ± Uncertainty

True value is a number based on the measurement.


Uncertainty is the estimation of amount by which measurement differs
from true value (define the precision).
Numerical Methods
Understanding Numerical Methods:

• The concept of precision and accuracy.


• The computation of approximate and true percent relative errors.
• Taylor’s series to approximate the functions.
• The concept of round-off error, truncation error and total numerical error.
Taylor’s Series
• Taylor series is a representation of a function as an infinite sum of terms that are
calculated from the values of the function's derivatives at a single point.
• Taylor’s series is used to approximate the value of the known function.
• If only a few terms are used, the value of the function that is obtained from the
Taylor’s series is an approximate value.
• Taylor’s series expansion of functions is used extensively in deriving numerical
methods.
2

𝑓" 𝑎 𝑥 − 𝑎 𝑓 (3) 𝑎 𝑥 − 𝑎 3
𝑓 (𝑛) 𝑎 𝑥 − 𝑎 𝑛
𝑓 𝑥 =𝑓 𝑎 +𝑓 𝑎 𝑥−𝑎 + + +⋯+
2! 3! 𝑛!

𝑓 (𝑛) 𝑎 𝑥 − 𝑎 𝑛
𝑓 𝑥 =෍
𝑛!
𝑥=0
Taylor’s Series
Example
Use the Taylor series for fourth order to estimate 𝑓 𝑥 = 𝑒 𝑥 with a = 0 (or
MacLaurin’s Series), and x = 1.2

order n f(x)

0 1
1 2.2
2 2.92
3 3.208
4 3.2944
Referensi

• Chapra, S.C. and Canale, R.P., Numerical Methods for Engineering, 6th Ed.,
McGraw Hill, 2010
• Jaan Kiusalaas, Numerical Methods in Engineering with Python 3,
Cambridge, 2013
• Introduction to Numerical Methods, Online Education
https://www.youtube.com/watch?v=yWmELo5AYv4
• CHAPTER 1 INTRODUCTION TO NUMERICAL METHOD, nurfatihah
mohamad hanafi, https://www.youtube.com/watch?v=sANUGXAGmcw

You might also like