University Maths Notes -

University Maths Notes: Numerical Methods

Features of a Good Algorithm	Computer Arithmetic
Fixed Point Iteration	The Composite Trapezium Rule
An Upper Bound on the Error at Each Iteration When Finding a Root or Fixed Point	The Bisection Method
Euler's Method for Solving First Order Differential Equations	Introduction to Closed Newton - Cotes Formulae
First Order Runge - Kutta Method	Interpolation Using Lagrange Polynomials
Introduction to Splines	Cubic Splines
Method of Undetermined Coefficients	More on Computer Arithmetic
Open Newton – Cotes Formulae	Rates of Convergence
The Error for Newton – Cotes Formulae	The Composite Simpson's Rule
The Fixed Point Theorem	The Error Term for Polynomial Approximations
The Secant Method	The Newton – Raphson Method
	The Adams Bashforth Method