Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1102.3137 · Physics Procedia

Lanczos-based Low-Rank Correction Method for Solving the Dyson Equation in Inhomogenous Dynamical Mean-Field Theory

Pierre Carrier, Jok Man Tang, Yousef Saad, James K. Freericks

Published Jan 1, 2011• 2 citations
arXivHTMLPDF

Abstract

Inhomogeneous dynamical mean-field theory has been employed to solve many interesting strongly interacting problems from transport in multilayered devices to the properties of ultracold atoms in a trap. The main computational step, especially for large systems, is the problem of calculating the inverse of a large sparse matrix to solve Dyson's equation and determine the local Green's function at each lattice site from the corresponding local self-energy. We present a new e_cient algorithm, the Lanczos-based low-rank algorithm, for the calculation of the inverse of a large sparse matrix which yields this local (imaginary time) Green's function. The Lanczos-based low-rank algorithm is based on a domain decomposition viewpoint, but avoids explicit calculation of Schur complements and relies instead on low-rank matrix approximations derived from the Lanczos algorithm, for solving the Dyson equation. We report at least a 25-fold improvement of performance compared to explicit decomposition (such as sparse LU) of the matrix inverse. We also report that scaling relative to matrix sizes, of the low-rank correction method on the one hand and domain decomposition methods on the other, are comparable.

DOI
10.1016/j.phpro.2011.05.054

Related papers

Low rank compression in the numerical solution of the nonequilibrium Dyson equation

Jason Kaye, Denis Golež

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 quadratic to near linear. We demonstrate the full solver for the Falicov-Kimball model exposed to a rapid ramp and Floquet driving of system parameters, and are able to increase feasible propagation times substantially. We present examples with 262 144 time steps, which would require approximately five months of computing time and 2.2 TB of memory using the direct time stepping method, but can be completed in just over a day on a laptop with less than 4 GB of memory using our method. We also confirm the hierarchical low rank property for the driven Hubbard model in the weak coupling regime within the GW approximation, and in the strong coupling regime within dynamical mean-field theory.

arXiv:2010.06511•SciPost Physics•Apr 26, 2021•56 citations

Efficiently Generalizing Ultra-Cold Atomic Simulations via Inhomogeneous Dynamical Mean-Field Theory from Two- to Three-Dimensions

James K. Freericks, H. R. Krishnamurthy, Pierre Carrier +1 more

We describe techniques that we are implementing to move inhomogeneous dynamical mean-field theory simulations from two-to three-dimensions. Two-dimensional simulations typically run on 2,000 - 10,000 lattice sites, while three-dimensional simulations typically need to run on 1,000,000 or more lattice sites. The inhomogeneous dynamical mean-field theory requires the diagonal of the inverse of many sparse matrices with the same sparsity pattern, and a dimension equal to the number of lattice-sites. For two-dimensional systems, we have employed general dense LAPACK routines since the matrices are small enough. For three-dimensional systems, we need to employ sparse matrix techniques. Here, we present one possible strategy for the sparse matrix routine, based on the well-known Lanczos technique, with a long run of the algorithm and (partial) reorthogonalization. This approach is about two-times faster than the LAPACK routines with identical accuracy, and hence will become the standard we use on the two-dimensional problems. We illustrate this approach on the problem of increasing the efficiency for pre-forming dipolar molecules in K-Rb mixtures on a lattice. We compare the local density approximation to inhomogeneous dynamical mean-field theory to illustrate how the local density approximation fails at low-temperature, and to illustrate the benefits of the new algorithms. For a three-dimensional problem, a speed-up of 1,000 or more times is needed. We end by discussing some options that are promising toward reaching this goal.

DoD High Performance Computing Modernization Program Users Group Conference (HPCMP-UGC)•Jun 1, 2010•2 citations

Application of the shift-invert Lanczos algorithm to a nonequilibrium Green's function for transport problems

Kunihito Uzawa, K. Hagino

Nonequilibrium Green's function theory and related methods are widely used to describe transport phenomena in many-body systems, but they often require a costly inversion of a large matrix. We show here that the shift-invert Lanczos method can dramatically reduce the computational effort. We apply the method to two test problems, namely a simple model Hamiltonian and to a more realistic Hamiltonian for nuclear fission. For a Hamiltonian of dimension 66 103 we find that the computation time is reduced by a factor of 33 compared to the direct calculation of the Green's function.

arXiv:2408.06554•Physical review. E•Nov 4, 2024•2 citations

A Davidson-Lanczos iteration method for computation of continued-fraction expansion of the Green's function at very low temperatures: Applications to the dynamical mean field theory

Medha Sharma, M. A. H. Ahsan

We present a combination method based on orignal version of Davidson algorithm for extracting few of the lowest eigenvalues and eigenvectors of a sparse symmetric Hamiltonian matrix and the simplest version of Lanczos technique for obtaining a tridiagonal representation of the Hamiltonian to compute the continued fraction expansion of the Green's function at a very low temperature. We compare the Davidson$+$Lanczos method with the full diagonalization on a one-band Hubbard model on a Bethe lattice of infinite-coordination using dynamical mean field theory.

arXiv:1409.3374•Sep 11, 2014•0 citations

Low-rank Green's function representations applied to dynamical mean-field theory

Nan Sheng, Alexander Hampel, Sophie Beck +4 more

Several recent works have introduced highly compact representations of single-particle Green's functions in the imaginary time and Matsubara frequency domains, as well as efficient interpolation grids used to recover the representations. In particular, the intermediate representation with sparse sampling and the discrete Lehmann representation (DLR) make use of low rank compression techniques to obtain optimal approximations with controllable accuracy. We consider the use of the DLR in dynamical mean-field theory (DMFT) calculations, and in particular show that the standard full Matsubara frequency grid can be replaced by the compact grid of DLR Matsubara frequency nodes. We test the performance of the method for a DMFT calculation of ${\mathrm{Sr}}_{2}{\mathrm{RuO}}_{4}$ at temperature $50\phantom{\rule{0.16em}{0ex}}\mathrm{K}$ using a continuous-time quantum Monte Carlo impurity solver, and demonstrate that Matsubara frequency quantities can be represented on a grid of only 36 nodes with no reduction in accuracy, or increase in the number of self-consistent iterations, despite the presence of significant Monte Carlo noise.

arXiv:2301.07764•Physical review. B./Physical review. B•Jun 13, 2023•8 citations

Quantum Computed Green's Functions using a Cumulant Expansion of the Lanczos Method

Gabriel Greene‐Diniz, David Zsolt Manrique, Kentaro Yamamoto +5 more

In this paper, we present a quantum computational method to calculate the many-body Green's function matrix in a spin orbital basis. We apply our approach to finite-sized fermionic Hubbard models and related impurity models within Dynamical Mean Field Theory, and demonstrate the calculation of Green's functions on Quantinuum's H1-1 trapped-ion quantum computer. Our approach involves a cumulant expansion of the Lanczos method, using Hamiltonian moments as measurable expectation values. This bypasses the need for a large overhead in the number of measurements due to repeated applications of the variational quantum eigensolver (VQE), and instead measures the expectation value of the moments with one set of measurement circuits. From the measured moments, the tridiagonalised Hamiltonian matrix can be computed, which in turn yields the Green's function via continued fractions. While we use a variational algorithm to prepare the ground state in this work, we note that the modularity of our implementation allows for other (non-variational) approaches to be used for the ground state.

arXiv:2309.09685•Quantum•Jun 20, 2024•10 citations
Inhomogeneous dynamical mean-field theory has been employed to solve many interesting strongly interacting problems from transport in multilayered devices to the properties of ultracold atoms in a trap. The main computational step, especially for large systems, is the problem of calculating the inverse of a large sparse matrix to solve Dyson's equation and determine the local Green's function at each lattice site from the corresponding local self-energy. We present a new e_cient algorithm, the Lanczos-based low-rank algorithm, for the calculation of the inverse of a large sparse matrix which yields this local (imaginary time) Green's function. The Lanczos-based low-rank algorithm is based on a domain decomposition viewpoint, but avoids explicit calculation of Schur complements and relies instead on low-rank matrix approximations derived from the Lanczos algorithm, for solving the Dyson equation. We report at least a 25-fold improvement of performance compared to explicit decomposition (such as sparse LU) of the matrix inverse. We also report that scaling relative to matrix sizes, of the low-rank correction method on the one hand and domain decomposition methods on the other, are comparable.
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 quadratic to near linear. We demonstrate the full solver for the Falicov-Kimball model exposed to a rapid ramp and Floquet driving of system parameters, and are able to increase feasible propagation times substantially. We present examples with 262 144 time steps, which would require approximately five months of computing time and 2.2 TB of memory using the direct time stepping method, but can be completed in just over a day on a laptop with less than 4 GB of memory using our method. We also confirm the hierarchical low rank property for the driven Hubbard model in the weak coupling regime within the GW approximation, and in the strong coupling regime within dynamical mean-field theory.
We describe techniques that we are implementing to move inhomogeneous dynamical mean-field theory simulations from two-to three-dimensions. Two-dimensional simulations typically run on 2,000 - 10,000 lattice sites, while three-dimensional simulations typically need to run on 1,000,000 or more lattice sites. The inhomogeneous dynamical mean-field theory requires the diagonal of the inverse of many sparse matrices with the same sparsity pattern, and a dimension equal to the number of lattice-sites. For two-dimensional systems, we have employed general dense LAPACK routines since the matrices are small enough. For three-dimensional systems, we need to employ sparse matrix techniques. Here, we present one possible strategy for the sparse matrix routine, based on the well-known Lanczos technique, with a long run of the algorithm and (partial) reorthogonalization. This approach is about two-times faster than the LAPACK routines with identical accuracy, and hence will become the standard we use on the two-dimensional problems. We illustrate this approach on the problem of increasing the efficiency for pre-forming dipolar molecules in K-Rb mixtures on a lattice. We compare the local density approximation to inhomogeneous dynamical mean-field theory to illustrate how the local density approximation fails at low-temperature, and to illustrate the benefits of the new algorithms. For a three-dimensional problem, a speed-up of 1,000 or more times is needed. We end by discussing some options that are promising toward reaching this goal.
Nonequilibrium Green's function theory and related methods are widely used to describe transport phenomena in many-body systems, but they often require a costly inversion of a large matrix. We show here that the shift-invert Lanczos method can dramatically reduce the computational effort. We apply the method to two test problems, namely a simple model Hamiltonian and to a more realistic Hamiltonian for nuclear fission. For a Hamiltonian of dimension 66 103 we find that the computation time is reduced by a factor of 33 compared to the direct calculation of the Green's function.
We present a combination method based on orignal version of Davidson algorithm for extracting few of the lowest eigenvalues and eigenvectors of a sparse symmetric Hamiltonian matrix and the simplest version of Lanczos technique for obtaining a tridiagonal representation of the Hamiltonian to compute the continued fraction expansion of the Green's function at a very low temperature. We compare the Davidson+++Lanczos method with the full diagonalization on a one-band Hubbard model on a Bethe lattice of infinite-coordination using dynamical mean field theory.
Several recent works have introduced highly compact representations of single-particle Green's functions in the imaginary time and Matsubara frequency domains, as well as efficient interpolation grids used to recover the representations. In particular, the intermediate representation with sparse sampling and the discrete Lehmann representation (DLR) make use of low rank compression techniques to obtain optimal approximations with controllable accuracy. We consider the use of the DLR in dynamical mean-field theory (DMFT) calculations, and in particular show that the standard full Matsubara frequency grid can be replaced by the compact grid of DLR Matsubara frequency nodes. We test the performance of the method for a DMFT calculation of Sr2RuO4{\mathrm{Sr}}_{2}{\mathrm{RuO}}_{4}Sr2​RuO4​ at temperature 50K50\phantom{\rule{0.16em}{0ex}}\mathrm{K}50K using a continuous-time quantum Monte Carlo impurity solver, and demonstrate that Matsubara frequency quantities can be represented on a grid of only 36 nodes with no reduction in accuracy, or increase in the number of self-consistent iterations, despite the presence of significant Monte Carlo noise.
In this paper, we present a quantum computational method to calculate the many-body Green's function matrix in a spin orbital basis. We apply our approach to finite-sized fermionic Hubbard models and related impurity models within Dynamical Mean Field Theory, and demonstrate the calculation of Green's functions on Quantinuum's H1-1 trapped-ion quantum computer. Our approach involves a cumulant expansion of the Lanczos method, using Hamiltonian moments as measurable expectation values. This bypasses the need for a large overhead in the number of measurements due to repeated applications of the variational quantum eigensolver (VQE), and instead measures the expectation value of the moments with one set of measurement circuits. From the measured moments, the tridiagonalised Hamiltonian matrix can be computed, which in turn yields the Green's function via continued fractions. While we use a variational algorithm to prepare the ground state in this work, we note that the modularity of our implementation allows for other (non-variational) approaches to be used for the ground state.