Related papers: Approximation theory for Green's functions via the…
We investigate boundary estimates for elliptic operators with stationary random coefficients exhibiting integrable correlations, arising from stochastic homogenization theory. As practical applications, we establish decay estimates for…
The generalized Lanczos trust-region (GLTR) method is one of the most popular approaches for solving large-scale trust-region subproblem (TRS). Recently, Jia and Wang [Z. Jia and F. Wang, \emph{SIAM J. Optim., 31 (2021), pp. 887--914}]…
We consider three mathematically equivalent variants of the conjugate gradient (CG) algorithm and how they perform in finite precision arithmetic. It was shown in [{\em Behavior of slightly perturbed Lanczos and conjugate-gradient…
The $GW$ approximation is a widely used framework for studying correlated materials, but it struggles with certain limitations, such as its inability to explain pseudogap phenomena. To overcome these problems, we propose a systematic…
We study estimates of the Green's function in $\mathbb{R}^d$ with $d \ge 2$, for the linear second order elliptic equation in divergence form with variable uniformly elliptic coefficients. In the case $d \ge 3$, we obtain estimates on the…
We consider the cumulant expansion of the PAM employing the hybridization as perturbation (Phys. Rev. B 50, 17933 (1994)), and we obtain formally exact one-electron Green's functions (GF). These GF contain effective cumulants that are as…
The Bayesian reconstruction entropy is considered an alternative to the Shannon-Jaynes entropy, as it does not exhibit the asymptotic flatness characteristic of the Shannon-Jaynes entropy and obeys the scale invariance. It is commonly…
Acoustic room modes and the Green's function mode expansion are well-known for rectangular rooms with perfectly reflecting walls. First-order approximations also exist for nearly rigid boundaries; however, current analytical methods fail to…
In this paper, we introduce telescoping continued fractions to find lower bounds for the error term $r_n$ in Stirling's approximation $\displaystyle n! = \sqrt{2\pi}n^{n+1/2}e^{-n}e^{r_n}.$ This improves lower bounds given earlier by…
Given a sequence of complex square matrices, $a_n$, consider the sequence of their partial products, defined by $p_n=p_{n-1}a_{n}$. What can be said about the asymptotics as $n\to\infty$ of the sequence $f(p_n)$, where $f$ is a continuous…
A first order differential equation of Green's Function, at the origin G(0), for the one- dimensional lattice is derived by simple recurrence relation. Green's Function at site (m)is then calculated in terms of G(0). A simple recurrence…
The Stone-Weierstrass approximation theorem is extended to certain unbounded sets in $C^n$. In particular, on a locally rectifiable arc going to infinity, each continuous function can be approximated by entire functions.
Non-equilibrium 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…
A comparative study of the numerical renormalization group and non-crossing approximation results for the spectral functions of the $U=\infty$ Anderson impurity model is carried out. The non-crossing approximation is the simplest conserving…
The Sinc approximation is a function approximation formula that attains exponential convergence for rapidly decaying functions defined on the whole real axis. Even for other functions, the Sinc approximation works accurately when combined…
In this paper we estimate the expected error of a stochastic approximation algorithm where the maximum of a function is found using finite differences of a stochastic representation of that function. An error estimate of $O(n^{-1/5})$ for…
In this work we present a three step procedure for generating a closed form expression of the Green's function on both closed and open finite quantum graphs with general self-adjoint matching conditions. We first generalize and simplify the…
We analyze the behavior of stochastic approximation algorithms where iterates, in expectation, progress towards an objective at each step. When progress is proportional to the step size of the algorithm, we prove exponential concentration…
The Rosen fractions are an infinite set of continued fraction algorithms, each giving expansions of real numbers in terms of certain algebraic integers. For each, we give a best possible upper bound for the minimum in appropriate…
Objectives involving bilinear forms $u^\top f(A(\theta))v$ for Hermitian $A$ arise widely in scientific computing and probabilistic machine learning. For large matrices, Lanczos efficiently approximates these quantities, but differentiating…