Numerical Analysis Exam Review Answers

Questions and Problems
1．What's the differences between numerical methods and classical analysis
methods?
 Analytical solutions can be obtained exactly with pencil and paper;

 Numerical solutions cannot be obtained exactly in finite time and typically cannot be solved
using pencil and paper.
Analytical method gives exact solutions, more time consuming and sometimes impossible.
Whereas numerical methods give approximate solution with allowable tolerance, less time and
possible for most cases
Example: F(x)=x-7
Analytic=>
say x-7=0 and x=7
Numerical=>
F(8)=8–7=1 and F(6)=6–7=-1
so answer in range 6 to 8.
next find the middle point and iterate the process.
2．What's the main tasks in numerical methods?
The main task in numerical methods is to find the approximate solution of an equation by using
initial guess values and repeating the procedure to obtain the allowable tolerance (%error) in
the solution.
In numerical analysis, a numerical method is a mathematical tool designed to solve numerical

problems. The implementation of a numerical method with an appropriate convergence check in
a programming language is called a numerical algorithm.
3．What's the main features of numerical methods?
4．What's the main idea of Bisection methods? How to do it for a given function?
The bisection method in mathematics is a root-finding method that repeatedly bisects an interval
and then selects a subinterval in which a root must lie for further processing. It is a very simple
and robust method, but it is also relatively slow.
 Check if solution lies between a and b…

F(a)*F(b) < 0 ?
 Try the midpoint m: compute F(m)
 If |F(m)| < tol select m as your approximate solution
 Otherwise, if F(m) is of opposite sign to F(a) that is if

F(a)*F(m) < 0, then b = m.
 Else a = m.
5．Using the bisection method to compute the approximate root of the following
Function
in the interval [0,1] such that the absolute error is less than ½^4
6． What's the basic idea of Newton method for single variable function y=g(x)
and how to use?
The idea of the method is as follows: one starts with an initial guess which is reasonably close to
the true root, then the function is approximated by its tangent line (which can be computed using
the tools of calculus), and one computes the x-intercept of this tangent line (which is easily done
with elementary algebra). This x-intercept will typically be a better approximation to the
function's root than the original guess, and the method can be iterated.
How to use:
Step 1
Evaluate f ( x ) symbolically
Step 2
Use an initial guess of the root, , to estimate the new value of the root, , as
f xi 
xi 1 = xi -
f xi 
Step 3
Find the absolute relative approximate error as

xi 1- xi
a =  100
xi 1
Step 4
Compare the absolute relative approximate error with the pre-specified relative error tolerance
.
Also, check if the number of iterations has exceeded the maximum number of iterations allowed.
7．Why can we use fixed point method to compute the solution of nonlinear
equation y=g(x)? Is it always convergence or not? If not, please give a example to
show it's divergence.
8．List the main advantages and shortages of Newton method.
Advantages
 Converges fast (quadratic convergence), if it converges.
 Requires only one guess

Drawbacks
1. Divergence at inflection points
2. Division by zero
3. Oscillations near local maximum and minimum
4. Root Jumping
Newton Method
The Newton-Raphson method, or Newton Method, is a powerful technique for solving equations
numerically. Like so much of the differential calculus, it is based on the simple idea of linear
approximation. Using Linear Approximations to Solve Equations Let f(x) be a well-behaved
function, and let r be a root of the equation f(x) = 0. We start with an estimate x0 of r. From
x0, we produce an improved—we hope—estimate x1. From x1, we produce a new estimate x2.
From x2, we produce a new estimate x3. We go on until we are ‘close enough’ to r—or until it
becomes clear that we are getting nowhere. The above general style of proceeding is called
iterative. Of the many iterative root-finding procedures, the Newton-Raphson method, with its
combination of simplicity and power, is the most widely used
The Secant Method is the most popular of the many variants of the Newton Method. We start
with two estimates of the root, x0 and x1. The iterative formula, for n ≥ 1 is
Instead of sliding along the tangent line, the Secant Method slides along a nearby secant line.
It is more stable, less subject to the wild gyrations that can afflict the Newton Method. (The
differences are not great, since the geometry is nearly the same.) To use the Secant Method, we
do not need the derivative, which can be expensive to calculate. The Secant Method, when it is
working well, which is most of the time, is fast. Usually we need about 45 percent more iterations
than with the Newton Method to get the same accuracy, but each iteration is cheaper. Your
mileage may vary.
16．What's the difference between data fitting and interpolation?
Interpolation
A method of constructing a function that crosses through a discrete set of known data points.

Numerical Analysis Exam Review Answers

Uploaded by

Copyright:

Available Formats

Numerical Analysis Exam Review Answers

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Read this document in other languages

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Numerical Analysis Exam Review Answers

Uploaded by

Copyright:

Available Formats

Questions and Problems

1．What's the differences between numerical methods and classical analysis

 Analytical solutions can be obtained exactly with pencil and paper;

say x-7=0 and x=7

F(8)=8–7=1 and F(6)=6–7=-1

next find the middle point and iterate the process.

2．What's the main tasks in numerical methods?

In numerical analysis, a numerical method is a mathematical tool designed to solve numerical

3．What's the main features of numerical methods?

 Check if solution lies between a and b…

 Try the midpoint m: compute F(m)

 If |F(m)| < tol select m as your approximate solution

 Otherwise, if F(m) is of opposite sign to F(a) that is if

and how to use?

Find the absolute relative approximate error as

equation y=g(x)? Is it always convergence or not? If not, please give a example to

show it's divergence.

8．List the main advantages and shortages of Newton method.

 Converges fast (quadratic convergence), if it converges.

 Requires only one guess

1. Divergence at inflection points

3. Oscillations near local maximum and minimum

You might also like