430 research outputs found
Reconstruction of thermally-symmetrized quantum autocorrelation functions from imaginary-time data
In this paper, I propose a technique for recovering quantum dynamical
information from imaginary-time data via the resolution of a one-dimensional
Hamburger moment problem. It is shown that the quantum autocorrelation
functions are uniquely determined by and can be reconstructed from their
sequence of derivatives at origin. A general class of reconstruction algorithms
is then identified, according to Theorem 3. The technique is advocated as
especially effective for a certain class of quantum problems in continuum
space, for which only a few moments are necessary. For such problems, it is
argued that the derivatives at origin can be evaluated by Monte Carlo
simulations via estimators of finite variances in the limit of an infinite
number of path variables. Finally, a maximum entropy inversion algorithm for
the Hamburger moment problem is utilized to compute the quantum rate of
reaction for a one-dimensional symmetric Eckart barrier.Comment: 15 pages, no figures, to appear in Phys. Rev.
Analysis of some interior point continuous trajectories for convex programming
In this paper, we analyse three interior point continuous trajectories for convex programming with general linear constraints. The three continuous trajectories are derived from the primal–dual path-following method, the primal–dual affine scaling method and the central path, respectively. Theoretical properties of the three interior point continuous trajectories are fully studied. The optimality and convergence of all three interior point continuous trajectories are obtained for any interior feasible point under some mild conditions. In particular, with proper choice of some parameters, the convergence for all three interior point continuous trajectories does not require the strict complementarity or the analyticity of the objective function. These results are new in the literature
Singularity analysis, Hadamard products, and tree recurrences
We present a toolbox for extracting asymptotic information on the
coefficients of combinatorial generating functions. This toolbox notably
includes a treatment of the effect of Hadamard products on singularities in the
context of the complex Tauberian technique known as singularity analysis. As a
consequence, it becomes possible to unify the analysis of a number of
divide-and-conquer algorithms, or equivalently random tree models, including
several classical methods for sorting, searching, and dynamically managing
equivalence relationsComment: 47 pages. Submitted for publicatio
An Analytic Propositional Proof System on Graphs
In this paper we present a proof system that operates on graphs instead of
formulas. Starting from the well-known relationship between formulas and
cographs, we drop the cograph-conditions and look at arbitrary undirected)
graphs. This means that we lose the tree structure of the formulas
corresponding to the cographs, and we can no longer use standard proof
theoretical methods that depend on that tree structure. In order to overcome
this difficulty, we use a modular decomposition of graphs and some techniques
from deep inference where inference rules do not rely on the main connective of
a formula. For our proof system we show the admissibility of cut and a
generalization of the splitting property. Finally, we show that our system is a
conservative extension of multiplicative linear logic with mix, and we argue
that our graphs form a notion of generalized connective
- …