Math 311 Syllabus
Up

Math 311-1  Spring 2000 Introduction to Numerical Analysis
 
Classroom Hours

MWF 10:00-11:50am

Classroom Location

112 TMCB

Instructor

Sum Chow (http://www.math.byu.edu/~schow)
308 TMCB

Email/ Phone

schow@math.byu.edu
(801)378-9088

Class Web Page:

http://www.math.byu.edu/~schow/math311.html

Anonymous Suggestion Mailer: 

suggestions4NA@hotmail.com

Office Location and Hours:

MWF 1-2pm and by appointment. (On most days when I am not attending seminar or committee meeting, you should be able to find me in my office during the hours of 2pm-5pm or later).

Textbook: Burden R.L. and J. D. Faires, Numerical Analysis, Sixth edition, Brooks/Cole, Pacific Grove, CA, 1997.

Course Objective: To familiarize the students with the fundamental concepts in numerical analysis and to enable them to apply materials learned in the course to determine the numerical solutions efficiently and to assess the quality of the solutions.

Pre-requisite and Syllabus:

Calculus (Math 112, 113), and computer literacy. This course will consider problems from the following areas: root finding, floating point systems, solution of linear systems using direct or iterative solvers, interpolation, curve fitting, numerical differentiation and integration, multiple integrals, least squares. The following topics listed in the catalog are covered in Math 411 instead: rational approximations, Fourier and other orthogonal methods. We will be covering chapters 1-4, 6-7 and 8.1-8.2 in the textbook.

Lab Information:

Laboratory work is an integral part of the course but lab sessions will only be held infrequently.   There will be some orientation sessions during the first two weeks of instruction. More information regarding lab location and after hours access will be provided in class.  Please ensure that you are able to log onto the Route Y intranet prior to attending the first lab session. You are encouraged to make use of the open labs on campus.
 

Homework and Projects

Homework will be normally be collected each week on Monday.  Homework and project that are more than two days late will be accepted subject to reduced credit at the rate of 10% per class day.

Collaborative discussion is encouraged when completing homework and project assignments.  Plagiarism is not acceptable.  When working on programming assignments,  each student who lacks adequate computer skills may team up with another student who is proficient in programming.  It is understood that the "non-pogramming" students have the responsibility to type in and to compile the program.

Homework Schedule

Projects Schedule

Tests:

Two tests are currently scheduled.  First test: May 11-12.  Second Test: May 25-26.  These tests will be given at the testing center.  Each test has a three hour limit and may be taken on  Thursday or Friday as scheduled.  Each student is allowed to bring along a calculator and a 8.5" by 11" note sheet to the test.  Other materials including computers, books, classnotes, etc  are not allowed. Made up tests cannot be arranged except in case of emergency or absence due to official university business.  If you want to attend, e.g.,  your sister's wedding or your nephew's baptism, you may arrange to take the test up to a week prior to but not after the set test date.

Final:

The final is scheduled on Thursday, June 15, 2000 at 11:00 a.m. to 12:50 p.m.   The final will be comprehensive.

Course Grade:

Course grade will be determined via the following distribution:
 
 
Homework 20 %
Projects (3) 20 %
Tests (2) 30 %
Final 30 %

Math 311-1 Spring 2000 (Tentative) Course Schedule  (Last revised Apr 28, 2000)
 
Mon Wed Fri
Apr 26  Overview

2.1 Bisection 

Apr 28 

2.3 Newton's method
2.2 Fixed Points

May 1

Lab (Basic Matlab/Maple)
1.2 Floating Point Systems

May 3
Lab (Numerical Experiments)
1.3 Algorithm and Convergence
2.4 Error Analysis
May 5

2.5 Aitken's method
2.6 Roots of Polynomials

May 8

4.1 Numerical differentiation
4.2 Richardson's Extrapolation

May 10 

Review/Catchup

May 12 Test I (Ch  1-2, 4.1-4.2)

6.1 Gauss Elimination
6.2 Pivoting

May 15

6.3,6.4, 7.1, 7.2
Basic Linear Algebra

May 17

6.5 LU factorization
7.4 Stability estimate

May 19

6.6 Special matrices
Catchup

May 22

Review/Catchup

May 24 

7.3 Classical Iterative methods

May 26 Test II  (Ch 6, 7 ex 7.3)

3.1 Lagrange Interpolation
3.2 Divided difference

May 29

Holiday

May 31

3.3 Hermite Polynomial
3.4 Cubic Splines

Jun 2

4.3 Newton-Cotes
4.4 Composite Rule

Jun 5

4.5 Romberg Integration
4.6 Adaptive Quadrature

Jun 7

4.7 Gauss Quadrature
4.8 Multiple Integral

Jun 9

8.1 Discrete least squares
8.2 Continuous least squares

Jun 12

Review/Catchup

For homework schedule, click here.

Project schedule will be posted on the project page.

Back to class web page.