Next: About this document ...
CS3331: Numerical Methods
Quiz 3
May. 16, 1997
- 1.
- (3%)
Suppose that a root of f(x)=0 is located in an interval
between x=0 and x=1024, and we are going to use the
bisection method to find the root.
If the error tolerance of the estimated root is 0.001,
what is the smallest number of iteration we need to perform?
- 2.
- (2%) What is the sufficient condition to insure
the convergence of the successive substitution method
xn = g(xn-1)?
- 3.
- (5%) One systematic way of using the successive substitution
method to find the zero of f(x)=0 is to have the
iterative scheme
.
- (a)
- (2%)
What is the sufficient condition to insure the
convergence of the iterative scheme?
- (b)
- (3%)
What is the
value for optimal convergence
rate? Why? (Use hand drawing if necessary.)
- 4.
- (7%)
Let f(x) = x3/3+x2/2+x-1/2.
- (a)
- (2%) Without actually solving the equation,
explain why there is a root of f(x)
between x=0 and x=1.
- (b)
- (2%) Write down the Newton iteration formula.
- (c)
- (3%) To use the successive substitution method,
we can have an iterative formula:
. What is the range for
such that the formula
can converge to the root between x=0 and x=1?
- 5.
- (5%) The following equations represent two ellipses:

We are going to find its solution via the Newton iteration.
- (a)
- (3%)
What is the Jacobian matrix?
- (b)
- (2%)
What is the iteration formula?
(Just write down the formula; you don't
need to expand or simplify it.)
- 6.
- (8%) What transformations are necessary to make the
following equations linear in terms of the undetermined
coefficients
,
,
, and so on?
- (a)
- (2%)
- (b)
- (2%)
- (c)
- (2%)
- (d)
- (2%)

- 7.
- (6%)
- (a)
- (2%) What is the least-squares solution to
?
- (b)
- (2%) What is the preferable one-line command for
computing the least-squares solution to the above
equation?
- (c)
- (2%) What error measure (or objective function)
is minimized by the answers in (a) and (b)?
Next: About this document ...
J.-S. Roger Jang
3/20/1998