0% found this document useful (0 votes)
57 views2 pages

Numerical Analysis Error and Methods

The document contains 18 questions about numerical analysis methods for solving equations including: 1) Sources of errors in numerical methods 2) Comparing numerical and analytical methods 3) Defining round-off and truncation errors 4) Absolute and relative error 5) Examples of applying numerical methods like bisection, false position, Newton-Raphson to find roots of equations. The questions cover key concepts in numerical analysis like error analysis, root-finding algorithms, and their appropriate usage to solve different types of equations.

Uploaded by

siira
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)
57 views2 pages

Numerical Analysis Error and Methods

The document contains 18 questions about numerical analysis methods for solving equations including: 1) Sources of errors in numerical methods 2) Comparing numerical and analytical methods 3) Defining round-off and truncation errors 4) Absolute and relative error 5) Examples of applying numerical methods like bisection, false position, Newton-Raphson to find roots of equations. The questions cover key concepts in numerical analysis like error analysis, root-finding algorithms, and their appropriate usage to solve different types of equations.

Uploaded by

siira
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

Addis Ababa University

Department of Mathematics
Numerical Analysis Math3221

1. Briefly describe sources of errors in solving problems using numerical methods.

2. Briefly compare the numerical and analytical methods in solving problems.

3. What is round off error? What problems can be created by round off errors?

4. What is truncation error? Can you give examples of truncation error?

5. Define absolute error, relative error, and state their relationship.

6. How a computer that represents only 4 significant digits would calculate 66.666 × 33.333?

(a) with rounding

(b) with truncating


f (x + h) − f (x)
7. What is the truncation error in calculating f 0 (2) for f (x) = x2 by f 0 (x) ≈
h
when h = 0.2

8. What is 23, 432 to the nearest thousand? calculate the absolute error

9. What is 47.743 to the nearest whole number? calculate the relative error

10. round off 0.0046753 to 3 significant figures

11. What is a sufficient and necessary condition for bisection method to find a root of f (x) = 0
on the interval [a, b].

12. What is a sufficient and necessary condition for existence of one fixed point iteration method
of finding root of a function on an interval

13. Find the root of ex + 2x3 − 5 = 0 on the interval [0, 2].

1
(a) use five iterations of the bisection method.

(b) use five iterations of the fixed point iteration method with x0 = 1

14. Find roots of 5 sin2 x − 8 cos5 x = 0 on [ 12 , 32 ] by false position method with absolute error
δ = 0.001

15. How many iterations are needed to get an approximation root of x6 − x − 1 = 0 on the interval
[1, 1.5] with error less than δ0.0001

16. Find the root of the equation e−x − 2x = 0 using Newton-Raphson method

17. Given a non-linear equation ex + 4x3 − 5 = 0 which has a root near x = 0.86. Approximate
the root with the initials x0 = 0.7 and x1 = 0.9 and T LV = 0.001. Solve the equation using:

(a) Bisection method. How many iterations do you need to approximate the root using
bisection method within the TLV = 0.0001?

(b) Secant method

(c) False position method

(d) Newton-Ralphson method

(e) Fixed point iteration method. Use your own rearrangement that satisfies conditions for
the convergence of the fixed point iteration method?

18. Order the methods, in solving the question in Q18 above, based on their convergence speed.

Common questions

Powered by AI

The forward difference approximation for f(x) = x² at x = 2 with h = 0.2 is (f(2 + 0.2) - f(2))/0.2 = ((2.2)² - 4)/0.2 = (4.84 - 4)/0.2 = 4.2. The true derivative is 2*x = 4 at x = 2. The truncation error is therefore |4.2 - 4| = 0.2 .

Rounding 23,432 to the nearest thousand gives 23,000. The absolute error is the difference between the rounded value and the actual value, calculated as |23,000 - 23,432| = 432 .

Round-off error occurs when numbers are approximated because of limited precision in computer representations, typically due to the finite number of significant digits. This can lead to significant problems in computations where multiple operations amplify the error, potentially resulting in inaccurate results or failures in algorithms when they are sensitive to such errors .

Truncation error occurs when an infinite process is approximated by a finite one. For instance, using a finite number of terms in a series to approximate a function, or approximating a derivative by a finite difference, both introduce truncation error. For example, calculating a derivative using the forward difference formula instead of the true derivative introduces truncation error because the finite difference is only an approximation of the derivative .

With 4 significant digits, rounding 66.666 yields 66.67 and 33.333 yields 33.33. The multiplication gives 2221.9711, rounded to 2222. With truncating, 66.666 becomes 66.66, and 33.333 becomes 33.33, giving a product of 2221.1678, truncated to 2221 .

Absolute error is the absolute difference between the exact value and the approximation, calculated as |exact value - approximate value|. Relative error is the ratio of the absolute error to the exact value, providing a measure relative to the size of the exact value. Relative error is often expressed as a percentage to assess the error magnitude concerning the true value's scale .

Numerical methods differ from analytical methods in that they provide approximate solutions using computational algorithms, whereas analytical methods yield exact solutions using algebraic manipulations and symbolic reasoning. Numerical methods are typically used when analytical solutions are difficult or impossible to obtain, allowing for the handling of complex systems and large datasets .

The bisection method requires that the function be continuous on the closed interval [a, b] and that it changes signs at points a and b, i.e., f(a)*f(b) < 0. This ensures that there is at least one root in the interval due to the Intermediate Value Theorem .

Rounding 47.743 to the nearest whole number yields 48. The relative error is the absolute error divided by the exact value: |48 - 47.743|/47.743 = 0.257/47.743 ≈ 0.00538, or about 0.538% .

The primary sources of errors in numerical methods are round-off errors and truncation errors. Round-off errors arise due to the finite precision or fixed number of significant digits that a computer uses to represent numbers, which can accumulate and propagate errors in calculations. Truncation errors occur when an infinite process is approximated by a finite process, such as when replacing a derivative by a finite difference or an infinite series by a partial sum. These errors impact the accuracy of numerical solutions by limiting their precision and correctness .

You might also like