Related papers: An Exact Bitwise Reversible Integrator
We present a simple algorithm to switch between $N$-body time integrators in a reversible way. We apply it to planetary systems undergoing arbitrarily close encounters and highly eccentric orbits, but the potential applications are broader.…
Solving linear systems is a ubiquitous task in science and engineering. Because directly inverting a large-scale linear system can be computationally expensive, iterative algorithms are often used to numerically find the inverse. To…
An explicit second-order numerical method to integrate the isokinetic equations of motion is derived by fitting circular arcs through every three consecutive points of the discretized trajectory, so that the tangent and the curvature…
The evolution of any factorized time-reversible symplectic integrators, when applied to the harmonic oscillator, can be exactly solved in a closed form. The resulting modified Hamiltonians demonstrate the convergence of the Lie series…
Reversible simulation of irreversible algorithms is analyzed in the stylized form of a `reversible' pebble game. While such simulations incur little overhead in additional computation time, they use a large amount of additional memory space…
Most numerical methods for time integration use real-valued time steps. Complex time steps, however, can provide an additional degree of freedom, as we can select the magnitude of the time step in both the real and imaginary directions. We…
A very simple explicit integrator for the rotational motion of rigid linear molecules is presented which can preserve the rigidity of the molecules without requiring any constraint force. The integrator is time-reversible and symplectic,…
In computational design and fabrication, neural networks are becoming important surrogates for bulky forward simulations. A long-standing, intertwined question is that of inverse design: how to compute a design that satisfies a desired…
We point out that two of Milne's fourth-order integrators are well-suited to bit-reversible simulations. The fourth-order method improves on the accuracy of Levesque and Verlet's algorithm and simplifies the definition of the velocity $v$…
Simulations of the dynamics generated by partial differential equations (PDEs) provide approximate, numerical solutions to initial value problems. Such simulations are ubiquitous in scientific computing, but the correctness of the results…
The simulation of systems that act on multiple time scales is challenging. A stable integration of the fast dynamics requires a highly accurate approximation whereas for the simulation of the slow part, a coarser approximation is accurate…
Molecular Dynamics method is based on solution of Newtonian differential equations of motion. A new very accurate and efficient time-reversible explicit integrator was derived on the basis of second order Tailor expansion of force. There is…
We propose to solve inverse problems involving the temporal evolution of physics systems by leveraging recent advances from diffusion models. Our method moves the system's current state backward in time step by step by combining an…
This paper presents an efficient reversible algorithm for linear regression, both with and without ridge regression. Our reversible algorithm matches the asymptotic time and space complexity of standard irreversible algorithms for this…
We analyze the preservation properties of a family of reversible splitting methods when they are applied to the numerical time integration of linear differential equations defined in the unitary group. The schemes involve complex…
By combining a standard symmetric, symplectic integrator with a new step size controller, we provide an integration scheme that is symmetric, reversible and conserves the values of the constants of motion. This new scheme is appropriate for…
Symplectic integration algorithms are well-suited for long-term integrations of Hamiltonian systems because they preserve the geometric structure of the Hamiltonian flow. However, this desirable property is generally lost when adaptive…
Symplectic integration algorithms have become popular in recent years in long-term orbital integrations because these algorithms enforce certain conservation laws that are intrinsic to Hamiltonian systems. For problems with large variations…
When an inverse problem is solved by a gradient-based optimization algorithm, the corresponding forward and adjoint problems, which are introduced to compute the gradient, can be also solved iteratively. The idea of iterating at the same…
A method for time-reversible numerical integration of the deterministic Landau-Lifshitz Gilbert equation by means of a second order Suzuki-Trotter decomposition is presented and tested against commonly used second order predictor-corrector…