Approximation theory for Green's functions via the Lanczos algorithm
Open Access
- 13 August 2025
- journal article
- Published by American Physical Society (APS) in Physical Review B
- Vol. 112 (5)
Abstract
It is known that Green's functions can be expressed as continued fractions, the content at the n th level of the fraction is encoded in a coefficient b n , which can be recursively obtained using the Lanczos algorithm. We present a theory concerning errors in approximating Green's functions using continued fractions when only the first N coefficients are known exactly. Our focus lies on the stitching approximation (also known as the recursion method), wherein truncated continued fractions are completed with a sequence of coefficients for which exact solutions are available. We assume a standard conjecture about the growth of the Lanczos coefficients in chaotic many-body systems, and that the stitching approximation converges to the correct answer. Given these assumptions, we show that the rate of convergence of the stitching approximation to a Green's function depends strongly on the decay of staggered subleading terms in the Lanczos coefficients. Typically, the decay of the error term ranges from 1 / poly ( N ) in the best case to 1 / poly ( log N ) in the worst case, depending on the differentiability of the spectral function at the origin. We present different variants of this error estimate for different asymptotic behaviors of the b n , and we also conjecture a relationship between the asymptotic behavior of the b n 's and the smoothness of the Green's function. Lastly, with the above assumptions, we prove a formula linking the spectral function's value at the origin to a product of continued fraction coefficients, which we then apply to estimate the diffusion constant in the mixed field Ising model.Keywords
All Related Versions
Funding Information
- Engineering and Physical Sciences Research Council (EP/Y005058/2)
- King's College London
This publication has 46 references indexed in Scilit:
- Quantum dynamics in Krylov space: Methods and applicationsPhysics Reports, 2025
- Krylov complexity from integrability to chaosJournal of High Energy Physics, 2022
- From quantum chaos and eigenstate thermalization to statistical mechanics and thermodynamicsAdvances in Physics, 2016
- Hypergeometric Orthogonal Polynomials and Their q-Analogues2010
- Classical and Quantum Orthogonal Polynomials in One Variable2005
- Strong asymptotics of the recurrence coefficients of orthogonal polynomials associated to the generalized Jacobi weightJournal of Approximation Theory, 2003
- The Recursion Method1994
- The isomonodromy approach to matric models in 2D quantum gravityCommunications in Mathematical Physics, 1992
- Orthogonal polynomials, associated polynomials and functions of the second kindJournal of Computational and Applied Mathematics, 1991
- Calculation of transport coefficients using a modified Mori formalismMolecular Physics, 1986