program2

program2 - 3 Implement the Schur algorithm for symmetric...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Program 2 Numerical Linear Algebra 1 Fall 2010 Due date: via email by 11:59PM on Monday, 10/4/10 1. Implement the Cooley-Tukey FFT. Compare your results to the DFT as well as library routines that can be found on the internet and in most computational environments such as MATLAB. When comparing to library routines be sure to check the normal- izations used. 2. Implement a fast matrix vector product for circulant and Toeplitz matrices. This code will be used later for iterative methods on structured matrices.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 3. Implement the Schur algorithm for symmetric positive definite Toeplitz matrices. Com-pare your results to a Cholesky factorization that ignores the structure of a matrix. The solution should include the subroutine or Mfile as well as a test driver and the appropriate documentation. The test driver and documentation should include a description of the testing you did and the necessary code to repeat it. 1...
View Full Document

This note was uploaded on 07/21/2011 for the course MAD 5932 taught by Professor Gallivan during the Fall '06 term at FSU.

Ask a homework question - tutors are online