The CUDA implementation of the method of lines for the curvature dependent flows

Tomáš Oberhuber; Atsushi Suzuki; Vítězslav Žabka

Displaying similar documents to “The CUDA implementation of the method of lines for the curvature dependent flows”

Implicit Runge-Kutta methods for transferable differential-algebraic equations

M. Arnold (1994)

Banach Center Publications

Similarity:

The numerical solution of transferable differential-algebraic equations (DAE’s) by implicit Runge-Kutta methods (IRK) is studied. If the matrix of coefficients of an IRK is non-singular then the arising systems of nonlinear equations are uniquely solvable. These methods are proved to be stable if an additional contractivity condition is satisfied. For transferable DAE’s with smooth solution we get convergence of order $m i n (k_{E}, k_{I} + 1)$ , where $k_{E}$ is the classical order of the IRK and $k_{I}$ is the stage order....

On those ordinary differential equations that are solved exactly by the improved Euler method

Hans Jakob Rivertz (2013)

Archivum Mathematicum

Similarity:

As a numerical method for solving ordinary differential equations $y^{'} = f (x, y)$ , the improved Euler method is not assumed to give exact solutions. In this paper we classify all cases where this method gives the exact solution for all initial conditions. We reduce an infinite system of partial differential equations for $f (x, y)$ to a finite system that is sufficient and necessary for the improved Euler method to give the exact solution. The improved Euler method is the simplest explicit second order Runge-Kutta...

Fifth-order Runge-Kutta with higher order derivative approximations.

Goeken, David, Johnson, Olin (1999)

Electronic Journal of Differential Equations (EJDE) [electronic only]

Similarity:

Explicit two-step Runge-Kutta methods

Zdzisław Jackiewicz, Rosemary Anne Renaut, Marino Zennaro (1995)

Applications of Mathematics

Similarity:

The explicit two-step Runge-Kutta (TSRK) formulas for the numerical solution of ordinary differential equations are analyzed. The order conditions are derived and the construction of such methods based on some simplifying assumptions is described. Order barriers are also presented. It turns out that for order $p \leq 5$ the minimal number of stages for explicit TSRK method of order $p$ is equal to the minimal number of stages for explicit Runge-Kutta method of order $p - 1$ . Numerical results are presented...