A method is A-stable when its stability domain contains the closed left half-plane.
For nonnegative degrees with , the Padé approximant to the exponential function has no poles in the left half-plane and satisfies for . Consequently a numerical method having that stability function is A-stable. In particular, the near-diagonal choice gives the Radau IIA method stability function, while corresponds to the Gauss collocation method. The theorem concerns these exponential approximants, not arbitrary rational approximations with the same degrees.
Suppose a consistent linear multistep method has a simple principal polynomial root and its analytic logarithm satisfies near zero, with real coefficients. If , then at the real part of is positive to leading order. The same remains true after giving a small negative real part of smaller magnitude than that leading term. Thus a growing amplification factor occurs inside the left half-plane, ruling out A-stability. For an order-three method with , choose .
For an explicit linear multistep method, the highest-degree coefficient of is fixed while at least one lower coefficient grows unboundedly with negative real . If all roots stayed in the unit disk, the elementary symmetric polynomials of those roots would keep every monic coefficient bounded. This contradiction proves that no nontrivial consistent explicit method is A-stable.
A unit-modulus amplification root of a linear multistep method puts its test-equation parameter on this boundary locus, except when numerator and denominator both vanish. If the locus avoids the open left half-plane, the leading coefficient never vanishes there and the roots are initially inside the disk at one point there, continuity keeps them inside throughout that connected region. Checking zero-stability, imaginary-axis roots and common polynomial factors is still necessary. A boundary plot alone is not a proof of A-stability.
An A-stable one-step method is L-stable when its stability function also satisfies as within the left half-plane. It damps modes whose decay time is far shorter than the numerical step.
A Runge--Kutta method is B-stable when it does not increase distances between numerical solutions of a dissipative differential equation. Algebraic stability of a Runge-Kutta method is a standard sufficient condition.
Backward Euler advances by . Its stability function makes it L-stable.
For the two-stage implicit Runge-Kutta method with
the stability function is
For ,
The denominator has no zero in the closed left half-plane, so the method is A-stable for every real .

Ancestors (6)

  1. Linear stability domain
  2. Numerical analysis
  3. Analysis
  4. Area of mathematics
  5. Mathematics
  6. Home

Synonyms (1)

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.