Final Project
on Iterative Methods in Nonquadratic Optimization.
Due May 11, 1998

MATH 4660-001 and C SC 4666-001: Numerical Analysis II
Spring 1998. University of Colorado at Denver


INSTRUCTOR:
Prof. Andrew Knyazev
Office: CU (Dravo) 644. Phone: 556-8102.
Office hours: Tue 3pm - 6pm (or by appointment)
WWW: http://www-math.cudenver.edu/~aknyazev

Students are welcome to communicate with each other and the teacher on-line using the Web page
http://www-math.cudenver.edu/~aknyazev/teaching/98/4660/comments

Computer Project Description:

Let A be a given real symmertic, i.e. A=A', matrix. Then, its minimal eigenvalue is real and can be found as a minimum of the following function

R(x)=(Ax,x)/(x,x),

where x is an arbitary nonzero real column-vector, and (u,v)=u'v is the standard scalar product of real column vectors. The gradient of this function is

grad R(x) = Ax - R(x)x,

up to a scalar multiplier, which is not important for us.

Write and test a MATLAB program of the gradient descent method

x^{k+1} = x^k - alpha * (A*x^k - R(x^k)*x^k)

to find the minimum of function R(x), thus, to find the smallest eigenvalue of A. Use Algorithm 10.3, pp. 617-618 from the text. Test it for different matrices. Try to use it to find the smallest eigenvalue of the matrix NOS6:from set LANPRO, from the Harwell-Boeing Collection. Use a random vector as the initial guess. Use MATLAB build-in functions eig and eigs, to find the eigenvalue, too. Discuss numerical results and perfomance. Write a report and publish it on the Internet.

Hints:

For extra credit:

Sample Report 1 and Report 2.