IMPORTANT ANNOUNCEMETS:
No more homework!
INSTRUCTOR:
Prof. Andrew Knyazev
Office: CU (Dravo Bldg) 644. Phone: (303) 556-8102.
Office hours: Tuesday 4-5 pm, or by appointment.
WWW: http://www-math.cudenver.edu/~aknyazev
TEXTBOOK:
Numerical Mathematics and Computing, 4th Edition
by Ward Cheney and
David Kincaid.
Published by Brooks/Cole Publishing Company
Fourth Edition, 1999
ISBN 0-534-35184-0.
560 pages
TEXT PROBLEMS:
It is highly recommended to solve all problems
from chapters 1-6 whose answers are given in the back of the text.
Solutions to these problems will not collected.
TAKE-HOME QUIZZES (20% of the final grade):
There will be 6 take-home quizzes/home-work sets.
Quizzes consist of roughly 80 problems total from the textbook.
Each problem is worth 2 points.
Of the approximately 160 possible total points,
100 points count toward your final grade.
That is, once the maximum 100 points are reached,
any points that are made do not count toward your grade.
I expect and count on each student obtaining the full 100 points.
Make sure you solve all assigned problems including
those that you do not turn in.
Some exam questions may rely on the assigned problems.
Students need to turn on solutions clearly written on paper, stapled. No faxes or emails will be accepted. The due dates are Wednesdays listed below. I'll collect solutions at the end of the class in person.
It will be confirmed solutions for what sections are to be turned in on the Monday before the Wednesday on which they are due. If you skip class, please ask your classmate or consult this Web page. It's OK to turn in solutions ealier, but
NO LATE SOLUTIONS WILL BE ACCEPTED!
When solving problems, your final solution must contain all digits that are obtained from the computing machine you are using in the final solution. Do not round intermediate results unless otherwise specified by the problem.
DATES:
Q1 9/9 Problem sets: 1.1, 1.2, 2.1, 2.2. Max number of points - 36.
Q2 9/18 Problem sets: 2.3, 3.1, 3.2, 3.3. Max number of points - 34.
Q3 10/2 Problem set: 4.1. Max number of points - 10.
Q4 10/16 Problem sets: 4.2, 4.3, 5.1. Max number of points - 12.
Q5 10/30 Problem sets: 5.2-5.5. Max number of points - 28.
Q6 11/20 Problem sets: 6.1-6.5. Max number of points - 38.
PROBLEMS TO SOLVE:
Problem 1.1 pg. 14/ 2, 3, 8a, b, c
Problem 1.2 pg. 34/ 14, 25, 26, 29, 52
Problem 2.1 pg. 53/ 7, 8 (why?)
Problem 2.2 pg. 68/ 1a, 2b, 4f, 5e, 11c, 16
Problem 2.3 pg. 82/ 5 (test), 24b, d, 28 (show output to verify tests answer, determine machine epsilon)
Problem 3.1 pg. 99/ 8, 12, 13, 22
Problem 3.2 pg. 113/ 1, 20, 21 (prove), 23
Problem 3.3 pg. 129/ 1, 2, 13b, c, 16
Problem 4.1 pg. 155/ 2 (use x=2,0,3,4), 3, 4, 5, 9
Problem 4.2 pg. 169/ 6, 10
Problem 4.3 pg. 180/ 1, 8a
Problem 5.1 pg. 193/ 1, 4
Problem 5.2 pg. 206/ 1, 2, 6, 12, 15
Problem 5.3 pg. 217/ 1, 2, 3, 4
Problem 5.4 pg. 227/ 1, 2, 4
Problem 5.5 pg. 236/ 1 (n = 1, n = 2), 2
Problem 6.1 pg. 220/ 3a, b, 4, 5, 6a, b
Problem 6.2 pg. 266/ 2, 17
Problem 6.3 pg. 278/ 2a, 5
Problem 6.4 pg. 297/ 1a, 4a, b, 6a, b, c, d, 18
Problem 6.5 pg. 315/ 1 (use the zero initial guess!)