|
Sergey A. Dyachenko
sergeydy AT buffalo DOT edu
|
Numerical analysis is one of the branches of applied mathematics that studies the mathematical
aspects of algorithms implemented on modern computers. This course introduces basic concepts of
numerical analysis such as error, convergence, stability and etc. Computational tools are used
to program and employ algorithms and verify their performances. Programming skill is not required
and there will be short intro to computing in Matlab, or GNU Octave. Besides theoretical work,
various applications and physical/engineering problems are covered.
|
TR 12:30-1:50 pm at 205 Math
|
|
Wednesday 2:00-3:00pm Math Bldg 312, and by appointment
|
We will be using textbook by T. Sauer on Numerical Analysis and lecture notes that were kindly
shared by Professors S. Lau (UNM) that originate from lectures given in Brown.
Optional textbook: Ackleh et al. "Classical and Modern Numerical Analysis".
|
HW/Weekly Schedule
|
Midterm Exam: TBA
Midterm Exam: TBA
Final Exam: See Final Exam Schedule
|
|
The grade for the class is assigned at the end of the semester after the Final exam is graded.
All missing work (HWs/Exams) is awarded zero points, so be sure to turn-in on time. The
written work is expected to be neat: illegible work will not be graded. Answers to problems
without supporting work or solution will receive no credit.
|
Homework should be turned in on the due date. All written HW must be stapled. One lowest HW
score is dropped. You are encouraged to cooperate while doing homework, but you are expected
to complete the homework on your own and to write the solutions in your own words, and not
contain pieces taken verbatim from elsewhere. HWs that look too much alike will not be counted.
No late homework will be accepted.
|
|
No make-up exam will be given unless you contact me in advance with written authorization from
University to miss the exam (illness, family emergency, active participation in athletic events).
|
|