Stiff equation explained

In mathematics, a stiff equation is a differential equation for which certain numerical methods for solving the equation are numerically unstable, unless the step size is taken to be extremely small. It has proven difficult to formulate a precise definition of stiffness, but the main idea is that the equation includes some terms that can lead to rapid variation in the solution.

When integrating a differential equation numerically, one would expect the requisite step size to be relatively small in a region where the solution curve displays much variation and to be relatively large where the solution curve straightens out to approach a line with slope nearly zero. For some problems this is not the case. In order for a numerical method to give a reliable solution to the differential system sometimes the step size is required to be at an unacceptably small level in a region where the solution curve is very smooth. The phenomenon is known as stiffness. In some cases there may be two different problems with the same solution, yet one is not stiff and the other is. The phenomenon cannot therefore be a property of the exact solution, since this is the same for both problems, and must be a property of the differential system itself. Such systems are thus known as stiff systems.

Motivating example

Consider the initial value problemThe exact solution (shown in cyan) is

We seek a numerical solution that exhibits the same behavior.

The figure (right) illustrates the numerical issues for various numerical integrators applied on the equation.

One of the most prominent examples of the stiff ordinary differential equations (ODEs) is a system that describes the chemical reaction of Robertson:^[1] If one treats this system on a short interval, for example,

t \in [ 0 , 40 ] there is no problem in numerical integration. However, if the interval is very large (10¹¹ say), then many standard codes fail to integrate it correctly.

Stiffness ratio

Consider the linear constant coefficient inhomogeneous system

where

y, f \in R ^{n} and A is a constant, diagonalizable, n x n matrix with eigenvalues λ _{t} \in C , t = 1 , 2 , \ldots , n (assumed distinct) and corresponding eigenvectors c _{t} \in C ^{n,} t = 1 , 2 , \ldots , n . The general solution of takes the form

where the

\kappa _{t} are arbitrary constants and g(x) is a particular integral. Now let us suppose that

which implies that each of the terms

e ^{λ _{t} x} c _{t} \to 0 as x \to inf ty , so that the solution y(x) approaches g(x) asymptotically as x \to inf ty ; the term e ^{λ _{t} x} c _{t} will decay monotonically if λ _{t} is real and sinusoidally if λ _{t} is complex.

Interpreting

x to be time (as it often is in physical problems), $\backslash sum\_^n\; \backslash kappa\_t\; e^\; \backslash mathbf\; c\_t$ is called the transient solution and g(x) the steady-state solution. If \left|\operatorname{Re}( λ _{t)\right|} is large, then the corresponding term \kappa _{t} e ^{λ _{t} x} c _{t} will decay quickly as x increases and is thus called a fast transient; if\left| \operatorname{Re}( λ _{t)} \right| is small, the corresponding term\kappa _{t} e ^{λ _{t} x} c _{t} decays slowly and is called a slow transient. Let \overline{ λ }, \underline{ λ } \in \{ λ _{t,} t = 1 , 2 , \ldots , n \} be defined by

so that

\kappa _{t} e ^{\overline{λ} x} c _{t} is the fastest transient and \kappa _{t} e ^{\underline{λ} x} c _{t} the slowest. We now define the stiffness ratio as

Characterization of stiffness

In this section we consider various aspects of the phenomenon of stiffness. "Phenomenon" is probably a more appropriate word than "property", since the latter rather implies that stiffness can be defined in precise mathematical terms; it turns out not to be possible to do this in a satisfactory manner, even for the restricted class of linear constant coefficient systems. We shall also see several qualitative statements that can be (and mostly have been) made in an attempt to encapsulate the notion of stiffness, and state what is probably the most satisfactory of these as a "definition" of stiffness.

J. D. Lambert defines stiffness as follows:

If a numerical method with a finite region of absolute stability, applied to a system with any initial conditions, is forced to use in a certain interval of integration a step length which is excessively small in relation to the smoothness of the exact solution in that interval, then the system is said to be stiff in that interval.

There are other characteristics which are exhibited by many examples of stiff problems, but for each there are counterexamples, so these characteristics do not make good definitions of stiffness. Nonetheless, definitions based upon these characteristics are in common use by some authors and are good clues as to the presence of stiffness. Lambert refers to these as "statements" rather than definitions, for the aforementioned reasons. A few of these are:

1. A linear constant coefficient system is stiff if all of its eigenvalues have negative real part and the stiffness ratio is large.
2. Stiffness occurs when stability requirements, rather than those of accuracy, constrain the step length.
3. Stiffness occurs when some components of the solution decay much more rapidly than others.

Etymology

The origin of the term "stiffness" has not been clearly established. According to Joseph Oakland Hirschfelder, the term "stiff" is used because such systems correspond to tight coupling between the driver and driven in servomechanisms.According to Richard. L. Burden and J. Douglas Faires,

Significant difficulties can occur when standard numerical techniques are applied to approximate the solution of a differential equation when the exact solution contains terms of the form

e ^{λ} , where λ is a complex number with negative real part.. . .Problems involving rapidly decaying transient solutions occur naturally in a wide variety of applications, including the study of spring and damping systems, the analysis of control systems, and problems in chemical kinetics. These are all examples of a class of problems called stiff (mathematical stiffness) systems of differential equations, due to their application in analyzing the motion of spring and mass systems having large spring constants (physical stiffness).

For example, the initial value problemwith m = 1 , c = 1001 , k = 1000 , can be written in the form with n = 2 andand has eigenvalues \overline{ λ } = -1000 , \underline{ λ } = -1 . Both eigenvalues have negative real part and the stiffness ratio iswhich is fairly large. System then certainly satisfies statements 1 and 3. Here the spring constant k is large and the damping constant c is even larger. (while "large" is not a clearly-defined term, but the larger the above quantities are, the more pronounced will be the effect of stiffness.)The exact solution to isEquation behaves quite similarly to a simple exponential x _{0} e ^{-t} , but the presence of the e ^{-1000t} term, even with a small coefficient, is enough to make the numerical computation very sensitive to step size. Stable integration of requires a very small step size until well into the smooth part of the solution curve, resulting in an error much smaller than required for accuracy. Thus the system also satisfies statement 2 and Lambert's definition.

A-stability

The behaviour of numerical methods on stiff problems can be analyzed by applying these methods to the test equation

y' = ky subject to the initial condition y( 0 ) = 1 with k \in C . The solution of this equation is y(t) = e ^{kt} . This solution approaches zero as t\to inf ty when \operatorname{Re}(k) < 0 . If the numerical method also exhibits this behaviour (for a fixed step size), then the method is said to be A-stable.^[2] A numerical method that is L-stable (see below) has the stronger property that the solution approaches zero in a single step as the step size goes to infinity. A-stable methods do not exhibit the instability problems as described in the motivating example.

Runge–Kutta methods

Runge–Kutta methods applied to the test equation

y' = k ⋅ y take the form y _{n+1} = \phi(hk) ⋅ y _{n} , and, by induction, y _{n} = l (\phi(hk) r ) ^{n ⋅} y _{0} . The function \phi is called the stability function. Thus, the condition that y _{n} \to 0 as n \to inf ty is equivalent to |\phi(hk)| < 1 . This motivates the definition of the region of absolute stability (sometimes referred to simply as stability region), which is the set l \{z \in C | |\phi(z)|< 1 r \} . The method is A-stable if the region of absolute stability contains the set l \{ z \in \Complex | \operatorname{Re}(z) < 0 r \} , that is, the left half plane.

Example: The Euler methods

Consider the Euler methods above. The explicit Euler method applied to the test equation

y' = k ⋅ y isy _{n+1} = y _{n} + h ⋅ f(t _{n,} y _{n)} = y _{n} + h ⋅ (ky _{n)} = y _{n} + h ⋅ k ⋅ y _{n} = ( 1+ h ⋅ k)y _{n.} Hence, y _{n} = ( 1 + hk) ^{n ⋅} y _{0} with \phi(z) = 1 + z . The region of absolute stability for this method is thus l \{ z \in C | | 1+ z| < 1 r \} which is the disk depicted on the right. The Euler method is not A-stable.

The motivating example had

k = -15 . The value of z when taking step size h = \tfrac 14 is z = -15 x \tfrac 14 = -3 . 75 , which is outside the stability region. Indeed, the numerical results do not converge to zero. However, with step size h = \tfrac 18 , we have z = -1 . 875 which is just inside the stability region and the numerical results converge to zero, albeit rather slowly.

Example: Trapezoidal method

Consider the trapezoidal method

y _{n+1} = y _{n} + \tfrac{ 1 }{ 2 }h ⋅ l (f(t _{n,y} _{n)+f(t} _{n+1} ,y _{n+1} ) r ), when applied to the test equation y' = k ⋅ y , isy _{n+1} = y _{n} + \tfrac{ 1 }{ 2 }h ⋅ \left(ky _{n+ky} _{n+1} \right). Solving for y _{n+1} yieldsy _{n+1} = (1+ (1)/(hk 2))/(1- (1)/(hk 2)) ⋅ y _{n.} Thus, the stability function is\phi(z) = (1+ (12)/(z))/(1- (12)/(z)) and the region of absolute stability is\left\{ z \in C \left| \left| (1+ (12)/(z))/(1- (12)/(z)) \right| < 1 \right.\right\}. This region contains the left half-plane, so the trapezoidal method is A-stable. In fact, the stability region is identical to the left half-plane, and thus the numerical solution of y' = k ⋅ y converges to zero if and only if the exact solution does. Nevertheless, the trapezoidal method does not have perfect behavior: it does damp all decaying components, but rapidly decaying components are damped only very mildly, because \phi(z) \to 1 as z \to -inf ty . This led to the concept of L-stability: a method is L-stable if it is A-stable and |\phi(z)| \to 0 as z \to inf ty . The trapezoidal method is A-stable but not L-stable. The implicit Euler method is an example of an L-stable method.^[3]

General theory

The stability function of a Runge–Kutta method with coefficients

A and b is given by\phi(z) = (\det\left( I - z A + z e b ^{T\right)})/(\det( I - z A )) , where e denotes the vector with all ones. This is a rational function (one polynomial divided by another).

Explicit Runge–Kutta methods have a strictly lower triangular coefficient matrix

A and thus, their stability function is a polynomial. It follows that explicit Runge–Kutta methods cannot be A-stable.

The stability function of implicit Runge–Kutta methods is often analyzed using order stars. The order star for a method with stability function

\phi is defined to be the set l \{ z \in \Complex | |\phi(z)| > |e ^{z|} r \} . A method is A-stable if and only if its stability function has no poles in the left-hand plane and its order star contains no purely imaginary numbers.^[4]

Multistep methods

Linear multistep methods have the form

y _{n+1} = \sum ^{s} _{i =0} a _{i} y _{n-i} + h\sum ^{s} _{j =-1} b _{j} f\left(t _{n-j} ,y _{n-j} \right). Applied to the test equation, they becomey _{n+1} = \sum ^{s} _{i =0} a _{i} y _{n-i} + hk\sum ^{s} _{j =-1} b _{jy} _{n-j} , which can be simplified to\left( 1- b _{-1} z\right)y _{n+1} - \sum ^{s} _{j =0} \left(a _{j+b} _{jz\right)y} _{n-j} =0 where z = hk . This is a linear recurrence relation. The method is A-stable if all solutions \{ y _{n} \} of the recurrence relation converge to zero when \operatorname{Re}(z) < 0 . The characteristic polynomial is\Phi(z, w) = w ^{s+1} - \sum ^{s} _{i =0} a ^{s - i} _{iw} - z\sum ^{s} _{j =-1} b ^{s - j} _{jw} . All solutions converge to zero for a given value of z if all solutions w of \Phi(z,w) = 0 lie in the unit circle.

The region of absolute stability for a multistep method of the above form is then the set of all

z \in C for which all w such that \Phi(z,w) = 0 satisfy |w| < 1 . Again, if this set contains the left half-plane, the multi-step method is said to be A-stable.

Example: The second-order Adams–Bashforth method

Let us determine the region of absolute stability for the two-step Adams–Bashforth method

y _{n+1} = y _{n} + h \left( \tfrac 32 f(t _{n,} y _{n)} - \tfrac 12 f(t _{n-1} , y _{n-1} ) \right) . The characteristic polynomial is\Phi(w,z) = w ^{2} - \left( 1+ \tfrac 32 z\right)w + \tfrac 12 z = 0 which has rootsw = \tfrac 12 \left( 1 + \tfrac 32 z \pm\sqrt{ 1 + z + \tfrac 94 z ^{2}\right),} thus the region of absolute stability is\left\{ z \in C \left| \left| \tfrac 12 \left( 1 + \tfrac 32 z \pm\sqrt{ 1 + z + \tfrac 94 z ^{2}\right)} \right| < 1 \right.\right\}. This region is shown on the right. It does not include all the left half-plane (in fact it only includes the real axis between -1 \le z \le 0 ) so the Adams–Bashforth method is not A-stable.

General theory

Explicit multistep methods can never be A-stable, just like explicit Runge–Kutta methods. Implicit multistep methods can only be A-stable if their order is at most 2. The latter result is known as the second Dahlquist barrier; it restricts the usefulness of linear multistep methods for stiff equations. An example of a second-order A-stable method is the trapezoidal rule mentioned above, which can also be considered as a linear multistep method.^[5]

See also

• Backward differentiation formula, a family of implicit methods especially used for the solution of stiff differential equations
• Condition number
• Differential inclusion, an extension of the notion of differential equation that allows discontinuities, in part as way to sidestep some stiffness issues
• Explicit and implicit methods

Notes

1. Book: Robertson, H. H.. Numerical analysis: an introduction. Academic Press. 1966. 178–182. The solution of a set of reaction rate equations.
2. This definition is due to .
3. The definition of L-stability is due to .
4. The definition is due to ; see also .
5. See .

References

• .
• .
• .
• .
• .
• .
• .
• .
• .
• .
• .
• .
• .
• Book: Press . WH . Teukolsky . SA . Vetterling . WT . Flannery . BP . 2007 . Numerical Recipes: The Art of Scientific Computing . 3rd . Cambridge University Press . New York . 978-0-521-88068-8 . Section 17.5. Stiff Sets of Equations . http://apps.nrbook.com/empanel/index.html#pg=931 . 2011-08-17 . 2011-08-11 . https://web.archive.org/web/20110811154417/http://apps.nrbook.com/empanel/index.html#pg=931 . dead .
• .
• .
• Stability of Runge-Kutta Methods http://homepages.cwi.nl/~jason/Classes/numwisk/ch10.pdf

External links

• An Introduction to Physically Based Modeling: Energy Functions and Stiffness
• Stiff systems Lawrence F. Shampine and Skip Thompson Scholarpedia, 2(3):2855.