Related papers: Hamevol1.0: a C++ code for differential equations …
In this paper the performance of a parallel iterated Runge-Kutta method is compared versus those of the serial fouth order Runge-Kutta and Dormand-Prince methods. It was found that, typically, the runtime for the parallel method is…
We introduce a new class of Runge-Kutta type methods suitable for time stepping to propagate hyperbolic solutions within tent-shaped spacetime regions. Unlike standard Runge-Kutta methods, the new methods yield expected convergence…
A new approach for the construction of high order A-stable explicit integrators for ordinary differential equations (ODEs) is theoretically studied. Basically, the integrators are obtained by splitting, at each time step, the solution of…
The variational principle serves as a fundamental framework for describing equilibrium states of physical systems via the minimization or extremization of an energy-like functional. While quantum algorithms have demonstrated promising…
This work deals with two groups of spectral analysis results for matrices arising in fully implicit Runge-Kutta methods used for linear time-dependent partial differential equations. These were applied for different formulations of the same…
In this paper, we consider stochastic Runge-Kutta methods for stochastic Hamiltonian partial differential equations and present some sufficient conditions for multisymplecticity of stochastic Runge-Kutta methods of stochastic Hamiltonian…
Combinatorial optimization is a promising application for near-term quantum computers, however, identifying performant algorithms suited to noisy quantum hardware remains as an important goal to potentially realizing quantum computational…
In this paper we describe a quantum algorithm to solve sparse systems of nonlinear differential equations whose nonlinear terms are polynomials. The algorithm is nondeterministic and its expected resource requirements are polylogarithmic in…
Irksome is a library based on the Unified Form Language (UFL) that automates the application of Runge-Kutta time-stepping methods for finite element spatial discretizations of partial differential equations (PDEs). This paper describes…
Many time-dependent differential equations are equipped with invariants. Preserving such invariants under discretization can be important, e.g., to improve the qualitative and quantitative properties of numerical solutions. Recently,…
We design a novel, exactly energy-conserving implicit non-symplectic integration method for an eight-dimensional Hamiltonian system with four degrees of freedom. In our algorithm, each partial derivative of the Hamiltonian with respect to…
Stabilized Runge-Kutta methods are especially efficient for the numerical solution of large systems of stiff nonlinear differential equations because they are fully explicit. For semi-discrete parabolic problems, for instance, stabilized…
We combine the recent relaxation approach with multiderivative Runge-Kutta methods to preserve conservation or dissipation of entropy functionals for ordinary and partial differential equations. Relaxation methods are minor modifications of…
We study the learning of numerical algorithms for scientific computing, which combines mathematically driven, handcrafted design of general algorithm structure with a data-driven adaptation to specific classes of tasks. This represents a…
Using both fractional derivatives, defined in the Riemann-Liouville and Caputo senses, and classical derivatives of the integer order we examine different numerical approaches to ordinary differential equations. Generally we formulate some…
One limitation of the variational quantum eigensolver algorithm is the large number of measurement steps required to estimate different terms in the Hamiltonian of interest. Unitary partitioning reduces this overhead by transforming the…
Stochastic Hamiltonian partial differential equations, which possess the multi-symplectic conservation law, are an important and fairly large class of systems. The multi-symplectic methods inheriting the geometric features of stochastic…
This paper illuminates the derivation, the applicability, and the efficiency of the Multiplicative Runge-Kutta Method, derived in the frame- work of geometric multiplicative calculus. The removal of the restrictions of geometric…
We introduce a hybrid classical-quantum algorithm for simulating a Hamiltonian of the form $H= \sum_{i=1}^K H_i = \sum_{i=1}^K H_{i_1} \otimes H_{i_2} \otimes \cdots \otimes H_{i_M}$. Given that the entries of all $\{ H_{i_1}, H_{i_2} ,…
We propose an extended framework for continuous-stage Runge-Kutta methods which enables us to treat more complicated cases especially for the case weighting on infinite intervals. By doing this, various types of weighted orthogonal…