Results 51 to 60 of about 21,631,270 (109)
Gradient‐Free Online Learning of Subgrid‐Scale Dynamics With Neural Emulators
Abstract In this paper, we propose a generic algorithm to train machine learning‐based subgrid parametrizations online, that is, with a posteriori loss functions, but for non‐differentiable numerical solvers. The proposed approach leverages a neural emulator to approximate the reduced state‐space solver, which is then used to allow gradient propagation
H. Frezat +3 more
wiley +1 more source
Additive Semi-Implicit Runge-Kutta Methods for Computing High-Speed Nonequilibrium Reactive Flows
This paper is concerned with time-stepping numerical methods for computing stiff semi-discrete systems of ordinary differential equations for transient hypersonic flows with thermo-chemical nonequilibrium.
Xiaolin Zhong +2 more
core
Efficient Nested Implicit Runge–Kutta Methods for Nonlinear Stiff Problems
Gauss-type nested implicit Runge–Kutta methods exhibit many vital properties of implicit Runge–Kutta methods, such as stability, highorder accuracy, and symmetry.
Junaid Ahmad; Department of Mathematics, University of Engineering and Technology, Lahore, Pakistan +2 more
core
Quadratic projectable Runge-Kutta methods
Runge-Kutta methods are affine equivariant: applying a method before or after an affine change of variables yields the same numerical trajectory. However, for some applications, one would like to perform numerical integration after a quadratic change of ...
Ari Stern, Milo Viviani
semanticscholar +2 more sources
Structure-Preserving Implicit Runge-Kutta Methods for Stochastic Poisson Systems with Multiple Noises [PDF]
In this paper, we propose the diagonal implicit Runge-Kutta methods and transformed Runge-Kutta methods for stochastic Poisson systems with multiple noises.
Zhang, Liying, Wang, Lijin, Xue, Fenglin
core +2 more sources
Implicit-Explicit schemes for BGK kinetic equations [PDF]
In this work a new class of numerical methods for the BGK model of kinetic equations is presented. In principle, schemes of any order of accuracy in both space and time can be constructed with this technique. The methods proposed are based on an explicit–
PIERACCINI S. +5 more
core +1 more source
Diagonally Implicit Symplectic Runge-Kutta Methods with 7th Algebraic Order
The numerical integration of Hamiltonian systems with oscillating solutions is considered in this paper. Since Hamiltonian systems have good properties such as symplecticity, numerical methods that preserve these properties have attracted the great ...
Thae Oh, Ji-Yeong Choe, J. Kim
semanticscholar +1 more source
Approximating Runge-Kutta Matrices By Triangular Matrices [PDF]
. The implementation of implicit Runge--Kutta methods requires the solution of large systems of non-linear equations. Normally these equations are solved by a modified Newton process, which can be very expensive for problems of high dimension.
Hoffmann, W. (Walter) +5 more
core +1 more source
ONE- AND TWO-STAGE IMPLICIT INTERVAL METHODS OF RUNGE-KUTTA TYPE [PDF]
PoznańThe paper presents one- and two-stage implicit interval methods of Runge-Kutta type. It is shown that the exact solution of the initial value problem belongs to interval-solutions obtained by both kinds of these methods.
Marciniak Andrzej
core +1 more source
IMPLICIT RUNGE-KUTTA METHODS FOR HIGHER INDEX DIFFERENTIAL-ALGEBRAIC SYSTEMS
This article considers the numerical treatment of differential-algebraic systems by implicit Runge-Kutta methods. The perturbation index of a problem is discussed and its relation to the numerical solution is explained.
Jay, Laurent +5 more
core +1 more source

