Related papers: An adaptive symplectic integrator for gravitationa…
In previous papers, explicit symplectic integrators were designed for nonrotating black holes, such as a Schwarzschild black hole. However, they fail to work in the Kerr spacetime because not all variables can be separable, or not all…
In this paper, explicit stable integrators based on symplectic and contact geometries are proposed for a non-autonomous ordinarily differential equation (ODE) found in improving convergence rate of Nesterov's accelerated gradient method.…
Runge-Kutta methods are affine equivariant: applying a method before or after an affine change of variables yields the same numerical trajectory. However, for some applications, one would like to perform numerical integration after a…
We implement and investigate the numerical properties of a new family of integrators connecting both variants of the symplectic Euler schemes, and including an alternative to the classical symplectic mid-point scheme, with some additional…
We propose Newton-PIPG, an efficient method for solving quadratic programming (QP) problems arising in optimal control, subject to additional set constraints. Newton-PIPG integrates the Proportional-Integral Projected Gradient (PIPG) method…
This paper studies diagonal implicit symplectic extended Runge--Kutta--Nystr\"{o}m (ERKN) methods for solving the oscillatory Hamiltonian system $H(q,p)=\dfrac{1}{2}p^{T}p+\dfrac{1}{2}q^{T}Mq+U(q)$. Based on symplectic conditions and order…
We propose a family of integrators, Flow-Composed Implicit Runge-Kutta (FCIRK) methods, for perturbations of nonlinear ordinary differential equations, consisting of the composition of flows of the unperturbed part alternated with one step…
Calculating the long term solution of ordinary differential equations, such as those of the $N$-body problem, is central to understanding a wide range of dynamics in astrophysics, from galaxy formation to planetary chaos. Because generally…
A space-time adaptive scheme is presented for solving advection equations in two space dimensions. The gradient-augmented level set method using a semi-Lagrangian formulation with backward time integration is coupled with a point value…
We propose a novel algorithm for the approximation of surface-quasi geostrophic (SQG) flows modeled by a nonlinear partial differential equation coupling transport and fractional diffusion phenomena. The time discretization consists of an…
The effects of kinetic-energy preservation errors due to Runge-Kutta (RK) temporal integrators have been analyzed for the case of large-eddy simulations of incompressible turbulent channel flow. Simulations have been run using the…
Time-reversible symplectic methods, which are precisely compatible with Liouville's phase-volume-conservation theorem, are often recommended for computational simulations of Hamiltonian mechanics. Lack of energy drift is an apparent…
The algebraic polynomial interpolation on uniformly distributed nodes is affected by the Runge phenomenon, also when the function to be interpolated is analytic. Among all techniques that have been proposed to defeat this phenomenon, there…
We develop Chebyshev symplectic methods based on Chebyshev orthogonal polynomials of the first and second kind separately in this paper. Such type of symplectic methods can be conveniently constructed with the newly-built theory of weighted…
A wide range of physical phenomena exhibit auxiliary admissibility criteria, such as conservation of entropy or various energies, which arise implicitly under exact solution of their governing PDEs. However, standard temporal schemes, such…
We propose a sequential quadratic programming (SQP) algorithm for inequality constrained optimization that is robust to the presence of bounded noise in function and derivative evaluations. We cover the case where constraint evaluations…
We introduce a class of fourth order symplectic algorithms that are ideal for doing long time integration of gravitational few-body problems. These algorithms have only positive time steps, but require computing the force gradient in…
Recently, the proximal Newton-type method and its variants have been generalized to solve composite optimization problems over the Stiefel manifold whose objective function is the summation of a smooth function and a nonsmooth function. In…
We propose a sequential quadratic programming (SQP) method that can incorporate adaptive sampling for stochastic nonsmooth nonconvex optimization problems with upper-C^2 objectives. Upper-$\Ctwo$ functions can be viewed as…
Computer simulations in QCD are based on the discretization of the theory on a Euclidean lattice. To compute the mean value of an observable, usually the Hybrid Monte Carlo method is applied. Here equations of motion, derived from an…