arXiv · 2611.19128
Efficient simulation of the generalized Langevin equation using a basis of dynamically relevant histories for memory and noise
Abstract
The Generalized Langevin Equation (GLE) is a cornerstone for modeling non-Markovian dynamics, but its numerical solution remains challenging due to the history-dependent convolution and the need to generate colored noise with a prescribed correlation function. We introduce a forward construction that addresses both challenges within a single framework. We represent an arbitrary trajectory as sum of relevant and irrelevant parts, where relevant part can be decomposed into a small number of characteristic history patterns that make the main contribution to future dynamics. It allows to reduce numerical cost to \(O(d^2)\) for $d$ chosen patterns instead of full history. The same construction applies to colored noise generation, where the causal filter plays the role of the memory kernel. We demonstrate the accuracy and efficiency of the method for several representative kernels, including long-range kernels with power-law tails.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Dmitriy Kondaurov, Evgeny Polyakov. 2026-11-14. Efficient simulation of the generalized Langevin equation using a basis of dynamically relevant histories for memory and noise. https://searcharxiv.com/abs/2611.19128
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.