Synopsis
Understand how two classic methods reliably solve elliptic problems and why their convergence matters.
This guide presents a clear path to proving that alternating direction methods converge when applied to the Dirichlet problem for Laplace-type equations on a lattice. It explains how the Douglas–Rachford and Peaceman–Rachford schemes work, what the acceleration parameter does, and how the error shrinks under suitable conditions. The discussion stays focused on the core idea: turning a continuous problem into a finite system and showing the iterative method reduces the error.
- Learn how the two basic one-parameter methods are set up, including initial guesses and the role of boundary data.
- See how convergence is established through norm estimates and a structured analysis of the discrete operators.
- Discover how these techniques extend to more general elliptic equations and what adjustments are needed for variable coefficients.
- Understand the practical implications for solving large linear systems with tridiagonal blocks and what to watch for when choosing parameters.
"synopsis" may belong to another edition of this title.
