Segregated Runge–Kutta methods

Short description: Family of Runge–Kutta methods to solve differential algebraic equations

The Segregated Runge–Kutta (SRK) method[1] is a family of IMplicit–EXplicit (IMEX) Runge–Kutta methods[2][3] that were developed to approximate the solution of differential algebraic equations (DAE) of index 2.

The SRK method were motivated as a numerical method for the time integration of the incompressible Navier–Stokes equations with two salient properties. First, velocity and pressure computations are segregated. Second, the method keeps the same order of accuracy for both velocities and pressures. However, the SRK method can also be applied to any other DAE of index 2.

## The Segregated Runge–Kutta method

Consider an index 2 DAE defined as follows:

y˙(t)=f(y(t),z(t)),0=g(y(t)).
where y(t)∈ℝn, z(t)∈ℝm, f:ℝn+m->ℝn and g:ℝn->ℝm.

In the previous equations y is known as the differential variable, while z is known as the algebraic variable. The time derivative of the differential variable, y˙, depends on itself, y, on the algebraic variable, z, and on the time, t. The second equation can be seen as a constraint on differential variable, y.

Let us take the time derivative of the second equation. Assuming that the function g is linear and does not depend on time, and that the function f is linear with respect to z, we have that

0=g˙(y)=g(y˙)=g(f(y,z))=g(f(y)+f(z))=g(f(y))+g(f(z))).

A Runge–Kutta time integration scheme is defined as a multistage integration in which each stage is computed as a combination of the unknowns evaluated in other stages. Depending on the definition of the parameters, this combination can lead to an implicit scheme or an explicit scheme. Implicit and explicit schemes can be combined, leading to IMEX schemes.

Suppose that the function f can be split into two operators ℱ and 𝒢 such that

y˙(t)=ℱ(y(t))+𝒢(y(t),z(t)),
where ℱ(y(t)) and 𝒢(y(t),z(t)) are the terms to be treated implicitly and explicitly, respectively.

The SRK method is based on the use of IMEX Runge–Kutta schemes and can be defined by the following scheme:

Given a time step size h>0, at a time tn+1=tn+h,

for each Runge-Kutta stage i, with 0≤i≤s, solve:

1) yi=yn+h∑j=1iaijℱ(yj)+h∑j=1i−1a^ij𝒢(yj,zj),
2) g(f(zi))=−g(f(yi)).
Update the variables at tn+1 solving:

3) yn+1=yn+h∑i=1sbiℱ(yi)+h∑i=1sb^i𝒢(yi,zi),
4) g(f(zn+1))=−g(f(yn+1)).

## References

1. ↑ Colomés, Oriol; Badia, Santiago (3 February 2016). "Segregated Runge–Kutta methods for the incompressible Navier–Stokes equations". International Journal for Numerical Methods in Engineering 105 (5): 372–400. doi:10.1002/nme.4987. Bibcode: 2016IJNME.105..372C.
2. ↑ Ascher, Uri M.; Ruuth, Steven J.; Spiteri, Raymond J. (November 1997). "Implicit-explicit Runge-Kutta methods for time-dependent partial differential equations". Applied Numerical Mathematics 25 (2–3): 151–176. doi:10.1016/S0168-9274(97)00056-1.
3. ↑ Boscarino, Sebastiano (July 2009). "On an accurate third order implicit-explicit Runge–Kutta method for stiff problems". Applied Numerical Mathematics 59 (7): 1515–1528. doi:10.1016/j.apnum.2008.10.003.

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Segregated Runge–Kutta methods. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Segregated_Runge–Kutta_methods&oldid=204228"