161 : Introduction to Numerical Computing

JF Two-subject Moderatorship, JF Theoretical Physics, SF Two-subject Moderatorship, SF Natural Sciences.

Timetable Lectures Tuesday, 12:00 - 12:50 in   Joly Lecture Theatre 4 Wednesday, 15:00 - 15:50 in   Chemistry Lecture Theatre 4 Tutorials 161 on Monday, 15:00 - 15:50 in   EELT1 2S3 on Wednesday, 16:00 - 16:50 in  Joly Lecture Theatre 4

Lecturer: Dr. Sinéad Ryan

This course aims to introduce the student to C programming and to numerical methods

Handouts The handouts from class can all be found here Submitting and Running your C programs Details about compiling and running programs, along with homework submission instructions are here in Postscript or in PDF Tutorials and Homework Tutorial sheets are here (so are some solutions) Homework assignments are here (and so are some solutions) Homework Grades Click here for the homework grades so far this year - p01.c, p02.c, p03.c, p04.c, p05.c and p06.c Some information for exams Solutions to the June 2000 exam in Postscript or PDF Solutions to the June 2002 exam in Postscript or PDF (Further solutions will appear over the coming months...)

Hilary and Trinity Terms: Notes from class (chapters 3 and 6 were covered in Michaelmas term) Chapter 1: Root finding Postscript  PDF Chapter 2: Integration Postscript  PDF Chapter 3: A bit more C: file I/O Postscript  PDF Chapter 4: Differentiation Postscript  PDF Chapter 5: Extrema: the golden section seach Postscript  PDF Chapter 6: Still more C: vectors and matrices Postscript  PDF Chapter 7: Linear AlgebraI: tridiagonal matrices and Gaussian elimination Postscript   PDF Chapter 8: Linear AlgebraII: Gaussian elimination on general nxn matrices Postscript  PDF Chapter 8 (cont) Linear AlgebraIII: Notes on conditioning and stability Postscript   PDF Chapter 8 (cont) Linear AlgebraIV: Conditioning and stability continued Postscript   PDF Chapter 9 Random Numbers: Notes on generating random numbers (integers and reals) Postscript   PDF Chapter 10 Sorting: Sorting and searching algorithms including bubble, selection, merge and quicksort Postscript   PDF Chapter 11 Structures in C: Notes on defining and using structures in C Postscript   PDF C Programs from class The programs to date, including the data tables for Euler and Runge-Kutta, are here You will find copies to view and to download. Some useful links A useful webpage about IEEE floating point notation Java applet for sorting algorithms Click on the button below to see how the different sorting algorithms work.

send mail to ryan@maths.tcd.ie