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

Progress of Theoretical Physics Supplement

A New Method to Calculate the Green Function by Polynomial Expansion

Wataru Kunishima, Masaki Itoh, Hiroshi L. TANAKA

Published Jan 1, 2000• 6 citations
Publisher

Abstract

An efficient scheme is introduced to calculate the Green function on the basis of polynomials expansion. This scheme has the following advantages: (i) it is possible to calculate both the diagonal and off-diagonal elements of the Green function, (ii) applicable to the system with discrete spectrum, (iii) integrated density of states can also be obtained by the same algorithm, and (iv) it is suitable for vector and parallel processing, and required CPU time and memory size are proportional only to the system size (i.e. ordered N). Applications are made to simple lattice systems for demonstration.

DOI
10.1143/ptps.138.149

Related papers

Spectral-density polynomial expansion for two-particle Green's function in BdG framework

Yuki Nagai, Y. Ota, Masahiko Machida

We develop an effcient numerical method on the basis of the spectral-density polynomial expansion to calculate two particle Green's functions in Bogoliubov-de Gennes framework for inhomogeneous superconducting systems. Our method allows systematic evaluation such as spin or charge susceptibility, nuclear magnetic relaxation rate, optical or thermal conductivity even in magnetic fields. In addition, its effciencybecomes remarkable in large-scale parallel performance.

Physics Procedia•Jan 1, 2012•4 citations

Fast and Accurate Scheme for Green Functions and Eigenvectors: Regulated Polynomial Expansion without Gibbs Oscillation

Shigetoshi Sota, Masaki Itoh

An oscillation-free Fourier expansion is proposed and applied to the polynomial expansion of resolvent operator, as an alternative treatment for Gibbs phenomenon to the kernel polynomial method (KPM) by Voter et al. [Phys. Rev. B 53 (1996) 12733]. Adopting regulated Legendre polynomial as basis functions, the recurrence algorithm underlying the KPM is practically preserved, while it eliminates unphysical oscillations entirely. The resolution is uniform in the frequency domain, and improved without limitation by extending the truncation range of the expansion. The method can also be used to calculate the eigenvector with remarkably high precision. It is further extended to the time domain, being able to deal with the quantum evolution in the same algorithm. A numerical test was performed against a lattice dynamics of 19 3 atoms, as well as of a computer generated Lennard–Jones glass of 1000 atoms. Not only it serves as a most efficient simulation scheme for a bulk, confirmed was also that the calculation converges to exact results within realistic computation time.

Journal of the Physical Society of Japan•May 11, 2007•15 citations

Discrete Lehmann representation of imaginary time Green's functions

Jason Kaye, Kun Chen, Olivier Parcollet

We present an efficient basis for imaginary time Green's functions based on a low-rank decomposition of the spectral Lehmann representation. The basis functions are simply a set of well-chosen exponentials, so the corresponding expansion may be thought of as a discrete form of the Lehmann representation using an effective spectral density which is a sum of $\ensuremath{\delta}$ functions. The basis is determined only by an upper bound on the product $\ensuremath{\beta}{\ensuremath{\omega}}_{max}$, with $\ensuremath{\beta}$ the inverse temperature and ${\ensuremath{\omega}}_{max}$ an energy cutoff, and a user-defined error tolerance $\ensuremath{\epsilon}$. The number $r$ of basis functions scales as $O(log(\ensuremath{\beta}{\ensuremath{\omega}}_{max})log(1/\ensuremath{\epsilon}))$. The discrete Lehmann representation of a particular imaginary time Green's function can be recovered by interpolation at a set of $r$ imaginary time nodes. Both the basis functions and the interpolation nodes can be obtained rapidly using standard numerical linear algebra routines. Due to the simple form of the basis, the discrete Lehmann representation of a Green's function can be explicitly transformed to the Matsubara frequency domain, or obtained directly by interpolation on a Matsubara frequency grid. We benchmark the efficiency of the representation on simple cases, and with a high-precision solution of the Sachdev-Ye-Kitaev equation at low temperature. We compare our approach with the related intermediate representation method, and introduce an improved algorithm to build the intermediate representation basis and a corresponding sampling grid.

arXiv:2107.13094•Physical review. B./Physical review. B•Jun 13, 2022•77 citations

Application of infinite order perturbation theory in linear systems. II. The frequency spectrum of disordered chains

Shiyu Wu

A formulation is presented such that the ensemble average of the diagonal elements of the Green's function for a one-dimensional disordered system can be calculated to arbitrary accuracy. The method is illustrated with an application to an isotopically disordered chain. An approximate solution to the frequency spectrum of a disordered binary chain is also discussed.

Journal of Mathematical Physics•Jul 1, 1974•19 citations

Computing the real-time Green's Functions of large Hamiltonian matrices

T. Iitaka

A numerical method is developed for calculating the real time Green's functions of very large sparse Hamiltonian matrices, which exploits the numerical solution of the inhomogeneous time-dependent Schroedinger equation. The method has a clear-cut structure reflecting the most naive definition of the Green's functions, and is very suitable to parallel and vector supercomputers. The effectiveness of the method is illustrated by applying it to simple lattice models. An application of this method to condensed matter physics will be found in H. Tanaka, Phys. PRB 57, 2168 (1998).

arXiv:physics/9802021•Feb 11, 1998•7 citations

Rapid Scheme of Producing Generalized Fourier Expansion of Matrix Functions and its Application to Physical Problems

Toma MATSUMOTO, Yoko Yamane, Atsunori TANAKA +2 more

Application of orthogonal polynomial expansion to quantum simulations is formulated on a general footing, implementing the regulation technique by Sota and Itoh for treating for the Gibbs oscillation.It is an alternative to the kernel polynomial method using Tchebyshev polynomial, but is simpler to handle and makes it possible to use all the popular orthogonal polynomials, covering finite, semi-infinite and infinite intervals of the eigenvalue spectrum.The accuracy can be made equivalent to direct diagonalization, with the resolution being homogeneous in the whole range of the spectrum.The target quantities can be as diverse as including eigenvectors, as well as all sorts of one-particle properties and correlation functions, involving thermal average and quantum time evolution.It can also be used as a handy tool for solving linear algebraic equations.

Progress in Nuclear Science and Technology•Oct 1, 2011•0 citations
An efficient scheme is introduced to calculate the Green function on the basis of polynomials expansion. This scheme has the following advantages: (i) it is possible to calculate both the diagonal and off-diagonal elements of the Green function, (ii) applicable to the system with discrete spectrum, (iii) integrated density of states can also be obtained by the same algorithm, and (iv) it is suitable for vector and parallel processing, and required CPU time and memory size are proportional only to the system size (i.e. ordered N). Applications are made to simple lattice systems for demonstration.
An oscillation-free Fourier expansion is proposed and applied to the polynomial expansion of resolvent operator, as an alternative treatment for Gibbs phenomenon to the kernel polynomial method (KPM) by Voter et al. [Phys. Rev. B 53 (1996) 12733]. Adopting regulated Legendre polynomial as basis functions, the recurrence algorithm underlying the KPM is practically preserved, while it eliminates unphysical oscillations entirely. The resolution is uniform in the frequency domain, and improved without limitation by extending the truncation range of the expansion. The method can also be used to calculate the eigenvector with remarkably high precision. It is further extended to the time domain, being able to deal with the quantum evolution in the same algorithm. A numerical test was performed against a lattice dynamics of 19 3 atoms, as well as of a computer generated Lennard–Jones glass of 1000 atoms. Not only it serves as a most efficient simulation scheme for a bulk, confirmed was also that the calculation converges to exact results within realistic computation time.
We present an efficient basis for imaginary time Green's functions based on a low-rank decomposition of the spectral Lehmann representation. The basis functions are simply a set of well-chosen exponentials, so the corresponding expansion may be thought of as a discrete form of the Lehmann representation using an effective spectral density which is a sum of $\ensuremath{\delta}$ functions. The basis is determined only by an upper bound on the product $\ensuremath{\beta}{\ensuremath{\omega}}_{max}$, with $\ensuremath{\beta}$ the inverse temperature and ${\ensuremath{\omega}}_{max}$ an energy cutoff, and a user-defined error tolerance $\ensuremath{\epsilon}$. The number rrr of basis functions scales as $O(log(\ensuremath{\beta}{\ensuremath{\omega}}_{max})log(1/\ensuremath{\epsilon}))$. The discrete Lehmann representation of a particular imaginary time Green's function can be recovered by interpolation at a set of rrr imaginary time nodes. Both the basis functions and the interpolation nodes can be obtained rapidly using standard numerical linear algebra routines. Due to the simple form of the basis, the discrete Lehmann representation of a Green's function can be explicitly transformed to the Matsubara frequency domain, or obtained directly by interpolation on a Matsubara frequency grid. We benchmark the efficiency of the representation on simple cases, and with a high-precision solution of the Sachdev-Ye-Kitaev equation at low temperature. We compare our approach with the related intermediate representation method, and introduce an improved algorithm to build the intermediate representation basis and a corresponding sampling grid.
A numerical method is developed for calculating the real time Green's functions of very large sparse Hamiltonian matrices, which exploits the numerical solution of the inhomogeneous time-dependent Schroedinger equation. The method has a clear-cut structure reflecting the most naive definition of the Green's functions, and is very suitable to parallel and vector supercomputers. The effectiveness of the method is illustrated by applying it to simple lattice models. An application of this method to condensed matter physics will be found in H. Tanaka, Phys. PRB 57, 2168 (1998).
Application of orthogonal polynomial expansion to quantum simulations is formulated on a general footing, implementing the regulation technique by Sota and Itoh for treating for the Gibbs oscillation.It is an alternative to the kernel polynomial method using Tchebyshev polynomial, but is simpler to handle and makes it possible to use all the popular orthogonal polynomials, covering finite, semi-infinite and infinite intervals of the eigenvalue spectrum.The accuracy can be made equivalent to direct diagonalization, with the resolution being homogeneous in the whole range of the spectrum.The target quantities can be as diverse as including eigenvectors, as well as all sorts of one-particle properties and correlation functions, involving thermal average and quantum time evolution.It can also be used as a handy tool for solving linear algebraic equations.