Courses



Introduction to Numerical Algorithms, Fall 2008:
The Syllabus .



Problem Sets:
Problem Set 1 due October 2nd before start of lecture.
Problem Set 2 due October 26th before start of lecture.
Problem Set 3 due November 16th before start of lecture.
Problem Set 4 due November 30th before start of lecture.

A superb Matlab tutorial .

Matlab code
The Bisection method.

bisection_simple.m is a bare bones code. This is to start you off with some simple code.

bisection_plots.m is bisection_simple.m, augmented with plots to illustrate the algorithm's progress. Your code should include features like this when it helps you better understand what the algorithm does.

bisection.m and f_bisection.m go together. The bisection code calls the function f_bisection which makes the algorithm portable - that is easy to apply to other functions. This is to illustrate how to use functions and use them in a regular m-file.

The Secant method.

secant.m and f_secant.m go together.


Newton's method.

newton.m and f_newton.m go together.


LU factorization.

lu_factorization.m


Jacobi Method.

jacobi.m and two examples: jacobi_example1.m and jacobi_example2.m


Gauss-Seidel Method.

gauss_seidel.m and two examples: gauss_seidel_example1.m and gauss_seidel_example2.m


Power Method.

power_method.m


Euler's method.

euler.m and f_euler.m go together.


Trapezoidal and Midpoint methods.

trap.m and midpoint.m call f_euler.m.


Trapezoidal method using predictor corrector with Euler.

trap_pc.m, which calls f_euler.m.


Boundary-Locus method for computing stability region boundaries of linear multistep methods.

stability.m.