Low rank compression in the numerical solution of the nonequilibrium Dyson equation
Jason Kaye, Denis Gole\v{z}

TL;DR
This paper introduces a hierarchical low rank compression method for the nonequilibrium Dyson equation, significantly reducing computational and memory costs, enabling longer simulations in quantum many-body physics.
Contribution
The paper presents a novel hierarchical low rank data structure and algorithm that accelerates and reduces memory usage in solving the nonequilibrium Dyson equation.
Findings
Reduces computational complexity from cubic to near quadratic.
Decreases memory complexity from quadratic to near linear.
Enables simulation of large systems with thousands of time steps in feasible time.
Abstract
We propose a method to improve the computational and memory efficiency of numerical solvers for the nonequilibrium Dyson equation in the Keldysh formalism. It is based on the empirical observation that the nonequilibrium Green's functions and self energies arising in many problems of physical interest, discretized as matrices, have low rank off-diagonal blocks, and can therefore be compressed using a hierarchical low rank data structure. We describe an efficient algorithm to build this compressed representation on the fly during the course of time stepping, and use the representation to reduce the cost of computing history integrals, which is the main computational bottleneck. For systems with the hierarchical low rank property, our method reduces the computational complexity of solving the nonequilibrium Dyson equation from cubic to near quadratic, and the memory complexity from…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
