02. Errors in Computation
Dated: 14-08-2025
Computed solutions are subject to certain errors so it is useful to know about their
- sources
- growth
Following are these errors
Inherent Errors
These are the errors which are present in the mathematical model of the problem itself due to simplified assumptions. It can also arise when the data is obtained from certain physical measurements of the parameters of the problem.
Local round off Errors
A computer has a limited word length due to which, there's a limit to how many decimal numbers
1 can be stored in a computer (in binary form). These limitations can cause errors, called round off errors.
Example
Imagine we are tasked to store
But the word length is limited to \(12\) bits
. Therefore, the stored value in binary is \(0.110000110011\) which is equal to \(0.76245\) not \(0.7625\). Therefore, there's an error of \(0.00005\). This error is inherent with the computer system we have.
Therefore, the error
is
The absolute error
is defined as \(|\text{Error}|\) meanwhile the relative error
is defined as.
Local Truncation Errors
It is generally easier to expand a function
2 into a power series
using Taylor series
3 expansion and evaluate it by retaining the first few terms.
Example
We can approximate \(f(x) = \cos(x)\) as follows:
Assume, we approximate by restraining the first \(n\) terms. This will cause the following truncation error
.
This error is independent of the computer used. If we want the approximation to be accurate with five significant digits then the question is how many terms are going to be included in the final result?
Taking logrithm
4 on both sides, we get
This inequality
5 is satisfied for \(n = 7\). Hence, we need \(7\) terms.
References
Read more about notations and symbols.
-
Read more about taylor series. ↩
-
Read more about inequalities. ↩