Related papers: Multi-product splitting and Runge-Kutta-Nystrom in…

The reformulation-linearization technique (RLT) is a prominent approach to constructing tight linear relaxations of non-convex continuous and mixed-integer optimization problems. The goal of this paper is to extend the applicability and…

Let $\mathfrak{g}$ be a Leibniz algebra and $E$ a vector space containing $\mathfrak{g}$ as a subspace. All Leibniz algebra structures on $E$ containing $\mathfrak{g}$ as a subalgebra are explicitly described and classified by two…

The generalized *-products, or the $*_N$-products, appear both in the one-loop effective action of noncommutative Yang-Mills theories and in the coupling of a closed string to N open strings on a disk when the D-brane world-volume is…

Analytic combinatorics studies the asymptotic behaviour of sequences through the analytic properties of their generating functions. This article provides effective algorithms required for the study of analytic combinatorics in several…

We present here a new splitting method to solve Lyapunov equations of the type $AP + PA^T=-BB^T$ in a Kronecker product form. Although that resulting matrix is of order $n^2$, each iteration of the method demands only two operations with…

We present a hybrid classical/quantum algorithm for efficiently solving the eigenvalue problem of many-particle Hamiltonians on quantum computers with limited resources by splitting the workload between classical and quantum processors.…

We investigate Lie-Trotter product formulae for abstract nonlinear evolution equations with delay. Using results from the theory of nonlinear contraction semigroups in Hilbert spaces, we explain the convergence of the splitting procedure.…

Two specialized algorithms for the numerical integration of the equations of motion of a Brownian walker obeying detailed balance are introduced. The algorithms become symplectic in the appropriate limits, and reproduce the equilibrium…

We classify two-qubit commuting Hamiltonians in terms of their computational complexity. Suppose one has a two-qubit commuting Hamiltonian H which one can apply to any pair of qubits, starting in a computational basis state. We prove a…

In this technical note a general procedure is described to construct internally consistent splitting methods for the numerical solution of differential equations, starting from matching pairs of explicit and diagonally implicit Runge-Kutta…

Observables of quantum or classical mechanics form algebras called quantum or classical Hamilton algebras respectively (Grgin E and Petersen A (1974) {\it J Math Phys} {\bf 15} 764\cite{grginpetersen}, Sahoo D (1977) {\it Pramana} {\bf 8}…

Given an observable and its operator product expansion (OPE), we present expressions that carefully disentangle truncated sums of the perturbative series in powers of $\alpha$ from the non-perturbative (NP) corrections. This splitting is…

In this paper, we develop high-order splitting methods for linear port-Hamiltonian systems, focusing on preserving their intrinsic structure, particularly the dissipation inequality. Port-Hamiltonian systems are characterized by their…

We show how the Hamiltonian Monte Carlo algorithm can sometimes be speeded up by "splitting" the Hamiltonian in a way that allows much of the movement around the state space to be done at low computational cost. One context where this is…

Let $G$ be a finite group generated by $k$ elements. The well-known product replacement algorithm provides an effective method for sampling generating sets of $G$. We study a refinement of this algorithm that is designed to output…

Let $\mathscr{R}$ be a type $II_1$ von Neumann algebra. We show that every unitary in $\mathscr{R}$ may be decomposed as the product of six symmetries (that is, self-adjoint unitaries) in $\mathscr{R}$, and every unitary in $\mathscr{R}$…

Polynomial multiplication is a fundamental problem in symbolic computation. There are efficient methods for the multiplication of two univariate polynomials. However, there is rarely efficiently nontrivial method for the multiplication of…

A semi-implicit-explicit (semi-IMEX) Runge-Kutta (RK) method is proposed for the numerical integration of ordinary differential equations (ODEs) of the form $\mathbf{u}' = \mathbf{f}(t,\mathbf{u}) + G(t,\mathbf{u}) \mathbf{u}$, where…

In this work we propose a new splitting technique, namely Asymmetric Forward-Backward-Adjoint splitting, for solving monotone inclusions involving three terms, a maximally monotone, a cocoercive and a bounded linear operator. Classical…

We study the problem of exponentially small splitting of separatrices of one degree of freedom classical Hamiltonian systems with a non-autonomous perturbation fast and periodic in time. We provide a result valid for general systems which…