This preview shows pages 1–2. 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: CS 205a Fall 2011 Midterm 2 Please write your name and netid on the top right of the first page. The exam is closed book and no calculators are allowed. You have 1 hour and 15 minutes to complete the exam. Multiple Choice (4 x 1 pt each) For each of the following questions, circle ALL answers that are correct. 1. Let A be a symmetric positive definite n n matrix that you attempt to solve using the Conjugate Gradient method. If A has 3 distinct eigenvalues, what is the maximum number of steps (in theory) that the CG solver needs to converge? (a) n (b) 3 (c) n- 3 (d) None of the above is correct. 2. Recall the Newmark method: x n +1 = x n + tv n + t 2 2 (1- 2 ) n + 2 n +1 v n +1 = v n + t (1- ) n + n +1 Which of the following methods is not equivalent for some choice of and parameters? (a) Constant Acceleration (b) 3 rd-order accurate Runge-Kutta. (c) Central Differencing (d) Trapezoidal Rule 3. In general, which of the following methods are the most suitable for solving heat equations?3....
View Full Document
- Fall '07