相关论文: Runge-Kutta and Networks

There is a beautiful correspondence between configurations of lines on a rational surface and tautological bundles over that surface. We extend this correspondence to families, by means of a generalized Fourier-Mukai transform that relates…

We study the Lagrange formalism of the (rational) Ruijsenaars-Schneider (RS) system, both in discrete time as well as in continuous time, as a further example of a Lagrange 1-form structure in the sense of the recent paper [24]. The…

A standard approach to solve ordinary differential equations, when they describe dynamical systems, is to adopt a Runge-Kutta or related scheme. Such schemes, however, are not applicable to the large class of equations which do not…

Let X_1 and X_2 be mixing connected algebraic dynamical systems with the Descending Chain Condition. We show that every equivariant continuous map X_1 to X_2 is affine (that is, X_2 is topologically rigid) if and only if the system X_2 has…

Additive Runge-Kutta methods designed for preserving highly accurate solutions in mixed-precision computation were proposed and analyzed in 4. These specially designed methods use reduced precision for the implicit computations and full…

In this paper, two new families of fourth-order explicit exponential Runge--Kutta (ERK) methods with four stages are studied for solving first-order differential systems $y'(t)+My(t)=f(y(t))$. By comparing the Taylor series of the exact…

Exponential Runge--Kutta methods have shown to be competitive for the time integration of stiff semilinear parabolic PDEs. The current construction of stiffly accurate exponential Runge--Kutta methods, however, relies on a convergence…

We present a novel and general methodology for building second-order finite volume implicit-explicit Runge-Kutta numerical schemes for solving two-dimensional financial parabolic PDEs with mixed derivatives. The methods achieve second-order…

Classical mathematical techniques such as discrete integration, gradient descent optimization, and state estimation (exemplified by the Runge-Kutta method, Gauss-Newton minimization, and extended Kalman filter or EKF, respectively), rely on…

We show that without other further assumption than affine equivariance and locality, a numerical integrator has an expansion in a generalized form of Butcher series (B-series) which we call aromatic B-series. We obtain an explicit…

A root systems in Carroll spaces with degenerate metric are defined. It is shown that their Cartan matrices and reflection groups are affine. With the help of the geometric consideration the root system structure of affine algebras is…

Strong stability is a property of time integration schemes for ODEs that preserve temporal monotonicity of solutions in arbitrary (inner product) norms. It is proved that explicit Runge--Kutta schemes of order $p\in 4\mathbb{N}$ with $s=p$…

A unified theoretical framework is suggested to examine the energy dissipation properties at all stages of additive implicit-explicit Runge-Kutta (IERK) methods up to fourth-order accuracy for gradient flow problems. We construct some…

An integrable system is often formulated as a flat connection, satisfying a Lax equation. It is given in terms of compatible systems having a common solution called the ``wave function" $\Psi$ living in a Lie group $G$, which satisfies some…

Mixed precision Runge--Kutta methods have been recently developed and used for the time-evolution of partial differential equations. Two-derivative Runge--Kutta schemes may offer enhanced stability and accuracy properties compared to…

Two discrete dynamical systems are discussed and analyzed whose trajectories encode significant explicit information about a number of problems in combinatorial probability, including graphical enumeration on Riemann surfaces and random…

Discrete updates of numerical partial differential equations (PDEs) rely on two branches of temporal integration. The first branch is the widely-adopted, traditionally popular approach of the method-of-lines (MOL) formulation, in which…

Learning dynamical systems through purely data-driven methods is challenging as they do not learn the underlying conservation laws that enable them to correctly generalize. Existing port-Hamiltonian neural network methods have recently been…

We propose a precise definition of a continuous time dynamical system made up of interacting open subsystems. The interconnections of subsystems are coded by directed graphs. We prove that the appropriate maps of graphs called graph…

Modern deep learning algorithms use variations of gradient descent as their main learning methods. Gradient descent can be understood as the simplest Ordinary Differential Equation (ODE) solver; namely, the Euler method applied to the…