Question: The truncation error in a numerical algorithm is 0(n) where n denotes the number of iterations. It is found that after 3 iterations the

The truncation error in a numerical algorithm is 0(n) where n denotes

 

The truncation error in a numerical algorithm is 0(n) where n denotes the number of iterations. It is found that after 3 iterations the truncation error is 2.5%. What is the truncation error expected to be after 4, 5 and 6 iterations? Note: Having a truncation error of order 0(n) implies that the error reduces as the 4th power of number of iterations i.e. 6= Cn where Cis a constant.

Step by Step Solution

3.52 Rating (159 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

Answer Let the actual value be x and the predicted value be ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Algorithms Questions!