Errors In Numerical Techniques

Errors In Numerical Techniques – the error was caused by the finite precision of computations involving floating-point and integer values.

In Numerical analysis, we use approximate value so that difference between real value and approximate value. we got some errors, it is known as errors in numerical analysis

Errors in Numerical Methods –

Roundoff Error

Round-off is also known as rounding error. It is the difference between the result produced by a given algorithm using exact arithmetic and the result produced by the same algorithm using finite precision.

Rounding errors are due to inconsistency in the representation of real numbers and the arithmetic operations which are done with them. This form is called a quantization error.

 Using approximation values or algorithms, especially when using many digits to represent real numbers, one of the main goals of numerical analysis is to calculate computation errors. Computation errors are also known as numerical errors, They include both truncation errors and roundoff errors. When a part of calculations with an input requires any roundoff errors are made, errors may gather, and sometimes control the calculation. In nonstructural problems, significant errors may gather.

Inheritance Error

When performing computations with algebraic operations among approximate values, we carry to some extent the errors of the original data into the final result. Such errors are called inherent errors of the operation.

For example, let x=0.4444 and y=2.1516 be two approximate numbers for the exact number 1/3 and If we perform an algebraic operation between these two approximate numbers, that’s why the error will introduce in the final result.

Truncation Error

There is another error called truncation error that shows the difference between the exact mathematical solution and the approximate solution obtained when simplifications are made to the mathematical equations to make them more manageable to calculate.

These errors occur due to the use of the approximation formula in computation or by truncating the infinite series to some approximation terms. The study of this type of error is usually associated with the problem of convergence of infinite series.

The fact of truncation error comes from the fact that either simplification usually involves the truncation of an infinite series expansion to make the computation possible and practical, or because the least important bits of an arithmetic operation are thrown away.

Local Truncation Error:

The local truncation error is the error in numerical techniques which is used to estimate the error, introduced in a single iteration of the method, assuming that everything fed into the method was perfectly accurate. let’s assume that y₁, y₂, . . . , y_n refer to the numerically computed values and y(t₁), y(t₂), . . . , y(t_n ) refer to the corresponding exact values (so that y_n ≈ y(t_n)). To determine the local truncation error, we have to analyze a general iteration of a method in which the value y_n+1 is computed.

Local truncation error = y(t_n+1) – y_n+1

let’s assume that yn+1 is determined from exact information. That is if we have
a method of the form
                                    y_n+1 = φ(t_n, y_n, f, h)
where φ is considered as the formula for the numerical method, then assume that
                                   y_n = y(t_n), i.e.
                                    y_n+1 = φ(t_n, y(t_n), f, h)
and, we have assumed that we are going to examine the difference y(t_n+1) – y_n+1
which we call the local truncation error.

Global Truncation Error:

         The global truncation error is the collection of the local truncation error over all of the iterations, assuming perfect knowledge of the original solution at the initial time step.

More formally, the global truncation error, E_n , at time t_n is define as:

                                     E_n = y(t_n) – y_n

                                                 =y(t_n) – (y₀ + hA(t₀,y₀,h,f) + hA (t₁ , y₁ , h,f) +…+hA(t_n-1, y_n-1 ,h,f))