Math/CS 467/667

Spring 2018 University of Nevada Reno

467/667 NUMERICAL METHODS II (3+0) 3 credits

Instructor  Course Section                     Time              Room
------------------------------------------------------------------------
Eric Olson  Math 467/667 Numerical Methods I   TR 10:30-11:45am  DMS106

Course Information

Instructor:
Eric Olson
email:
ejolson at unr dot edu
Office:
Tuesday and Thursday 12 noon DMS 238 and by appointment.
Homepage:
http://fractal.math.unr.edu/~ejolson/467/

Required Texts:

Justin Solomon, Numerical Algorithms: Methods for Computer Vision, Machine Learning and Graphics, CRC Press, 2015.

Supplemental Texts on Numerical Methods:

David Kincaid and Ward Cheney, Numerical Analysis: Mathematics of Scientific Computing, 3rd Revised Edition, Pure and Applied Undergraduate Texts, American Mathematical Society, 2002.

Richard Burden, Douglas Faires and Annette Burden, Numerical Analysis, 10th Edition, Brooks Cole, 2015.

Joe Hoffman and Steven Frankel, Numerical Methods for Engineers and Scientists, Second Edition, CRC Press, 2001.

Classic Texts on Numerical Methods:

Kendall Atkinson, An Introduction to Numerical Analysis, Second Edition, Wiley, 1989.

Richard Hamming, Numerical Methods for Scientists and Engineers, Second Edition, Dover, 1986.

Eugene Isaacson, Analysis of Numerical Methods, Revised Edition, Dover Books on Mathematics, 1993.

Supplemental Texts on Computer Programming:

JTC1/SC22/WG14, C99 Programming Standard, ISO/IEC, 2007.

Simon Long, Learn to Code with C, MagPi, 2017.

Richard Smedley, Conquer the Command Line, MagPi, 2016.

Classic Texts on Computer Programming:

Brian Kernighan, Dennis Ritchie, C Programming Language, 2nd Edition, Prentice Hall, 1988.

Brian Kernighan, Rob Pike, Unix Programming Environment, Pretice-Hall Software Series, 1984.

Student Learning Outcomes

Upon completion of this course
  1. Students will be able to use Taylor and Runge-Kutta methods to solve initial value problems for ordinary differential equations.
  2. Students will be able to use the shooting and finite difference methods to solve boundary value problems for ordinary differential equations.
  3. Students will be able to use numerical techniques to solve elliptic, parabolic and hyperbolic partial differential equations.

Announcements

[20-May-2018] Solutions to Project 2

I have posted my solutions to combined homework and programming project 2, so you can see how I solved the problems. Please let me know if you find any errors.

[14-May-2018] Sample Final Exam

I have prepared a sample final exam to help you study.

[15-May-2018] Final Exam and Project 2

The final exam will be Tuesday, May 15 from 9:50-11:50am in DMS106. Please know the study guides, questions from Exam 1 and Exam 2 (also called Quiz 1 and Quiz 2) answers to both programming projects and the homework problems as well as the convergence of Euler's method. The lecture notes on Gauss quadrature and Taylor's theorem will also be covered. Remember that Programming project 2 is due at the final exam and will count double: both as a programming project and as the final homework assignment.

[13-May-2018] Solution to Exam 2

My solutions to Exam 2 (also called Quiz 2) are available to help you study for the final exam. I have also posted solutions to the second part of the first homework assigment.

[12-May-2018] Solution of Programming Project 1

I have posted my solution of programming project 1 for you to compare with your own solutions.

[07-May-2018] Convergence of Euler's Method

I have made lecture notes on the convergence of Euler's method to help you study for the final exam.

[03-May-2018] Exam 2

Exam 2 will be in class on Thursday May 3. Here is a sample exam to help you study for the quiz.

[18-Mar-2018] Programming Project 1

Programming project 1 is now available. Please begin it as soon as possible.

[13-Mar-2018] Homework 1 Solutions

I have made homework 1 solutions to part 1 and solutions to part 2.

[11-Mar-2018] Lecture Notes on Gauss Quadrature

I have made lecture notes on Gauss Quadrature to help you study for Exam 1.

[26-Feb-2018] Lecture Notes on Taylor's Theorem

I have made lecture notes on Taylor's Theorem to help you study for Exam 1.

Extra Credit

  1. Consider the finite difference approximation of the derivative

    f'(x) ≈ (f(x+h)-f(x-h))/(2h)

    Find conditions on f which guarantee there exists a value m>0 such that

    m h2 ≤ |f'(x)-(f(x+h)-f(x-h))/(2h)|

    for all h sufficiently small. Give an explicit estimate for m.

  2. Find the constant K for the trapezoid method such that

    |∫ab f(x)dx-rintavg(n,a,b,f)| ≤ K h2 where h=(b-a)/n

    that is better than the one given in class.

Sample Code

Programming Assignments

Homework Assignments

Grading

     2 Exams                   50 points each
     1 Final Exam             100 points
     2 Homework Assignments    20 points each
     2 Programming Projects    20 points each
     In-class Lab Work         60 points
    ------------------------------------------
                              340 points total
Exams and quizzes will be interpreted according to the following grading scale:
    Grade        Minimum Percentage
      A                 90 %
      B                 80 %
      C                 70 %
      D                 60 %
The instructor reserves the right to give plus or minus grades and higher grades than shown on the scale if he believes they are warranted.

Final Exam

The final exam is scheduled for

Equal Opportunity Statement

The Mathematics Department is committed to equal opportunity in education for all students, including those with documented physical disabilities or documented learning disabilities. University policy states that it is the responsibility of students with documented disabilities to contact instructors during the first week of each semester to discuss appropriate accommodations to ensure equity in grading, classroom experiences and outside assignments.

Academic Conduct

Bring your student identification to all exams. Work independently on all exams and quizzes. Behaviors inappropriate to test taking may disturb other students and will be considered cheating. Don't talk or pass notes with other students during an exam. Don't read notes or books while taking exams given in the classroom. You may work on the programming assignments in groups of two if desired. Homework may be discussed freely. If you are unclear as to what constitutes cheating, please consult with me.

The following is new university policy: Surreptitious or covert video-taping of class or unauthorized audio recording of class is prohibited by law and by Board of Regents policy. This class may be videotaped or audio recorded only with the written permission of the instructor. In order to accommodate students with disabilities, some students may be given permission to record class lectures and discussions. Therefore, students should understand that their comments during class may be recorded.


Last Updated: Thu Jan 18 13:22:52 PST 2018