Tensor approximation of the self-diffusion matrix of tagged particle processes

Abstract

The objective of this paper is to investigate a new numerical method for the approximation of the self-diffusion matrix of a tagged particle process defined on a grid. While standard numerical methods make use of long-time averages of empirical means of deviations of some stochastic processes, and are thus subject to statistical noise, we propose here a tensor method in order to compute an approximation of the solution of a high-dimensional quadratic optimization problem, which enables to obtain a numerical approximation of the self-diffusion matrix. The tensor method we use here relies on an iterative scheme which builds low-rank approximations of the quantity of interest and on a carefully tuned variance reduction method so as to evaluate the various terms arising in the functional to minimize. In particular, we numerically observe here that it is much less subject to statistical noise than classical approaches.

References in corpus (6)

• Tensor product methods and entanglement optimization for ab initio quantum chemistry
• Spatial structures and dynamics of kinetically constrained models for glasses
• A literature survey of low-rank tensor approximation techniques
• The speed of the tagged particle in the exclusion process on Galton-Watson trees
• Finite-dimensional approximation for the diffusion coefficient in the simple exclusion process
• Limit theorems for the tagged particle in exclusion processes on regular trees

Cited by in corpus (2)

• Exact hydrodynamics and onset of phase separation for an active exclusion process
• Dynamical patterns and nonreciprocal effective interactions in an active-passive mixture through exact hydrodynamic analysis