program4 - Program 4 Foundations of Computational Math 1...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Program 4 Foundations of Computational Math 1 Fall 2010 Due date: via email before the Final Exam begins on Wednesday, 12/8/10 General Task Implement codes to use preconditioned steepest descent and preconditioned conjugate gra- dient to solve Ax = b where A R n n is symmetric positive definite. You must demonstrate your code on multiple examples for three situations: 1. Take A = = diag ( 1 , 2 , . . . , n ), i.e., a diagonal matrix and apply CG and steepest descent without preconditioning, i.e., set your preconditioner to I . You should choose various combinations of values for the i to demonstrate how the spectrum affects the convergence of the two methods. Make sure that you demonstrate for a range of n the key points made in the text and notes about the convergence of these methods. 2. Any symmetric positive definite matrix A can be written A = Q Q T where is a diagonal matrix with the eigenvalues of A (which are postive) forming the diagonal, and Q is an orthogonal matrix containing eigenvectors of...
View Full Document

This note was uploaded on 07/25/2011 for the course MAD 5403 taught by Professor Gallivan during the Spring '11 term at University of Florida.

Page1 / 2

program4 - Program 4 Foundations of Computational Math 1...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online