Scribd
Upload
6 views2 pages

Numerical Analysis Exercises and Methods

The document outlines exercises for a course on Applied Numerical Analysis, covering topics such as sources of errors in numerical methods, comparisons between numerical and analytical methods, and flowchart creation for various algorithms. It includes specific tasks to implement algorithms in C++, solve non-linear equations using multiple methods, and analyze convergence speeds. Additionally, it addresses direct versus indirect methods for solving systems of equations and requires solving a given system using various techniques.

Uploaded by

Noah Nathenael
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
6 views2 pages

Numerical Analysis Exercises and Methods

The document outlines exercises for a course on Applied Numerical Analysis, covering topics such as sources of errors in numerical methods, comparisons between numerical and analytical methods, and flowchart creation for various algorithms. It includes specific tasks to implement algorithms in C++, solve non-linear equations using multiple methods, and analyze convergence speeds. Additionally, it addresses direct versus indirect methods for solving systems of equations and requires solving a given system using various techniques.

Uploaded by

Noah Nathenael
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

Faculty of Science
Department of Mathematics
Math 3221: Applied Numerical Analysis I
Exercise - 1

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

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

3. Draw flow charts of the algorithms:

a) False position method

b) Newton-Ralphson method

c) Fixed point iteration method

4. Implement the algorithms in Q3 using C++.

5. 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 TLV = 0.001.

Solve the equation using:

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

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?

6. Order the methods, in solving the question in Q3 above, based on their convergence
speed.

7. Given a non-linear equation 𝐱 + 𝐥𝐧𝐱 = 𝟎. Use initial point 1 and TLV=0.001. Solve
using:
a) Newton’s method
b) Fixed point iteration method.

1
Exercise-II

1. Compare direct and indirect (iterative) methods in solving systems of equations.

2. Draw the flowchart for the Gaussian Elimination with partial pivoting method and
implement using C++.

3. Consider the following system of linear equation:

𝑥 − 2𝑦 + 4𝑧 = 5
4𝑥 + 2𝑦 + 𝑧 = 1
𝑥 −3𝑦 + 𝑧 = 2
3.1. Solve using:

a) Gaussian Elimination with partial pivoting method

b) Solve using LU decomposition method.

3.2. Find the inverse of the coefficient matrix of the system using Jordan’s method.

3.3. Is the coefficient matrix diagonally dominant?

3.4. Solve using:

c) Gauss-Jacobi method. Begin with (0, 0, 1) and use three iterations only.

d) Gauss-Seidel method. Begin with (0, 0, 1) and use three iterations only.

e) Compare their convergence speed.

4. Solve the non linear system of equations


xyz - x2 + y2 = 1.34
xy - z2 = 0.09
ex + e y + z = 0.41
by Newton’s method to obtain a solution near (1,1,1). Use two iterations only.

You might also like