Instructor: Dr. Tsorng-Whay Pan

• Office: 683 PGH
• Phone: (713) 743-3448
• Office hours: MW: 3 PM - 4 PM or by appointment
• e-mail: pan@math.uh.edu

• Time: MW: 4:00 PM - 5:30 PM
• Room: 301 AH
• Prerequisites: Math 2431 (Linear Algebra), Math 3331 (Differential Equations). Ability to do computer assignments in one of the following programming languages: FORTRAN, C, Matlab, Pascal, Maple, or Mathematica; or consent of instructor.
• Textbook: R.L. Burden & J.D. Faires, Numerical Analysis, 8th edition, Thomson, 2005.
• Covered Material: Chapters 1-6.
• Course Homepage: http://www.math.uh.edu/~pan/math4364-2009-fall.html

• Exams: There will be two exams. Each exam is worth 100 points.
• Exam 1: Oct. 14, 2009
• Exam 2: Dec. 2, 2009
• Projects: There will be two projects. The total of two projects is worth 25 points.
• Project 1: due on Nov. 16
• Project 2: due on Dec. 9
• Homework: Homework assignments will be given in the class. You may need to use programs provided by authors to solve some exercises. The total of homework assignments is 75 points.
• Makeup: NO MAKEUP of any exams and no late homework assignments.
• The total score = Homework + 2 Projects + 2 Mid-Exams = 75 + 25 + 200 = 300.

• Last day to drop a course or withdraw without receiving a grade: Sep. 8, 2009.
• Last day to drop a course or withdraw: Nov. 4, 2009.
• In each exam, BRING YOUR STUDENT I.D. WITH YOU AS TAKING EXAM.
• Those persons who may be in need of additional help under Americans with Disabilities Act guidelines should approach me for consideration of the matter.

Download the programs from Authors' Web Page
• Chapter 1: none
• Chapter 2:
  • 2.1 (due on Sep. 16): 3a (do not use code), 5b (use code), 15 (use code)
  • 2.2 (due on Sep. 16): 1a, 1d, 5 ((i) use the function g(x) given in the answers at the end of textbook, (ii). can you find another "good" g(x)?), 11b (verify that two conditions are satisfied on [2.5, 3] for the convergence of the fixed-point iteration and then work out (i) and (ii).).
  • Solutions of Homework Assignments of Sections 2.1 and 2.2.
  • 2.3 (due on Sep. 23): 1 (do not use code), 3 (do not use code), 5c, 7c, 9c, 16.
  • Solutions of Homework Assignment of Section 2.3.
  • 2.4 (due on Sep. 30): 1b (P0=-1.5 and P0=-2), 3b (P0=-1.5 and P0=-2), 6, 7a.
  • Solutions of Homework Assignment of Section 2.4.
  • 2.5 (due on Sep. 30): 3.
  • Project 0 (due on Sep. 30)
• Chapter 6:
  • 6.1 (due on Sep. 30): 3a (do not use code), 5a (do not use code).
  • Solutions of Homework Assignments of Sections 2.5 and 6.1 and Project 0.
  • 6.2 (due on Oct. 7): 9a (do not use code), 11a (do not use code), 13a (do not use code), 15a (do not use code).
  • 6.5 (due on Oct. 7): 5a (do not use code), 5c (do not use code), 7a (do not use code), 7c (do not use code).
  • 6.6 (due on Oct. 7): 3b (do not use code or algorithm), 5b (do not use code or algorithm), 7b (do not use code), 13 (use code), 22.
  • Solutions of Homework Assignments of Sections 6.2, 6.5 and 6.6.
• Chapter 3:
  • 3.1 (due on Oct. 21): 1a, 3a, 17, 19d (do not use any code for these problems).
  • Solutions of Homework Assignments of Section 3.1..
  • 3.2 (due on Oct. 28): 3b, 7 (do not use any code for these problems). Extra problem: check whether f[x1,x2,x3] and is equal to f[x2,x1,x3] and whether f[x1,x2,x3] and is equal to f[x1,x3,x2].
  • Solutions of Homework Assignments of Section 3.2..
  • 3.4 (due on Nov. 4): 3d (use code), 5d (use the results from 3d), 11 (do not use code), 14 (do not use code).
• Project 1: due on Nov. 16
• Chapter 4:
  • 4.1 (due on Nov. 4): 1a, 3a, 5a, 7a.
  • Solutions of Homework Assignments of Sections 3.4 and 4.1..
  • 4.3 (due on Nov. 11): 1b, 3b, 5b, 7b, 15, 17.
  • 4.4 (due on Nov. 11): 13a, 13b (no need to compute the approximating values).
  • 4.7 (due on Nov. 23): 1a, 2a.
• Chapter 5:
  • 5.2 (due on Nov. 23): 1a (work with h=0.25 and do not use code), 3a, 5d (work with h=0.1, 0.05, and 0.025), 7d (compute actual errors and find the largest for h=0.1, 0.05 and 0.025, respectively. Does the largest error behave as discussed in Theorem 5.9?).
  • 5.3 (due on Nov. 23): 1a, 3a (work both problems with h=0.1. You can modify the Euler code for these two problems).
  • 5.4 (due on Nov. 30): 3d, 11d, 15d.
  • 5.6 (due on Nov. 30): 7d.
  • 5.9: none.
  • 5.10: none.
  • 5.11: 10, 12.
• Project 2: due at 5PM on Dec. 9