School of Mathematics
Course 2S3  Introduction to Numerical Computation
19992000
( SF Mathematics as a whole subject within
Natural Science Moderatorships
)
Lecturer: Dr. Sinead Ryan
Requirements/prerequisites: None
Duration:
Number of lectures per week: 3
Assessment: Regular programming assignments, counts 25%
Endofyear Examination: One 3hour annual examination, counts 75%
Description:
 Computer Architecture: memory/processor model,
memory organization, data formats, binary, octal, decimal,
and hexadecimal arithmetic, processor organization, simple
assembly language, preipherals.
 The C Compiler: declarations, input/output, assignment
statements, precedence, if, while, and for statements,
functions, argument passing in functions, pointers,
arrays, system libraries, mathematical function libraries,
memory allocation.
 Mathematica: symbolic manipulation; basic mathematica
operations; differentiation; integration; series expansion;
differential equations.
 Numerical Methods: Root Finding through Bracketing and
Bisection, Newton Raphson method, Golden Section search
in one dimension to find maxima and minima, Numerical
solution of ordinary differential equations (initial
value problems), Numerical Integration, Random Numbers,
Matrices and vectors; Gaussian Elimination; eigenvalues
and eigenvectors
Textbooks:
 The C Programming Language, Kernighan and Ritchie (Prentice Hall)

Numerical Recipes in C,
Press, Teukolsky, Flannery, and Vetterling (Cambridge University Press)
Oct 11, 1999