HW 6

1. Newton's method applied to finding complex cube roots of 1.
	(LyX document in case you're interested.)

2. 	a	Complete your Lagrange polynomial interpolant code.
		b	Test it on the Runge function with 13 equally spaced nodes in [-1,1].
		c	Test it on the Runge function with “Chebyshev” nodes:
				xdata:=[seq( (xmin+xmax)/2 + (xmax-xmin)/2*cos((2*i-1)*Pi/(2*n)),i=1..n)];
			Comment on the difference between the results of b and c.

As usual, this should be submitted as report containing everything in a single file.

Please present Problems 1 and 2 as separate "chapters" in your report.

I will be enforcing the programming practice of 
"no data redundancy" by having the grader take
off points for each numerical datum that appears more than
once in a program. For example, if the maximum age in your
HW5 code is 110, you should set
amax:=110
and the number 110 should not appear anywhere else in
your code. As I said in class removes the danger
of mistakenly having different maximum ages in
different parts of the code, and also allows you
to change the maximum age very easily if you decide
you want to.