exam2f10 - Foundations of Computational Math I Exam 2...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Foundations of Computational Math I Exam 2 Take-home Exam Open Notes, Textbook, Homework Solutions Only Due beginning of Class Wednesday, December 1, 2010 Question Points Points Possible Awarded 1. Iterative Methods 25 for Ax = b 2. Iterative Methods 30 for Ax = b 3. Nonlinear Equations 30 4. Nonlinear Equations 25 Total 110 Points Name: Alias: to be used when posting anonymous grade list. 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Problem 1 (25 points) Suppose B R n × n is a symmetric positive definite tridiagonal matrix of the form B = ± D r L L T D b ² where n = 2 k , D r and D b are diagonal matrices of order n/ 2, L is a lower triangular matrix with nonzeros restricted to its main diagonal and its first subdiagonal, and U is upper triangular matrix with nonzeros restricted to its main diagonal and its first superdiagonal. Assume that Ax = b can be solved using Jacobi’s method, i.e., the iteration converges acceptably fast. Partition each iterate x i into the top half and bottom half, i.e., x i = ³ x ( top ) i x ( bot ) i !
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 07/25/2011 for the course MAD 5403 taught by Professor Gallivan during the Spring '11 term at University of Florida.

Page1 / 14

exam2f10 - Foundations of Computational Math I Exam 2...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online