Additive Schwarz method: Difference between revisions

Revision as of 18:00, 11 April 2009

Revision as of 23:27, 27 April 2009

Line 12:

:where ''f'' is the unknown [[function (mathematics)|function]], ''f''_''xx'' and ''f''_''yy'' denote the second [[partial derivative]]s with respect to ''x'' and ''y'', respectively.

Here, the [[___domain (mathematics)|___domain]] is the square [0,1] ×× [0,1].

This particular problem can be solved exactly on paper, so there is no need for a computer. However, this is an exceptional case, and most BVPs cannot be solved exactly. The only possibility is to use a computer to find an approximate solution.

Line 18:

=== Solving on a computer ===

A typical way of doing this is to ''sample'' ''f'' at regular [[interval]]s in the [[Square (geometry)|square]] [0,1] ×× [0,1]. For instance, we could take 8 samples in the ''x'' direction at ''x'' = 0.1, 0.2, ..., 0.8 and 0.9, and 8 samples in the ''y'' direction at similar [[coordinate system|coordinates]]. We would then have 64 samples of the square, at places like (0.2,0.8) and (0.6,0.6). The goal of the [[computer program]] would be to calculate the value of ''f'' at those 64 points, which seems easier than finding an abstract function of the square.

There are some difficulties, for instance it is not possible to calculate ''f''_''xx''(0.5,0.5) knowing ''f'' at only 64 points in the square. To overcome this, one uses some sort of numerical approximation of the derivatives, see for instance the [[finite element method]] or [[finite difference]]s. We ignore these difficulties and concentrate on another aspect of the problem.

Line 27:

:2''a'' + 5''b'' = 12 (*)

:6''a'' −− 3''b'' = −3−3

This is a system of 2 equations in 2 unknowns (''a'' and ''b''). If we solve the BVP above in the manner suggested, we will need to solve a system of 64 equations in 64 unknowns. This is not a hard problem for modern computers, but if we use a larger number of samples, even modern computers cannot solve the BVP very efficiently.

Line 33:

=== Domain decomposition ===

Which brings us to ___domain decomposition methods. If we split the ___domain [0,1] ×× [0,1] into two ''subdomains'' [0,0.5] ×× [0,1] and [0.5,1] ×× [0,1], each has only half of the sample points. So we can try to solve a version of our model problem on each subdomain, but this time each subdomain has only 32 sample points. Finally, given the solutions on each subdomain, we can attempt to reconcile them to obtain a solution of the original problem on [0,1] ×× [0,1].

==== Size of the problems ====

In terms of the linear systems, we're trying to split the system of 64 equations in 64 unknowns into two systems of 32 equations in 32 unknowns. This would be a clear gain, for the following reason. Looking back at system (*), we see that there are 6 important pieces of information. They are the coefficients of ''a'' and ''b'' (2,5 on the first line and 6,−3−3 on the second line), and the right hand side (which we write as 12,−3−3). On the other hand, if we take two "systems" of 1 equation in 1 unknown, it might look like this:

:System 1: 3''a'' = 15

:System 2: 6''b'' = −4−4

We see that this system has only 4 important pieces of information. This means that a computer program will have an easier time solving two 1×11×1 systems than solving a single 2×22×2 system, because the pair of 1×11×1 systems are simpler than the single 2×22×2 system. While the 64×6464×64 and 32×3232×32 systems are too large to illustrate here, we could say by analogy that the 64×6464×64 system has 4160 pieces of information, while the 32×3232×32 systems each have 1056, or roughly a quarter of the 64×6464×64 system.

==== Domain decomposition algorithm ====

Unfortunately, for technical reason it is usually not possible to split our grid of 64 points (a 64×6464×64 system of linear equations) into two grids of 32 points (two 32×3232×32 systems of linear equations) and obtain an answer to the 64×6464×64 system. Instead, the following algorithm is what actually happens:

:1) Begin with an approximate solution of the 64×6464×64 system.

:2) From the 64×6464×64 system, create two 32×3232×32 systems to improve the approximate solution.

:3) Solve the two 32×3232×32 systems.

:4) Put the two 32×3232×32 solutions "together" to improve the approximate solution to the 64×6464×64 system.

:5) If the solution isn't very good yet, repeat from 2.

There are two ways in which this can be better than solving the base 64×6464×64 system. First, if the number of repetitions of the algorithm is small, solving two 32×3232×32 systems may be more efficient than solving a 64×6464×64 system. Second, the two 32×3232×32 systems need not be solved on the same computer, so this algorithm can be run in ''parallel'' to use the power of multiple computers.

In fact, solving two 32×3232×32 systems instead of a 64×6464×64 system on a single computer (without using parallelism) is unlikely to be efficient. However, if we use more than two subdomains, the picture can change. For instance, we could use four 16×1616×16 problems, and there's a chance that solving these will be better than solving a single 64×6464×64 problem even if the ___domain decomposition algorithm needs to iterate a few times.

== A technical example ==

Line 68:

The boundary condition is boundedness at infinity.

We decompose the ___domain '''R'''² into two overlapping subdomains H₁ = (<nowiki>&minus;− ∞,1]</nowiki> &times;× '''R''' and H₂ = <nowiki>[0,+ ∞</nowiki>) &times;× '''R'''. In each subdomain, we will be solving a BVP of the form:

:''u''^{( ''j'' )}_''xx'' + ''u''^{( ''j'' )}_''yy'' = ''f'' in H_''j''

Line 78:

#Start with approximate solutions ''u''^{( 1 )}₀ and ''u''^{( 2 )}₀ of the PDE in subdomains H₁ and H₂ respectively. Initialize ''k'' to 1.

#Calculate ''u''^{( ''j'' )}_{''k'' + 1} = S(''f'',''u''^{(3 &minus;− ''j'')}_''k''(''x''_''j'')) with ''j'' = 1,2.

#Increase ''k'' by one and repeat 2 until sufficient precision is achieved.

Line 90:

* [http://www.ddm.org The official Domain Decomposition Methods page]

{{Template:Numerical PDE}}

[[Category:Domain decomposition methods]]