Unformatted text preview: double-precision words For the largest problem (almost 70 times as much as For the AMD reordering). Gauss-Seidel took a large amount oF time per iteration. This is an artiFact oF the implementation, since it is a bit tricky to get MATLAB to avoid working with the zero elements when accessing a sparse matrix row-by-row. Challenge: look at the program in gauss seidel.m and try to speed it up. A better version is provided in the solution to Challenge 32.4. Results For the domain with the circle cut out were similar; see ±igures 28.3 and 28.4....
View Full Document
- Fall '11
- Iterated function, Cholesky, incomplete Cholesky decomposition