Syllabus

Math 565: Applied Numerical Methods I

Fall 2013

Meeting Times: Lect: 12:00 noon - 12:50 pm Mon., Tues., Wed. & Fri., HB 112
Lab: 12:00 noon - 12:50 pm Thurs., HB 204
Sep. 25 - Dec. 6
Instructor: Dr. Jim Schwing
Office: HB 219-C
Phone: 963 - 1432
E-mail: schwing@cwu.edu
Web Page: http://www.cwu.edu/~schwing
Office hours: 2:00 - 3:00 pm M W Th and 1:00 - 2:00 pm F,
during my other listed office hours and by appointment.
Text: Ward Cheney and David Kincaid, Numerical Mathematics and Computing, 7th Edition, Brooks/Cole, 2013.

Grading
Exams (2 - 26% each) 52%
Homeworks 24%
Projects 24%

Grading Scale
95 - 100 A
90 - 94 A -
87 - 89 B +
83 - 86 B
80 - 82 B -
77 - 79 C +
73 - 76 C
70 - 72 C -
60 - 69 D

Learning Outcomes and Course Objectives: This course is a two term sequence that looks at the theoretical and practical aspects of numerical mathematics and computing including the design implementation of numerical algorithms and associated software.

The basic learning outcomes of these courses are:
  • Students will be able to describe floating point representation and how errors arise in computer systems.
  • Students will demonstrate methods for solving linear systems.
  • Students will demonstrate methods for solving nonlinear systems.
  • Students will build programs for numerical interpolation and differentiation.
  • Students will build programs for numerical integration.
  • Students will design with spline functions.
  • Students will demonstrate methods for solving initial value problems.
  • Students will be able to describe and build applications involving least square methods.
  • Students will be able to describe and build applications involving Fourier series.
  • Students will be able to describe Monte Carlo Simulation and build applications involving simulation.
  • Students will demonstrate methods for solving boundary value problems.
  • Students will demonstrate methods for solving partial differential equations.
  • Students will be able to describe the theory of minimization of functions.
  • Students will build programs using linear programming.
Honor Code: All work turned in for credit, including exams and all components of the project, are to be the work of the student whose name is on the exam or project. For all project components, the student can receive assistance from individuals other than the instructor only to ascertain the cause of errors. Thus you can get help if you need it to figure out why something doesn't work. You just can't get help from anyone, other than the instructor or TA, to figure out how to make something work. All solutions turned in for credit are to be your individual work and should demonstrate your problem solving skills, not someone else's.

The following text should appear on all assignments:
I pledge that I have neither given nor received help from anyone other than the instructor for all program components included here.

The student should sign his or her name under the pledge. Any deviation from this policy is an honor code violation and will be treated as such if detected. It should be included as a comment in your source code and part of your written report.

First violation: Students must meet with the instructor. In most cases, the grade will be split between the authors of the copied programs.
Second violation: Students will receive no credit for the assignment. An incident letter will be placed on file in the Computer Science Department.

Class Attendance: Class attendance is expected.

ADA Statement: Students who have special needs or disabilities that may affect their ability to access information and/or material presented in this course are encouraged to contact me or the Director of Disability Support Services, on campus at 963-2171.

Caveat: The schedule and procedures for this course are subject to change. It is the student's responsibility to learn of and adjust to changes.

Course Schedule

Day Date Topic Readings - Item Due
1 Sep 25 Introduction Reading: Ch 1.1
L1 Sep 26 Lab 0  
2 Sep 27 Introduction (Cont.) & Mathematical Preliminaries Reading: Ch 1.1. & 1.2
3 Sep 30 Mathematical Preliminaries Reading: Ch. 1.2
4 Oct 1 Floating Point Representation Reading: Ch. 1.3
5 Oct 2

Floating Point Representation & Loss of Significance

Reading: Ch. 1.3 & 1.4

L2 Oct 3 Start Project 1 Project 0 Due
6 Oct 4 Loss of Significance Reading Ch. 1.4

7

Oct 7

Problem Set - Chap. 1

 

8 Oct 8

Gaussian Elimination

Reading: Ch. 2.1

9 Oct 9

Gaussian Elimination & Extensions

Reading: Ch. 2.1 & 2.2

L3 Oct 10    
10 Oct 11 Extensions (cont.) Reading: Ch. 2.2
11 Oct 14

Tridiagonal & Banded Systems

Reading: Ch. 2.3

12 Oct 15

Problem Set - Chap. 2

 

-- Oct 16 Faculty Development Day - No Classes  
L4 Oct 17 Start Project 2 Project 1 Due
13 Oct 18 Bisection Method Reading: Ch. 3.1
14 Oct 21 Bisection Method & Newton's Method Reading: Ch. 3.1 & 3.2
15 Oct 22 Newton's Method Reading: Ch. 3.2
16 Oct 23 Secant Method Reading: Ch. 5
L5 Oct 24 Start Project 3 Project 2 Due
17 Oct 25 Problem Set - Chap. 3  
18 Oct 28 Q & A Ch 1 - 3
19 Oct 29 Exam 1 Ch 1 - 3
20 Oct 30 Polynomial Interpolation Reading: Ch.4.1
L6 Oct 31    
21 Nov 1 Polynomial Interpolation Reading: Ch.4.1
22 Nov 4 Errors of Polynomial Interpolation Reading: Ch. 4.2
23 Nov 5 Estimating Derivatives & Richardson Extrapolation Reading: Ch. 4.3
24 Nov 6 Problem Set - Chap. 4  
L7 Nov 7 Start Project 4 Project 3 Due
25 Nov 8 Catch-up Day  
-- Nov 11 Veteran's Day - No Classes  
26 Nov 12 Trapezoid Method Reading: Ch. 5.1
27 Nov 13 Trapezoid Method & Romberg Algorithm Reading: Ch. 5.1 & 5.2
L8 Nov 14 Start Project 5 Project 4 Due
28 Nov 15 Romberg Algorithm Reading: Ch. 5.2
29 Nov 18 Simpson & Newton-Cotes Rules Reading: Ch. 5.3
30 Nov 19 Simpson & Newton-Cotes Rules (cont.) & Gaussian Quadrature Reading: Ch. 5.3 & 5.4
31 Nov 20 Gaussian Quadrature Reading: Ch. 5.4
L9 Nov 21 Continue Project 5  
32 Nov 22 Problem Set - Chap. 5  
33 Nov 25 Low Degree Splines Reading: Ch. 6.1
34 Nov 26 Natural Cubic Splines Reading: Ch. 6.2
-- Nov 27 - 29 Thanksgiving Break - No Classes  
35 Dec 2 Natural Cubic Splines & B Splines Reading: Ch. 6.2 & 6.3
36 Dec 3 B Splines Readings: Ch. 6.2
37 Dec 4 Problem Set - Chap. 6  
L10 Dec 5 Continue Project 5 Project 5 Due
38 Dec 6 Q & A  
-- Dec 12 Final Exam 12 noon - 2 pm -- subject to change - check Registrar's schedule when posted

Bar

Last updated: Sep. 23, 2013

JL Schwing schwing@cwu.edu
Department of Computer Science

All images and text are ©2013 Central Washington University®
This material is subject to copyright and unauthorized use or copying is prohibited.