Results 211 to 220 of about 13,068 (272)
Some of the next articles are maybe not open access.

Perturbed Runge–Kutta Methods for Mixed Precision Applications

Journal of Scientific Computing, 2020
In this work we consider a mixed precision approach to accelerate the implementation of multi-stage methods. We show that Runge–Kutta methods can be designed so that certain costly intermediate computations can be performed as a lower-precision ...
Zachary J. Grant
semanticscholar   +1 more source

Diagonally implicit Runge–Kutta methods for stiff ODEs

, 2019
Based principally on a recent review of diagonally implicit Runge–Kutta (DIRK) methods applied to stiff first-order ordinary differential equations (ODEs) by the present authors, several nearly optimal, general purpose, DIRK-type methods are presented ...
C. Kennedy, M. Carpenter
semanticscholar   +1 more source

Stabilitätseigenschaften adaptiver Runge -Kutta-Verfahren

ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1981
AbstractZur numerischen Behandlung von steifen Anfangswertaufgaben wird eine Klasse adaptiver Runge‐Kutta‐Verfahren betrachtet. Unter Beibehaltung der Konsistenzordnung erfordern sie nur gelegentlich eine Berechnung der Jacobi‐Matrix. Das Stabilitätsverhalten der adaptiven Verfahren bei großen Schrittweiten wird bezüglich des von Prothero und Robinson ...
openaire   +1 more source

Runge–Kutta Method

2019
The class of differential equations for which explicit solutions can be obtained is rather small. In fact, in Chap. 3, we have already remarked that to find an explicit solution of the second-order linear differential equation ( 3.2) there does not exist any method.
Ravi P. Agarwal   +2 more
openaire   +1 more source

Improved Runge–Kutta–Chebyshev methods

Mathematics and Computers in Simulation, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tang, Xiao, Xiao, Aiguo
openaire   +1 more source

Convolutional neural networks combined with Runge–Kutta methods

Neural computing & applications (Print), 2018
A convolutional neural network can be constructed using numerical methods for solving dynamical systems, since the forward pass of the network can be regarded as a trajectory of a dynamical system.
Mai Zhu, B. Chang, Chong Fu
semanticscholar   +1 more source

Multirate Partitioned Runge-Kutta Methods

BIT Numerical Mathematics, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Günther, M., Kværnø, A., Rentrop, P.
openaire   +2 more sources

Runge–Kutta methods in elastoplasticity

Applied Numerical Mathematics, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Büttner, Jörg, Simeon, Bernd
openaire   +1 more source

Runge-Kutta Methods

1973
One-step methods (see Def. 2.1.8) form a particularly simple class of f. s. m. for IVP 1. Among these, a certain class of methods has commonly been associated with the names of C. Runge and W. Kutta and is widely used. These “Runge-Kutta methods” (RK-methods) are 1-step m+1-stage methods in the sense of Def. 2.1.10.
openaire   +1 more source

Extended Runge–Kutta-like formulae

Applied Numerical Mathematics, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wu, Xinyuan, Xia, Jianlin
openaire   +2 more sources

Home - About - Disclaimer - Privacy