相关论文: Grassmann integrals by machine

We show how the integral formula of Poisson for holomorphic functions on the right half plane can be used to quickly evaluate certain integrals from the Table of Gradshteyn and Ryzhik. In addition, we prove a version of this formula for…

Numerically exact continuous-time Quantum Monte Carlo algorithm for finite fermionic systems with non-local interactions is proposed. The scheme is particularly applicable for general multi-band time-dependent correlations since it does not…

The efficiency of Gr\"obner basis computation, the standard engine for solving systems of polynomial equations, depends on the choice of monomial ordering. Despite a near-continuum of possible monomial orders, most implementations rely on…

We present a simulation algorithm for dynamical fermions that combines the multiboson technique with the Hybrid Monte Carlo algorithm. We find that the algorithm gives a substantial gain over the standard methods in practical simulations.…

We are interested in the fast computation of the exact value of integrals of polynomial functions over convex polyhedra. We present speed ups and extensions of the algorithms presented in previous work. We present the new software…

We present a simple derivation of a Feynman-Kac type formula to study fermionic systems. In this approach the real time or the imaginary time dynamics is expressed in terms of the evolution of a collection of Poisson processes. A computer…

Minimisation of discrete energies defined over factors is an important problem in computer vision, and a vast number of MAP inference algorithms have been proposed. Different inference algorithms perform better on factor graph models (GMs)…

Affine systems reachability is the basis of many verification methods. With further computation, methods exist to reason about richer models with inputs, nonlinear differential equations, and hybrid dynamics. As such, the scalability of…

The multi-frontal direct solver is the state-of-the-art algorithm for the direct solution of sparse linear systems. This paper provides computational complexity and memory usage estimates for the application of the multi-frontal direct…

We propose a Multiscale Invertible Generative Network (MsIGN) and associated training algorithm that leverages multiscale structure to solve high-dimensional Bayesian inference. To address the curse of dimensionality, MsIGN exploits the…

I describe a package written in MATHEMATICA that automatizes typical operations performed during evaluation of Feynman graphs with Mellin-Barnes (MB) techniques. The main procedure allows to analytically continue a MB integral in a given…

Covariance estimation and selection for multivariate datasets in a high-dimensional regime is a fundamental problem in modern statistics. Gaussian graphical models are a popular class of models used for this purpose. Current Bayesian…

This paper proposes a symbolic-numeric Bayesian filtering method for a class of discrete-time nonlinear stochastic systems to achieve high accuracy with a relatively small online computational cost. The proposed method is based on the…

In this paper, Bernstein piecewise polynomials are used to solve the integral equations numerically. A matrix formulation is given for a non-singular linear Fredholm Integral Equation by the technique of Galerkin method. In the Galerkin…

A parallel, blocked, one-sided Hari--Zimmermann algorithm for the generalized singular value decomposition (GSVD) of a real or a complex matrix pair $(F,G)$ is here proposed, where $F$ and $G$ have the same number of columns, and are both…

The advantages of using Multi-Step corrections for simulations of lattice gauge theories with dynamical fermions will be discussed. This technique is suited for algorithms based on the Multi-Boson representation of the dynamical fermions as…

The correct computation of orbits of discrete dynamical systems on the interval is considered. Therefore, an arbitrary-precision floating-point approach based on automatic error analysis is chosen and a general algorithm is presented. The…

Quantum Monte-Carlo (QMC) simulations involving fermions have the notorious sign problem. Some well-known exceptions of the auxiliary field QMC algorithm rely on the factorizibility of the fermion determinant. Recently, a fermionic QMC…

We analyze the dynamics of an algorithm for approximate inference with large Gaussian latent variable models in a student-teacher scenario. To model nontrivial dependencies between the latent variables, we assume random covariance matrices…

We show that the computational effort for the numerical solution of fermionic quantum systems, occurring e.g., in quantum chemistry, solid state physics, field theory in principle grows with less than the square of the particle number for…