Quizz2_solutions - n 2 p Iterative methods are even more...

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

View Full Document Right Arrow Icon
Quizz #2 – Solutions 1. a) 2. c) 3. d) 4. b) 5. d) 6. a) and b) 7. a) 8. c) 9. For large systems, the direct solution of Ax = b is very expensive computationally, and iterative solving can save time if a good approximation of the solution can be found in p iterations with p ± n : for a full matrix, Gauss elimination has a cost that varies like n 3 , while Jacobi or Gauss– Seidel methods cost about
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: n 2 p . Iterative methods are even more attractive for systems where A is sparse but not simply tridiagonal (very common in engineering problems to solve diĀ±erential equations in 2D for example): Gauss elimination can still cost about n 3 while each iteration of Gauss-Seidel and Jacobi methods have only a cost that varies linearly with n . 3...
View Full Document

This note was uploaded on 10/11/2011 for the course MAE 107 taught by Professor Rottman during the Summer '08 term at UCSD.

Ask a homework question - tutors are online