A Technical Example
Here we assume that the reader is familiar with partial differential equations.
We will be solving the partial differential equation
- uxx + uyy = f (**)
The boundary condition is boundedness at infinity.
We decompose the domain R² into two overlapping subdomains H1 = (− ∞,1] × R and H2 = [0,+ ∞) × R. In each subdomain, we will be solving a BVP of the form:
- u( j )xx + u( j )yy = f in Hj
- u( j )(xj,y) = g(y)
where x1 = 1 and x2 = 0 and taking boundedness at infinity as the other boundary condition. We denote the solution u( j ) of the above problem by S(f,g). Note that S is bilinear.
The Schwarz algorithm proceeds as follows:
- Start with approximate solutions u( 1 )0 and u( 2 )0 of the PDE in subdomains H1 and H2 respectively. Initialize k to 1.
- Calculate u( j )k + 1 = S(f,u(3 − j)k(xj)) with j = 1,2.
- Increase k by one and repeat 2 until sufficient precision is achieved.
Read more about this topic: Additive Schwarz Method
Famous quotes containing the word technical:
“Where there is the necessary technical skill to move mountains, there is no need for the faith that moves mountains.”
—Eric Hoffer (19021983)