This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Program 3 Foundations of Computational Math 1 Fall 2011 Due date: via email by 11:59PM on Monday, 21 November 1 General Task Your task is to implement and test the capabilities of solving a particular family of linear systems via the Jacobi, Gauss Seidel, and Symmetric Gauss Seidel methods. Your code must be able to run in single and double precision. It should also efficiently store the matrix and perform the required matrix-vector products and linear system solves Mz k = r k . You must run particular scenarios and analyze the results. The answers to the questions below must be presented in a clear and organized fashion. 2 Submission of Results Expected results comprise: 1. A document describing the tests used, the results generated, and answers to the ques- tions posed below. 2. The source code, makefiles, and instructions on how to compile and execute your code including the math departments machine used if applicable. 3. Code documentation should be included in each routine. These results should be emailed to email@example.com by 11:59PM on the due date above. You may be asked to demonstrate your code if your document does not completely convince me that you tested your code sufficiently. 3 Code Details 3.1 Matrix Family You will write code to solve Ax = b where A is an n n tridiagonal Toeplitz matrix with the form T = 1 . . . . . . . . . 1 1 . . . . . . 1 1 . . . . . . . . . . . . . . . . . . . . . 1 1 . . . . . . 1 1 . . . . . . . . . 1 1 3.2 Requirements of Code Your code must use O (1) storage for the matrix A for any size n . The computation of the matrix vector product Av w must be done efficiently in O ( n ) computations using the efficient storage scheme....
View Full Document
This note was uploaded on 11/27/2011 for the course MAD 5403 taught by Professor Gallivan during the Spring '09 term at FSU.
- Spring '09