University College Dublin

School of Mathematical Sciences

Master of Computational Science

master of computational science


Numerical Algorithms

Dr Derek O'Connor

First Semester 2006-2007

Wed.   2pm  to  4pm

Mathematics Seminar Room 

 

derekroconnor[AT]eircom[DOT]net


This page was last updated on May 28, 2010 

Files updated the in last week : none  

PDF version of this page


Purpose

The  formal purpose of this course is to introduce students of the sciences to some of the numerical algorithms that are at the heart of all  numerical computation on digital computers.  An understanding of these algorithms requires a knowledge and appreciation of the  following   fundamentals of  numerical computation :

The informal purpose of the course is to demonstrate that high-quality mathematical software writing is a very demanding and difficult task which is best left to experts. A corollary to this is that there is a lot of junk software in use today because of the inability of users to distinguish between good and bad mathematical software.

Hence, the ultimate purpose of this course is to make you critical mathematical software users or consultants.


 

Course Outline

Some of the links below may be broken while the notes are being updated.

 

1. Introduction (1 week)

1.1  Introduction
1.2  Standard Numerical Problems
1.3  General Numerical Algorithms
1.4  Numerical Software
1.5  Anomalies & Pitfalls

 

4. Non-Linear Equations (3 weeks)

4.1  Non-Linear Equations
4.2  Single Non-Linear Equation
4.3  The Bisection Algorithm
4.4  The Newton Algorithm
4.5  The Secant Algorithm
4.6  Poly-Algorithms
4.7  Zeros of Polynomial

 

2. Computer Arithmetic (2 weeks)

2.1  Numbers  &  Arithmetic
2.2  Number Representation
2.3  Floating Point Arithmetic
2.4  Perturbation Analysis
2.6  Stability of  Algorithms

 

5. Numerical Linear Algebra (4 weeks)

5.1  Linear Equations
5.2  Gaussian Elimination
5.3  Pivoting
5.4  LUP Decomposition
5.5  Inverses and Determinants
5.6  Special Matrices
5.7  Perturbation Analysis
5.7  Iterative Refinement

 

3. Mathematical Review (1 week)

3.1  Sequences, Series, and Limits
3.2  Functions
3.3  Calculus : Derivatives and Integrals
3.4  Normed Linear Vector Spaces
3.5  Contraction Mappings.
3.6  Successive Approximations.      

  • NOTES (NA-3-Latex.PDF 300KB)

  • READINGS :                  

 

6. Iterative Methods for Linear Equations

     6.1  General Iterative Methods
     6.1  Jacobi, Gauss-Seidel and SOR     

     6.3  Sparse Matrices 

 

                                 

Exercises and Assignments   These have been moved to a separate page


Academic Integrity and Plagiarism

Plagiarism is a very serious academic offence.  It is assumed that students understand the meaning and consequences of plagiarism. See Plagiarism Policy and Procedures for UCD's policy and information on plagiarism.

In  courses that require students to write programs for credit, plagiarism is particularly easy  to do and particularly easy to  detect.


Grading

The final grade will have this composition :  Please note that this is the official grade composition. Ignore all others.

2003-4 and 2005-6  exams and solutions are  here   NA-Exam-03-04-SOL.pdf (270KB)  NA-Exam-05-06-SOL.pdf.  (130KB)

The essay,  Making the Grade by Prof Kurt Wiesenfeld of Georgia Tech, should be read by all.


Matlab Notes  

All the latest Matlab reference manuals and user-contributed files are downloadable from :   MATLAB Central


LaTeX Notes & Books

Some notes on getting Matlab output into a LaTeX file along with two LaTeX guides, a book chapter, and a complete book.


Recommended Texts

There is no required text for this course. The notes and links above are required reading and you are responsible for downloading and printing these and to have the appropriate notes with you for each class.

Modern Texts

  1. Dahlquist, Germund & Bjorck, Ake : Numerical Methods in Scientific Computing, Vol 1, SIAM, 2008.
  2. Demmel, James W. :  Applied Numerical Linear Algebra, SIAM, 1997
  3. Golub, Gene H, and Van Loan, Charles F. : Matrix Computations 3rd Ed,  The Johns Hopkins University Press, 1996.
  4. Higham, N.J. :  Accuracy and Stability of Numerical Algorithms 2nd Ed, SIAM. 2002.
  5. Kahaner, D., Moler, C., and Nash, S. :  Numerical Methods and Software, Prentice-Hall, 1989.
  6. Moler, Cleve, B. : Numerical Methods with Matlab, SIAM, 2004. Free download at  http://www.mathworks.com/moler/
  7. Moler, Cleve, B. : Experiments with Matlab, draft. Free download at  http://www.mathworks.com/moler/
  8. Stewart, G.W. : Afternotes on Numerical Analysis, SIAM, 1996.
  9. Stewart, G.W. :  Matrix Computations, Volume 1 : Basic Decompositions, SIAM, 1998.
  10. Trefethen, Lloyd, N.  & Bau III, David,  Numerical Linear Algebra,  Siam, 1997.
  11. Van Loan, Charles , F : Introduction to Scientific Computing  : A Matrix-Vector Approach using Matlab, Prentice-Hall, 2000.
  12. Watkins, D.S. : Fundamentals of Matrix Computations2nd Ed., Wiley, 2002.

Classic Texts

  1. Forsythe, G.E. & Moler C.B. : Computer Solution of Linear Algebraic Systems, Prentice-Hall, 1967.
  2. Forsythe, G.E., Malcolm, M., and Moler, C.B. : Computer Methods for Mathematical Computations, Prentice-Hall, 1977.
  3. Whittaker,  Sir E.T. & Robinson, G. : The Calculus of Observations : An Introduction to Numerical AnalysisDover, 1967, a republication of the 4th ed., 1944. First ed., Blackie & Sons, 1924.  From the Preface of the First Edition, 1924:  [Numerical Analysis] is now included in the syllabus for the Open Competitive Examination for appointments in the Home and Indian Civil Sevices, the Colonial Service, etc.  The present volume represents courses of lectures given at different times during the years 1913-1923 by Professor Whittaker to undergraduate and graduate students in the Mathematical Laboratory of the University of Edinburgh, ...
  4. Wilkinson, James H. : Rounding Errors in Algebraic ProcessesNotes on Applied Science No. 32, Her Majesty's Stationary Office, 1963. Also published by Prentice-Hall 1964. Reprinted by Dover, 2000?
  5. Wilkinson, James H. : The Algebraic Eigenvalue Problem,  Oxford University Press, 1965.

Not Recommended Texts

  1. Press, W.H., Flannery, B.P., Teukolsky, S.A., and Vetterling, W.T. :  Numerical Recipes, Cambridge University Press, 1986, and 2nd Ed 1992 (See NR-Critics)

Software.

Thoughout this course we will be using Matlab, and to small extent Maple.  Both of these are excellent packages but they are expensive (€700-1000  depending on add-ons).  There are  free or cheap alternatives. I have listed some of these on my Alternative Software page. 


Discussion Groups.

There are many discussion groups on Matlab and LaTeX. 

If you have questions about Matlab, LaTex, Maple, etc., these sites may help, but you need practice using them to get the best results.


This is one of the best places to search for technical papers        


Interactive Algorithm Simulators.

These are web-based interactive programs that allow you to see how various algorithms and number systems work.  

http://www.ecs.umass.edu/ece/koren/arith/simulator/

 

http://www.cse.uiuc.edu/iem/


Home Page of Derek O'Connor


Visits since Sept 2004 :