0% found this document useful (0 votes)
82 views5 pages

Chapter 1

1) Numerical methods are used to approximate solutions to problems that cannot be solved analytically or that are computationally intractable. They provide approximate, rather than exact, solutions. 2) Areas of numerical analysis include solving nonlinear equations, systems of equations, interpolation, approximation of functions, numerical integration and differentiation, and solving differential equations. 3) Errors are an inevitable part of numerical computation and can come from the mathematical model, numerical method, input data, number representation, or arithmetic operations. The main types of errors are inherent errors, truncation errors, and rounding errors.

Uploaded by

Eyob Habte
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
82 views5 pages

Chapter 1

1) Numerical methods are used to approximate solutions to problems that cannot be solved analytically or that are computationally intractable. They provide approximate, rather than exact, solutions. 2) Areas of numerical analysis include solving nonlinear equations, systems of equations, interpolation, approximation of functions, numerical integration and differentiation, and solving differential equations. 3) Errors are an inevitable part of numerical computation and can come from the mathematical model, numerical method, input data, number representation, or arithmetic operations. The main types of errors are inherent errors, truncation errors, and rounding errors.

Uploaded by

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

Why use Numerical Methods?

To solve problems that cannot be solved exactly


To solve problems those are intractable!
Numerical Analysis: What it is?
For many engineering problems, we cannot obtain analytical solutions
Numerical methods yield approximate results, that is results, which are close to the exact
analytical solution
Areas of Numerical Analysis
Estimation of errors in numerical procedures
Solving nonlinear equations
Solving sets of equations
Interpolation and curve fitting
Approximation of functions
Numerical differentiation and integration
Numerical solution of differential equations (ordinary and partial)
Methods of optimization (minimizing/maximizing of a function)

Basic Concepts on error estimation


Error (in MATHEMATICS) mathematical difference: a variation between the true value of a
mathematical quantity and a calculated or measured value.
Analysis of errors is the central concern in the study of numerical methods and therefore we will
investigate the source of errors, the type of errors that may be occur in the given problem and the
subsequent propagation of errors.
Errors and uncertainty are an unavoidable part of computation
Some are human error while others are computer errors (e.g. due to precision)
We therefore look at the types of errors and ways of reducing them
Source of errors

The main sources of errors in obtaining numerical solutions to mathematical problems are:
a. The model: To solve different problems, mathematical models are formulated to describe
them and these models do not describe them exactly and as a result errors are introduced.
b. The method (Numerical): The methods used to solve the mathematical models are often
not exact and as a consequence errors are induced.
c. The data: There may be errors in measuring or estimating values.
d. The representation of numbers: A computer has a finite word length and so only a fixed
number of digits of a number are inserted and as a consequence errors are introduced.
e. The arithmetic: Frequently errors are introduced in carrying out operations such as
addition and multiplication.
Approximations of errors
Numerically computed solutions are subject to certain errors. Mainly there are threetypes of
errors. They are inherent errors, truncation errors and errors due to rounding.

1|Page
1. Inherent errors or experimental errors arise due to the assumptions made in themathematical
modeling of problem. It can also arise when the data is obtained fromcertain physical
measurements of the parameters of the problem. i.e., errors arisingfrom measurements.
2. Truncation errors are those errors corresponding to the fact that a finite (or infinite)sequence
of computational steps necessary to produce an exact result is “truncated”prematurely after a
certain number of steps.
3. Round of errors are errors arising from the process of rounding off during computation. These
are also called chopping, i.e. discarding all decimals from somedecimals on.
Estimation of Errors
Only rarely given data are exact, since theyoriginate from measurements. Thereforethere
is usually some error in the inputinformation
Algorithm itself usually introduces errors aswell, e.g., unavoidable round-offs, etc …
The output information will then contain errorfrom both of these sources
A common question related to all numericalprocedures is how confident we are in
theproduced results?
In other words, howmuch error is present inour calculation and is it tolerable?
Accuracyrefers to how closely a computed or measured value agrees with the true value.
Precision (or reproducibility)refers to how closely individual computed or measured
values agree with each other.
Inaccuracy (or bias). A systematic deviationfrom the actual (true) value.
Imprecision (or uncertainty). Magnitude ofScatter (disperse).

Error Definitions
Numerical errors arise from the use of approximations to represent exact mathematical
operationsand quantities. These include truncation errors, which result when approximationsare
used to represent exact mathematical procedures, and round-off errors, which resultwhen
numbers having limited significant figures are used to represent exact numbers. Forboth types,
the relationship between the exact, or true, result and the approximation can beformulated as
True value = approximation + error
Absolute error and relative error
Absolute error: Is the numerical difference between the true value of a quantity and its
approximate value. i.e. if x is the true value of a quantity and ~
x is its approximate value, then the
absolute error E A is given by:
E A =|x−~
x|
Relative error: The relative error E R is defined by:
x−~
E R=
x | |
x

 The percentage relative error E P is given by: E P=100 E R.


20
Example1: Let the exact value or true value of the number is and its approximate value is
3
6.666 , then find the absolute error, relative error and the percentage relative error.
Solution:

2|Page
E A =|x−~
20
x|= −6.666 =
3
2
3000| |
| |
20
−6.666
E R=
x−~
x | |
x
=
3
20
=
1
10000
3
1 1
E P=100 E R=100 × =
10000 100
1
Example2: three approximate values of the number are given as 0.30 , 0.33 and 0.34 . Which
3
one of the three is the best approximation?
Solution: The value with the smallest absolute error is the best approximation and therefore we
have to find the absolute errors. Let ~
x =0.30 , ~
1 x =0.33 and ~
2 x =0.34 3

1
E A = −0.30 =
3 1 |1
30 |
1
E A = −0.33 =
32 | 1
300 |
1
E A = −0.34 =
33 | 1
150 |
1 1 1
Here, < <
300 150 30
Therefore, the best approximation of the number is 0.33 .
Remark: If the number is rounded to N decimal places, then the absolute error is given by:
1
∆ x= × 10− N
2
Example: If x=0.51 and correct to two decimal places, then find the absolute error.
1 −N
Solution: ∆ x= × 10 , but in this case N=2
2
1
¿ ×10−2=0.005
2
Propagation of errors
Definition: Error propagation means that the errors in the input numbers of a process or an
operation cause the errors in the output numbers.
Let us investigate how error might be propagated in successive computations. The addition of
two numbers x and y (the true values) with the approximated values x and y , which contain

errors
e x and e y respectively. Starting with x=x+e x and y= y+e y

3|Page
x+ y=x +e x + y +e y =( x+ y )+ ( e x +e y )
The sum is

Hence, for addition, the error in the sum is the sum of the errors in the addends.

The propagation of error in multiplication is more complicated.

xy=( x +e x )( y+e y ) =x y +x e y + y e x +e x e y
The product is

Relative error is
xy−x y=x e y + y e x +e x e y

Let xy be the relative error in the product:

xy−x y x e y + y e x +e x e y x e y y e x e x e y
R xy= = = + +
xy xy xy xy xy

Furthermore, suppose that x and y are good approximations for x and y then
x
x
y
y
e e
≈1 , ≈1 and R x R y = x y ≈0
x y ( )( )
R and R y are relative errors in the approximation
( x
x and y ).
xy−x y x y
R xy = ≈ + +0=R x +R y
Thus, xy x y

This shows that the relative error in the product xy is approximately the sum of the relative error
in the approximations x and y .
Often an initial error will be propagated in a sequence of calculations. A quality that is desirable
for any numerical process is that a small error in the initial conditions will produce small changes
in the final result. An algorithm with this failure is called stable; otherwise it is called unstable.
Whenever possible we shall choose methods that are stable.

Propagated error: this is defined as an error in later steps of a program due to an earlier error.
• Propagated error is critical as errors may be magnified causing results to be invalid
• The stability of the program determines how errors are propagated

Goals for a good algorithm


Accuracy: All numerical solutions involve some error. An important goal for any algorithm is
that theerror should be small. However, it is equally important to have bounds on any error so
that we have confidence in any answers. How accurate an answer needs to be depends upon
theapplication. For example, an error of 0:1% may be more than enough in many cases but
mightbe hopelessly inaccurate for landing a probe on a planet.
4|Page
Efficiency: An efficient algorithm is one that minimizes the amount of computation time, which
usuallymeans the number of arithmetic calculations. Whether this is important depends on the
sizeof the calculation. If a calculation only takes a few seconds of minutes, it isn't worth
spending a lot of time making it more efficient. However, a very large calculation can take weeks
to run, so efficiency becomes important, especially if it needs to be run many times.
Stability and robustness: As we have seen, all calculations involve round-off errors. Although
the error in each calculation is small, it is possible for the errors to multiply exponentially with
each calculation sothat the error becomes as large as the answer. When this happens, the method
is describedas being unstable(small errors in the initial data lead to big errors in the result).A
robust algorithm is one that is stable for a wide range of problems.
Conditioning of a problem and stability
The accuracy of a solution depends on how aproblem is stated (as well as the
computer’saccuracy).Not all solutions of a problem are well posedand hence stable.A problem is
well posedif a solution (a) exits,(b) is unique, and (c) varies continuously asits parameters vary
continuously. If the problem is ill-posedit should bereplaced by alternative form or another
thathas a solution which is close enough.
Number representations
Most digital computers have two ways of representing numbers, called fixed point andfloating
point. In a fixed point system the numbers are represented by a fixed number ofdecimal places
e.g. 62.358, 0.013, 1.000.
In a floating point system the numbers are represented with a fixed number ofsignificant digits,
for example0.6238 x 103 0.1714 x 10−13−0.2000 x 101
also written as 0.6238 E03 0.1714 E -13-0.2000 E01
or more simply 0.6238 +03 0.1714 -13 -0.2000 +01
Significant digits
Significant digit of a number c is any given digit of c, except possibly for zeros to theleft of the
first nonzero digit that serve only to fix the position of the decimal point. (Thus,any other zero is
a significant digit of c). For example, each of the number 1360, 1.360,0.01360 has 4 significant
digits.

5|Page

You might also like