Related papers: Systematically Accelerated Convergence of Path Int…
We present and discuss a detailed derivation of a new analytical method that systematically improves the convergence of path integrals of a generic $N$-fold discretized theory. We develop an explicit procedure for calculating a set of…
A recently developed analytical method for systematic improvement of the convergence of path integrals is used to derive a generalization of Euler's summation formula for path integrals. The first $p$ terms in this formula improve…
We generalize a recently developed method for accelerated Monte Carlo calculation of path integrals to the physically relevant case of generic many-body systems. This is done by developing an analytic procedure for constructing a hierarchy…
A recently developed method, introduced in Phys. Rev. Lett. 94 (2005) 180403, Phys. Rev. B 72 (2005) 064302, Phys. Lett. A 344 (2005) 84, systematically improved the convergence of generic path integrals for transition amplitudes. This was…
A newly developed method for systematically improving the convergence of path integrals for transition amplitudes, introduced in Phys. Rev. Lett. 94 (2005) 180403, Phys. Rev. B 72 (2005) 064302, Phys. Lett. A 344 (2005) 84, and expectation…
We present Path Integral Monte Carlo C code for calculation of quantum mechanical transition amplitudes for 1D models. The SPEEDUP C code is based on the use of higher-order short-time effective actions and implemented to the maximal order…
Although Anderson acceleration (AA) is known to speed up fixed-point iterations, it is rarely applied in constrained optimization, in particular sequential quadratic programming (SQP). We show that the local convergence behavior of a…
Requiring that the path integral has the global symmetries of the classical action and obeys the natural composition property of path integrals, and also that the discretized action has the correct naive continuum limit, we find a viable…
The cumulant representation of the Fourier path integral method is examined to determine the asymptotic convergence characteristics of the imaginary-time density matrix with respect to the number of path variables $N$ included. It is proved…
A simple and efficient method for quantum Monte Carlo simulation is presented, based on discretization of the action in the path integral, and a Gaussian averaging of the potential, which works well e.g. with the Coulomb potential.
We introduce and analyze a new quantity, the path integral ideal, governing the flow of generic discrete theories to the continuum limit and greatly increasing their convergence. The said flow is classified according to the degree of…
We prove an extension to the classical continuity theorem in rough paths. We show that two $p$-rough paths are close in all levels of iterated integrals provided the first $\lfl p \rfl$ terms are close in a uniform sense. Applications…
The main purpose of this paper is to investigate the strong approximation of the $p$-fold integrated empirical process, $p$ being a fixed positive integer. More precisely, we obtain the exact rate of the approximations by a sequence of…
A new approach to stochastic integration is described, which is based on an a.s. pathwise approximation of the integrator by simple, symmetric random walks. Hopefully, this method is didactically more advantageous, more transparent, and…
In the NP-hard \textsc{Group Closeness Centrality Maximization} problem, the input is a graph $G = (V,E)$ and a positive integer $k$, and the task is to find a set $S \subseteq V$ of size $k$ that maximizes the reciprocal of group farness…
We investigate a family of approximate multi-step proximal point methods, framed as implicit linear discretizations of gradient flow. The resulting methods are multi-step proximal point methods, with similar computational cost in each…
In this and subsequent paper arXiv:1011.5185 we develop a recursive approach for calculating the short-time expansion of the propagator for a general quantum system in a time-dependent potential to orders that have not yet been accessible…
In recent years efficient algorithms have been developed for the numerical computation of relativistic single-particle path integrals in quantum field theory. Here, we adapt this "worldline Monte Carlo" approach to the standard problem of…
This paper presents convergence acceleration, a method for computing efficiently the limit of numerical sequences as a typical application of streams and higher-order functions.
Several new accelerated methods in minimax optimization and fixed-point iterations have recently been discovered, and, interestingly, they rely on a mechanism distinct from Nesterov's momentum-based acceleration. In this work, we show that…