Related papers: Singular Euler-Maclaurin expansion
In this paper, for compressible Euler equations in multiple space dimensions, we prove the break-down of classical solutions with a large class of initial data by tracking the propagation of radially symmetric expanding wave including…
Quantum algorithms for Hamiltonian simulation and linear differential equations more generally have provided promising exponential speed-ups over classical computers on a set of problems with high real-world interest. However, extending…
Multi-derivative one-step methods based upon Euler-Maclaurin integration formulae are considered for the solution of canonical Hamiltonian dynamical systems. Despite the negative result that simplecticity may not be attained by any…
Exponential integrability properties of numerical approximations are a key tool for establishing positive rates of strong and numerically weak convergence for a large class of nonlinear stochastic differential equations. It turns out that…
We study the q-analogue of Euler-Maclaurin formula and by introducing a new q-operator we drive to this form. Moreover, approximation properties of q-Bernoulli polynomials is discussed. We estimate the suitable functions as a combination of…
Modern density functional approximations achieve moderate accuracy at low computational cost for many electronic structure calculations. Some background is given relating the gradient expansion of density functional theory to the WKB…
Whether the 3D incompressible Euler equations can develop a singularity in finite time from smooth initial data is one of the most challenging problems in mathematical fluid dynamics. This work attempts to provide an affirmative answer to…
Sequence transformations are valuable numerical tools that have been used with considerable success for the acceleration of convergence and the summation of diverging series. However, our understanding of their theoretical properties is far…
We apply the Euler--Maclaurin formula to find the asymptotic expansion of the sums $\sum_{k=1}^n (\log k)^p / k^q$, ~$\sum k^q (\log k)^p$, ~$\sum (\log k)^p /(n-k)^q$, ~$\sum 1/k^q (\log k)^p $ in closed form to arbitrary order ($p,q…
A new sampling methodology based on incomplete cosine expansion series is presented as an alternative to the traditional sinc function approach. Numerical integration shows that this methodology is efficient and practical. Applying the…
We introduce an accurate and efficient method for a class of nonlocal potential evaluations with free boundary condition, including the 3D/2D Coulomb, 2D Poisson and 3D dipolar potentials. Our method is based on a Gaussian-sum approximation…
Explicit formulas expressing the solution to non-autonomous differential equations are of great importance in many application domains such as control theory or numerical operator splitting. In particular, intrinsic formulas allowing to…
Leonhard Euler likely developed his summation formula in 1732, and soon used it to estimate the sum of the reciprocal squares to 14 digits --- a value mathematicians had been competing to determine since Leibniz's astonishing discovery that…
By introducing a new averaged quantity with a fast decay weight to perform Sideris's argument (Commun Math Phys, 1985) developed for the Euler Equations, we extend the formation of singularities of classical solution to the 3D Euler…
The unitary coupled cluster (UCC) approximation is one of the more promising wave-function ans\"atze for electronic structure calculations on quantum computers via the variational quantum eigensolver algorithm. However, for large systems…
We present a general method for decomposing non-unitary operators into a linear combination of unitary operators, where the approximation error decays exponentially. The decomposition is based on a smooth periodic extension of the identity…
This is a sequel of our previous paper where we described an algorithm to find a solution of differential equations for master integrals in the form of an $\epsilon$-expansion series with numerical coefficients. The algorithm is based on…
Given a Feynman parameter integral, depending on a single discrete variable $N$ and a real parameter $\epsilon$, we discuss a new algorithmic framework to compute the first coefficients of its Laurent series expansion in $\epsilon$. In a…
The main issue of this work consists in extracting one or several finite values for the sum of series involved in perturbation theories. It is supposed to work for all cases in which two physical parameters are involved, and makes thorough…
The Parareal algorithm is used to solve time-dependent problems considering multiple solvers that may work in parallel. The key feature is a initial rough approximation of the solution that is iteratively refined by the parallel solvers. We…