{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# Method conv rate jacobi h2 gauss seidel 2h2 sor with

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

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: a square. Problems 1. Consider a problem for Laplace's equation uxx + uyy = 0 (x y) 2 where is the region between a 4 4 square and a concentric 2 2 square (Figure 9.2.6). The Dirichlet boundary conditions are u = 1 on the outside of the 4 4 square and u = 0 on the edge of the 2 2 square. Due to symmetry, this problem need only be solved on the one octant shown on the right of Figure 9.2.6. The subscript n denotes di erentiation in the outer normal direction. 1.1. Construct a discrete approximation of the above problem on the region shown on the right of Figure 9.2.6. Use the ve point di erence approximation for Laplace's equation and, for simplicity, assume that the mesh spacing in the x and y directions is the same, say, x = y = 1=N . Take appropriate steps to ensure that the nite di erence approximations at the symmetry boundary and the interior have O(1=N 2) accuracy. 1.2. For the special discretization when x = 1=2 the discrete problem has only four unknowns. Write down an SOR procedure for determining these unknowns. Calculate the Jacobi iteration matrix MJ . Find an expression for 30 Solution Techniques for Elliptic Problems the spectral radius (MSOR) of the SOR matrix. Plot (MSOR) and determine the optimal relaxation parameter !. (This problem should be done symbolically.) 1 2 1 1 u=0 2 1 1 ux = 0 111111 000000 111111 000000 111111 000000 111111 000000 un 0 = u=1 1 1 Figure 9.2.6: Domain for Problem 1 (left). Due to symmetry, the problem need only be solved on the octant shown on the right. 9.3 Conjugate Gradient Methods The xed-point iterative methods of the previous section deteriorate in performance as the dimension N of the linear system increases. The faster SOR and ADI techniques depend on acceleration parameters that may be di cult to estimate. We seek to overcome these de ciencies without raising the storage requirements to the level of a direct method. Solving the linear system (9.1.1) when A is symmetric positive de nite matrix is equivalent to minimizing the quadratic functional...
View Full Document

• Spring '14
• JosephE.Flaherty
• Articles with example pseudocode, Gauss–Seidel method, Jacobi method, Iterative method, elliptic problems

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern