The bisection method
Test function for the bisection method
Fixed point iteration to generate the Mandelbrot set
Newton's method
Test function for Newton's method
A fixed point iteration scheme
The function f in the fixed point iteration scheme
The function g in the fixed point iteration scheme
Gaussian elimination with column pivoting
Solves an upper triangular system Ux = b by back substitution
Compute the LU factorization of a matrix A
Solves Ax = b using the LU factorization of A
A test example
Newton's method in n dimensions
An example for Newton's method in n dimensions
Approximating a Derivative by a Difference Quotient :
to illustrate the phenomenon of cancellation
Cholesky factorization of a symmetric positive definite (pd) matrix
Solves a lower triangular system Lx=b by forward substitution
Householder QR factorization : Algorithm 3.1 in Heath
A subroutine which computes Q^Tb given the rhs vector b
Forms the reduced orthogonal matrix Q in the QR factorization
The complete code that computes the reduced QR factorization of a given matrix
Generates the random symmetric positive definite matrix A and rhs vector b
for Problem 4 on Homework 5
The line search routine to be used in Homework 5
The steepest descent method with line search for unconstrained optimization
Fox-Rabbit pursuit simulation
A MATLAB session with the fox-rabbit pursuit simulation
CAAM 353 -- Take Home final : 3D surface plot for Problem 3(c)
Last Updated: 24th-April-03
kartik@caam.rice.edu
Webmaster : Kartik Krishnan
© Copyright 2003 (Y2K3)