hw4 - Due: September 25, 2008 CS 257 (Luke Olson): Homework...

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

View Full Document Right Arrow Icon
Due: September 25, 2008 CS 257 (Luke Olson): Homework #4 Problem 1 Problem 1 In the last assignment, you implemented naive Gaussian elimination, and found out that it was lacking an important feature, row exchanges. These prevent errors from blowing up during Gaussian Elimination. We have provided a routine GE SPP that adds row exchanges to the GE naive routine from last time. We will now run GE naive , GE SPP , and Matlab’s Slash for two different situations: small entry test Construct a sequence of problems for which the entries get smaller and smaller, but the condition number converges to 1.0. For this we use the identity with smaller and smaller noise, but with the matrix flipped: 1 k=5; % parameter 2 A = eye (n,n) + rand (n,n) * (10ˆ(-k)); 3 A = flipud (A); growing condition Construct a sequence of problems for which the entries stay generally contained, but the condition number grows. For this we use a built-in Matlab matrix from the gallery: 1 k=5; % parameter 2 A= gallery ( ’randsvd’
Background image of page 1

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

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

This note was uploaded on 07/10/2011 for the course CS 257 taught by Professor Olson during the Spring '08 term at University of Illinois, Urbana Champaign.

Page1 / 4

hw4 - Due: September 25, 2008 CS 257 (Luke Olson): Homework...

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