Singular perturbation explained

In mathematics, a singular perturbation problem is a problem containing a small parameter that cannot be approximated by setting the parameter value to zero. More precisely, the solution cannot be uniformly approximated by an asymptotic expansion

\varphi(x) ≈ \sum ^{N} _{n =0} \delta _{n(\varepsilon)} \psi _{n(x)}

as

\varepsilon \to 0 . Here \varepsilon is the small parameter of the problem and \delta _{n(\varepsilon)} are a sequence of functions of \varepsilon of increasing order, such as \delta _{n(\varepsilon)} = \varepsilon ^{n} . This is in contrast to regular perturbation problems, for which a uniform approximation of this form can be obtained. Singularly perturbed problems are generally characterized by dynamics operating on multiple scales. Several classes of singular perturbations are outlined below.

The term "singular perturbation" wascoined in the 1940s by Kurt Otto Friedrichs and Wolfgang R. Wasow.

Methods of analysis

A perturbed problem whose solution can be approximated on the whole problem domain, whether space or time, by a single asymptotic expansion has a regular perturbation. Most often in applications, an acceptable approximation to a regularly perturbed problem is found by simply replacing the small parameter

\varepsilon by zero everywhere in the problem statement. This corresponds to taking only the first term of the expansion, yielding an approximation that converges, perhaps slowly, to the true solution as \varepsilon decreases. The solution to a singularly perturbed problem cannot be approximated in this way: As seen in the examples below, a singular perturbation generally occurs when a problem's small parameter multiplies its highest operator. Thus naively taking the parameter to be zero changes the very nature of the problem. In the case of differential equations, boundary conditions cannot be satisfied; in algebraic equations, the possible number of solutions is decreased.

Singular perturbation theory is a rich and ongoing area of exploration for mathematicians, physicists, and other researchers. The methods used to tackle problems in this field are many. The more basic of these include the method of matched asymptotic expansions and WKB approximation for spatial problems, and in time, the Poincaré–Lindstedt method, the method of multiple scales and periodic averaging.The numerical methods for solving singular perturbation problems are also very popular.^[1]

For books on singular perturbation in ODE and PDE's, see for example Holmes, Introduction to Perturbation Methods,^[2] Hinch, Perturbation methods^[3] or Bender and Orszag, Advanced Mathematical Methods for Scientists and Engineers.^[4]

Examples of singular perturbative problems

Each of the examples described below shows how a naive perturbation analysis, which assumes that the problem is regular instead of singular, will fail. Some show how the problem may be solved by more sophisticated singular methods.

Vanishing coefficients in ordinary differential equations

Differential equations that contain a small parameter that premultiplies the highest order term typically exhibit boundary layers, so that the solution evolves in two different scales. For example, consider the boundary value problem

\begin{matrix} \varepsilon u ^{\prime} (x) + u ^{\prime} (x) =- e ^{-x} , 0 <x< 1 \\ u( 0 ) =0 , u( 1 ) =1 . \end{matrix}

Its solution when

\varepsilon =0 . 1 is the solid curve shown below. Note that the solution changes rapidly near the origin. If we naively set \varepsilon =0 , we would get the solution labelled "outer" below which does not model the boundary layer, for which x is close to zero. For more details that show how to obtain the uniformly valid approximation, see method of matched asymptotic expansions.

Examples in time

An electrically driven robot manipulator can have slower mechanical dynamics and faster electrical dynamics, thus exhibiting two time scales. In such cases, we can divide the system into two subsystems, one corresponding to faster dynamics and other corresponding to slower dynamics, and then design controllers for each one of them separately. Through a singular perturbation technique, we can make these two subsystems independent of each other, thereby simplifying the control problem.

Consider a class of system described by the following set of equations:

• x _{1} = f _{1(x} _{1,x} _{2)} + \varepsilon g _{1(x} _{1,x} _{2,\varepsilon),} • \varepsilon x _{2} = f _{2(x} _{1,x} _{2)} + \varepsilon g _{2(x} _{1,x} _{2,\varepsilon),} x _{1(0)} = a _{1,} x _{2(0)} = a _{2,}

with

0 <\varepsilon \ll 1 . The second equation indicates that the dynamics of x _{2} is much faster than that of x _{1} . A theorem due to Tikhonov^[5] states that, with the correct conditions on the system, it will initially and very quickly approximate the solution to the equations• x _{1} = f _{1(x} _{1,x} _{2),} f _{2(x} _{1,x} _{2)} = 0 , x _{1(0)=a} _{1,}

on some interval of time and that, as

\varepsilon decreases toward zero, the system will approach the solution more closely in that same interval.^[6]

Examples in space

In fluid mechanics, the properties of a slightly viscous fluid are dramatically different outside and inside a narrow boundary layer. Thus the fluid exhibits multiple spatial scales.

Reaction–diffusion systems in which one reagent diffuses much more slowly than another can form spatial patterns marked by areas where a reagent exists, and areas where it does not, with sharp transitions between them. In ecology, predator-prey models such as

u _{t} = \varepsilon u _{xx} + uf(u) - vg(u), v _{t} = v _{xx} + vh(u),

where

u is the prey and v is the predator, have been shown to exhibit such patterns.^[7]

Algebraic equations

Consider the problem of finding all roots of the polynomial

p(x) = \varepsilon x ^{3-x} ^{2+1} . In the limit \varepsilon\to 0 , this cubic degenerates into the quadratic 1 - x ^{2} with roots at x = \pm 1 . Substituting a regular perturbation seriesx(\varepsilon) = x _{0} + \varepsilon x _{1} + \varepsilon ^{2} x _{2+ …}

in the equation and equating equal powers of

\varepsilon only yields corrections to these two roots:x(\varepsilon) = \pm 1 + (1)/(2) \varepsilon \pm (5)/(8) \varepsilon ^{2+ …} .

To find the other root, singular perturbation analysis must be used. We must then deal with the fact that the equation degenerates into a quadratic when we let

\varepsilon tend to zero, in that limit one of the roots escapes to infinity. To prevent this root from becoming invisible to the perturbative analysis, we must rescale x to keep track with this escaping root so that in terms of the rescaled variables, it doesn't escape. We define a rescaled variable y = x \varepsilon ^{\nu} where the exponent \nu will be chosen such that we rescale just fast enough so that the root is at a finite value of y in the limit of \varepsilon to zero, but such that it doesn't collapse to zero where the other two roots will end up. In terms of y we havey ^{3} - \varepsilon ^{\nu-1} y ^{2} + \varepsilon ^{3\nu} = 0 .

We can see that for

\nu < 1 the y ^{3} is dominated by the lower degree terms, while at \nu =1 it becomes as dominant as the y ^{2} term while they both dominate the remaining term. This point where the highest order term will no longer vanish in the limit \varepsilon to zero by becoming equally dominant to another term, is called significant degeneration; this yields the correct rescaling to make the remaining root visible. This choice yieldsy ^{3} - y ^{2} + \varepsilon ^{2} = 0 .

Substituting the perturbation series

y(\varepsilon) = y _{0} + \varepsilon ^{2} y _{1} + \varepsilon ^{4} y _{2+ …}

yields

y ^{3} _{0} - y ^{2} _{0} = 0 .

We are then interested in the root at

y _{0} = 1 ; the double root at y _{0} = 0 are the two roots that we've found above that collapse to zero in the limit of an infinite rescaling. Calculating the first few terms of the series then yieldsx(\varepsilon) = (y(\varepsilon))/(\varepsilon) = (1)/(\varepsilon) - \varepsilon - 2 \varepsilon ^{3+ … .}

References

1. Wang. Yingwei. Chen. Suqin. Wu. Xionghua. 2010. A rational spectral collocation method for solving a class of parameterized singular perturbation problems. Journal of Computational and Applied Mathematics. 233. 10. 2652–2660. 10.1016/j.cam.2009.11.011. free. 2010JCoAM.233.2652W .
2. Holmes, Mark H. Introduction to Perturbation Methods. Springer, 1995.
3. Hinch, E. J. Perturbation methods. Cambridge University Press, 1991.
4. Bender, Carl M. and Orszag, Steven A. Advanced Mathematical Methods for Scientists and Engineers. Springer, 1999.
5. Tikhonov, A. N. (1952), "Systems of differential equations containing a small parameter multiplying the derivative" (in Russian), Mat. Sb. 31 (73), pp. 575–586
6. Verhulst, Ferdinand. Methods and Applications of Singular Perturbations: Boundary Layers and Multiple Timescale Dynamics, Springer, 2005. .
7. Owen, M. R. and Lewis, M. A. "How Predation can Slow, Stop, or Reverse a Prey Invasion", Bulletin of Mathematical Biology (2001) 63, 655-684.