Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2505.00089 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908344268095488 |
|---|---|
| author | Pinna, Gabriele Lunt, Oliver von Keyserlingk, Curt |
| author_facet | Pinna, Gabriele Lunt, Oliver von Keyserlingk, Curt |
| contents | 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 now 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 cofficients. Typically, the decay of the error term ranges from $1/\mathrm{poly}(N)$ in the best case to $1/\mathrm{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 behaviours 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_00089 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Approximation theory for Green's functions via the Lanczos algorithm Pinna, Gabriele Lunt, Oliver von Keyserlingk, Curt Quantum Physics Statistical Mechanics Mathematical Physics 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 now 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 cofficients. Typically, the decay of the error term ranges from $1/\mathrm{poly}(N)$ in the best case to $1/\mathrm{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 behaviours 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. |
| title | Approximation theory for Green's functions via the Lanczos algorithm |
| topic | Quantum Physics Statistical Mechanics Mathematical Physics |
| url | https://arxiv.org/abs/2505.00089 |