Related papers: Magnus integrators on multicore CPUs and GPUs
Iterative solutions of sparse linear systems and sparse eigenvalue problems have a fundamental role in vital fields of scientific research and engineering. The crucial computing kernel for such iterative solutions is the multiplication of a…
Photonic Ising Machines constitute an emergent new paradigm of computation, geared towards tackling combinatorial optimization problems that can be reduced to the problem of finding the ground state of an Ising model. Spatial Photonic Ising…
We investigate the computational performance of various numerical methods for the integration of the equations of motion and the variational equations for some typical classical many-body models of condensed matter physics: the…
Dependable numerical results from long-time simulations require stable numerical integration schemes. For Hamiltonian systems, this is achieved with symplectic integrators, which conserve the symplectic condition and exactly solve for the…
We propose a fast integrator to a class of dynamical systems with several temporal scales. The proposed method is developed as an extension of the variable step size Heterogeneous Multiscale Method (VSHMM), which is a two-scale integrator…
The numerical simulation of structural mechanics applications via finite elements usually requires the solution of large-size and ill-conditioned linear systems, especially when accurate results are sought for derived variables interpolated…
We present an optimized algorithm calculating determinant for multivariate polynomial matrix on GPU. The novel algorithm provides precise determinant for input multivariate polynomial matrix in controllable time. Our approach is based on…
Two families of symplectic methods specially designed for second-order time-dependent linear systems are presented. Both are obtained from the Magnus expansion of the corresponding first-order equation, but otherwise they differ in…
Exponential integrators have been introduced as an efficient alternative to explicit and implicit methods for integrating large stiff systems of differential equations. Over the past decades these methods have been studied theoretically and…
We present a fully Julia-based, GPU-accelerated workflow for solving large-scale sparse nonlinear optimal control problems. Continuous-time dynamics are modeled and then discretized via direct transcription with \texttt{OptimalControl.jl}…
In the context of cryptanalysis, computing discrete logarithms in large cyclic groups using index-calculus-based methods, such as the number field sieve or the function field sieve, requires solving large sparse systems of linear equations…
The parareal in time algorithm allows to efficiently use parallel computing for the simulation of time-dependent problems. It is based on a decomposition of the time interval into subintervals, and on a predictor-corrector strategy, where…
We present a new parallel numerical method for solving the non-stationary Schr\"odinger equation with linear nonlocal condition and time-dependent potential which does not commute with the stationary part of the Hamiltonian. The given…
Accurately simulating the non-Markovian dynamics of open quantum systems remains a significant challenge. While the recently proposed time-evolving matrix product operator (TEMPO) algorithm based on path integrals successfully circumvents…
In this paper, we report new results on a novel Ising machine technology for solving combinatorial optimization problems using networks of coupled self-sustaining oscillators. Specifically, we present several working hardware prototypes…
We derive a Magnus expansion for a frequency chirped quantum two-level system. We obtain a time-independent effective Hamiltonian which generates a stroboscopic time evolution. At lowest order the according dynamics is identical to results…
We consider the numerical integration of the Schr\"odinger equation with a time-dependent Hamiltonian given as the sum of the kinetic energy and a time-dependent potential. Commutator-free (CF) propagators are exponential propagators that…
We present a multiscale integrator for Hamiltonian systems with slowly varying quadratic stiff potentials that uses coarse timesteps (analogous to what the impulse method uses for constant quadratic stiff potentials). This method is based…
Large sparse symmetric linear systems appear in several branches of science and engineering thanks to the widespread use of the finite element method (FEM). The fastest sparse linear solvers available implement hybrid iterative methods.…
This paper is devoted to the study of acceleration methods for an inequality constrained convex optimization problem by using Lyapunov functions. We first approximate such a problem as an unconstrained optimization problem by employing the…