The course meeting time is 8:30MWF in HH218. For official detail see the Department Handbook.
The textbook is
Grades will be assigned with approximately the following weights:
There will be written and programming assignments. The test will be held in class about November 1.
Information about the course can always be found at this URL:
From the text: 1.1: 10,14; 1.2: 4,18,22; 1.3: 4,6,10. Due (Note change!) Sept. 25.
From the text: 2.1: 4; 2.2: write a program to implement the fixed-point iteration algorithm (with g called by a function) and use it in problems 8 and 12; 2.3: 6,10; 2.4: 4; 2.5: implement Steffensen's method and use it in problems 4 and 6. Due October 11.
From the text: 2.6: 6; 3.1: 8, 18; 3.2: 10; 3.3: 4; 3.4: write a program to implement Algorithm 3.4 and use it in 6, 16, 18. (Feel free to write programs to implement algorithms used in the other problems! but this is not required.) Due October 25. A drop box will be set up for source/executables.
From the text: 4.1: 10 a); 4.3: 8; 4.4: 16; 4.5: 4 a), b); 4.6: write a program to implement Algorithm 4.3 and use it in 4 a), b). Due November 10. Use the drop box for source/executables.
From the text: 5.2 : 6; 5.4 : 10 (you will be better off to write a program implementing Alg 5.2); 5.6 : 4. b), c), d) (program helpful); 6.2 : 8 (check your results!); 6.5 : 4. Due November 29. Use the drop box for source/executables.