Problems are from the assigned textbook: Richard L. Burden and J. Douglas Faires, Numerical Analysis, 10th edition, Brooks/Cole, 2016.

The following is a minimal set of problems you should be able to solve by the end of the course. Additional practice (e.g. review after each chapter) is up to your discretion.

Date Assigned	Topic	Problems

Sep 14	round-off error	§1.2; #7d, 15c
	numerical derivatives	§4.1; #2a, 5a, 26
	bisection method	§2.1; #6b, 8, 13, 17

Sept 25	quiz #1

Sept 26	fixed-point iteration	§2.2; #1, 2, 7, 9, 20, 23
	Newton’s method	§2.3; #5(a,d), 6d, 22

Oct 5	quiz #2

Oct 5	order of convergence	§2.4; #6, 7, 8, 9, 10, 11, 14

Oct 12	quiz #3

Oct 12	polynomial interpolation	§3.1; #1ab, 3ab, 7a, 21
	trapezoid & Simpson’s rule	§4.3; #1ac, 3ac, 5ac

Oct 23	midterm exam

Oct 23	composite trapezoid & Simpson	§4.4; #1ac, 3ac, 11ab, 13ab
	Gaussian quadrature	§4.7; #1ac, 5, 11, 12

Nov 2	quiz #4

Nov 2	adaptive quadrature	§4.6; #1a, 3a
	Taylor polynomials	§1.1; #9, 11, 16, 17, 19, 21
	Chebyshev polynomials & interpolation	§8.3; #1ab, 3ab, 7

Nov 29	Newton’s method for nonlinear systems	§10.2; #1a, c
	Jacobi & Gauss-Seidel iteration	§7.3; #1a, 3a


??	FINAL EXAM