### TABLE 1: Examples of Runge-Kutta family methods.

### Table 1: Third order Runge-Kutta time advancement scheme

### Table 2 Piecewise linear approximation, 2-stage Runge-Kutta

### Table 7.1: Parameters for the TVBM Runge-Kutta scheme parameters listed in Table 7.1 which were derived by Shu [48] to result in a time discretization that is TVD (Total Variation Diminishing) when combined with nite di erence schemes in one space dimension. For multiple space dimensions, the parameters listed in Table 7.1 result in a scheme which is TVBM (Total Variation Bounded in the Means) as de ned in the following lemma. Lemma 9 (Cockburn, Hou, and Shu [12]) Let a0 = inf x2 u0(x)

### Table 3 Average values of S for some problem graphs. RungeKutta Newton EvenProcess Conditional

"... In PAGE 24: ...2 35.0 Table3 shows that using NS instead of 0 when mapping GRungeKutta yields speedup S = 1:69. That is to say, RungeKutta executes 1:69 times faster on average if mapped by NS instead of 0.... ..."

### Table 2: A ladder of reflection: A Planning Game session Ladder rungs

2002

"... In PAGE 2: ... The first one (Table 1) presents a ladder of reflection that is constructed during a pair programming2 session. The second ladder ( Table2 ) is constructed during a Planning Game session.3 In the first case the idea is to illustrate how a pair of programmers may increase the abstraction level of their thinking when reflection is interwoven within the process of software development.... ..."

Cited by 9

### Table 4.2 Error of polynomial interpolation between equidistant and random points for Runge apos;s example

1999

Cited by 3

### Table I. The differential equation is solved numerically by the Runge-Kutta method with sampling time of 0.02 sec.

1990

Cited by 1