Method of matched asymptotic expansions
From Wikipedia, the free encyclopedia
In mathematics, particularly in solving singularly perturbed differential equations, the method of matched asymptotic expansions is a common approach to finding an accurate approximation to a problem's solution.
Contents |
[edit] Method overview
In a large class of singularly perturbed problems, the domain may be divided into two subdomains. On one of these, the solution is accurately approximated by an asymptotic series found by treating the problem as a regular perturbation. The other subdomain consists of one or more small areas in which that approximation is inaccurate, generally because the perturbation terms in the problem are not negligible there. These areas are referred to as transition layers, or boundary or interior layers depending on whether they occur at the domain boundary (as is the usual case in applications) or inside the domain.
An approximation in the form of an asymptotic series is obtained in the transition layer(s) by treating that part of the domain as a separate perturbation problem. This approximation is called the "inner solution," and the other is the "outer solution," named for their relationship to the transition layer(s). The outer and inner solutions are then combined through a process called "matching" in such a way that an approximate solution for the whole domain is obtained.[1]
[edit] Simple example
Consider the equation
where y(0) = 0, y(1) = 1, and .
[edit] Outer and inner solutions
Since ε is very small, our first approach is to find the solution to the problem
which is
for some constant A. Applying the boundary condition y(0) = 0, we would have A = 0; applying the boundary condition y(1) = 1, we would have A = e. At least one of the boundary conditions cannot be satisfied. From this we infer that there must be a boundary layer at one of the endpoints of the domain.
Suppose the boundary layer is at t = 0. If we make the rescaling τ = t / ε, the problem becomes
which, after multiplying by ε and taking ε = 0, is
with solution
for some constants B and C. Since y(0) = 0, we have C = B, so the inner solution is
[edit] Matching
Remember that we have assumed the outer solution to be
The idea of matching is for the inner and outer solutions to agree at some value of t near the boundary layer as ε decreases. For example, if we fix , we have the matching condition
so B = e. To obtain our final, matched solution, valid on the whole domain, we add the inner and outer approximations and subtract their common value:
[edit] Accuracy
Substituting the matched solution in the problem's differential equation yields
which converges to zero as ε decreases, uniformly in t. As to the boundary conditions, y(0) = 0 and y(1) = 1 − e1 − 1 / ε, which quickly converges to the value given in the problem.
Not only does our solution approximately solve the problem at hand; it closely approximates the problem's exact solution. It happens that this particular problem is easily found to have exact solution
which is very close to our approximation for reasonably small ε.
[edit] Location of boundary layer
Conveniently, we can see that the boundary layer, where y' and y'' are large, is near t = 0, as we supposed earlier. If we had supposed it to be at the other endpoint and proceeded by making the rescaling τ = (1 − t) / ε, we would have found it impossible to satisfy the resulting matching condition. For many problems, this kind of trial and error is the only way to determine the true location of the boundary layer a priori.[1]
[edit] References
- ^ a b Ferdinand Verhulst. Methods and Applications of Singular Perturbations: Boundary Layers and Multiple Timescale Dynamics, Springer, 2005. ISBN 0-387-22966-3.