Related papers: On a large-stepsize integrator for charged-particl…
We extend the asymptotic preserving and energy conserving time integrator for charged-particle motion developed in [Ricketson & Chac\'on, JCP, 2020] to include finite Larmor-radius (FLR) effects in the presence of electric-field…
The Majorization Principle is a fundamental statement governing the dynamics of information processing in optimal and efficient quantum algorithms. While quantum computation can be modeled to be reversible, due to the unitary evolution…
We present a new method to propagate rotating Bose-Einstein condensates subject to explicitly time-dependent trapping potentials. Using algebraic techniques, we combine Magnus expansions and splitting methods to yield any order methods for…
The partitioned approach for the numerical integration of power system differential algebraic equations faces inherent numerical stability challenges due to delays between the computation of state and algebraic variables. Such delays can…
The particle-based, rapid incremental smoother (PARIS) is a sequential Monte Carlo technique allowing for efficient online approximation of expectations of additive functionals under Feynman--Kac path distributions. Under weak assumptions,…
In this paper, we rigorously analyze the energy, momentum and magnetic moment behaviours of two splitting methods for solving charged-particle dynamics. The near-conservations of these invariants are given for the system under constant…
We derive a master equation for the motion of a polarizable particle weakly interacting with one or several strongly pumped cavity modes. We focus here on massive particles with complex internal structure such as large molecules and…
We present a new, simple, fast algorithm to numerically evolve disks of inelastically colliding particles surrounding a central star. Our algorithm adds negligible computational cost to the fastest existing collisionless N-body codes, and…
In this work, the benefits of the phase fitting technique are embedded in high order discrete Lagrangian integrators. The proposed methodology creates integrators with zero phase lag in a test Lagrangian in a similar way used in phase…
In computational inverse problems, it is common that a detailed and accurate forward model is approximated by a computationally less challenging substitute. The model reduction may be necessary to meet constraints in computing time when…
Shor's algorithm for integer factorization offers an exponential speedup over classical methods but remains impractical on Noisy Intermediate Scale Quantum (NISQ) hardware due to the need for many coherent qubits and very deep circuits.…
In this work, we propose a numerical approach for simulations of large deformations of interfaces in a level set framework. To obtain a fast and viable numerical solution in both time and space, temporal discretization is based on the…
A new approach for integration of motion in many-body systems of interacting polyatomic molecules is proposed. It is based on splitting time propagation of pseudo-variables in a modified phase space, while the real translational and…
In this paper, an implicit nonsymplectic exact energy-preserving integrator is specifically designed for a ten-dimensional phase-space conservative Hamiltonian system with five degrees of freedom. It is based on a suitable…
Parameters of differential equations are essential to characterize intrinsic behaviors of dynamic systems. Numerous methods for estimating parameters in dynamic systems are computationally and/or statistically inadequate, especially for…
Computer model calibration is a crucial step in building a reliable computer model. In the face of massive physical observations, a fast estimation for the calibration parameters is urgently needed. To alleviate the computational burden, we…
We have presented some practical consequences on the molecular-dynamics simulations arising from the numerical algorithm published recently in paper Int. J. Mod. Phys. C 16, 413 (2005). The algorithm is not a finite-difference method and…
We describe an algorithm for long-term planetary orbit integrations, including the dominant post-Newtonian effects, that employs individual timesteps for each planet. The algorithm is symplectic and exhibits short-term errors that are…
This paper introduces an efficient algorithm for computing the general oscillatory matrix functions. These computations are crucial for solving second-order semi-linear initial value problems. The method is exploited using the scaling and…
Explicit time-marching schemes are popular for solving time-dependent partial differential equations; one of the biggest challenges these methods suffer is increasing the critical time-marching step size that guarantees numerical stability.…