Papers › Adaptive Numerical Solution of Kadanoff-Baym Equations
Adaptive Numerical Solution of Kadanoff-Baym Equations
Francisco Meirinhos, Michael Kajan, Johann Kroha, Tim Bode
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
A time-stepping scheme with adaptivity in both the step size and the integration order is presented in the context of non-equilibrium dynamics described via Kadanoff-Baym equations. The accuracy and effectiveness of the algorithm are analysed by obtaining numerical solutions of exactly solvable models. We find a significant reduction in the number of time-steps compared to fixed-step methods. Due to the at least quadratic scaling of Kadanoff-Baym equations, reducing the amount of steps can dramatically increase the accessible integration time, opening the door for the study of long-time dynamics in interacting systems. A selection of illustrative examples is provided, among them interacting and open quantum systems as well as classical stochastic processes. An open-source implementation of our algorithm in the scientific-computing language Julia is made available.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections