For slowly evolving, discrete-time-dependent systems of difference equations (iterated maps), we believe the simplest means of demonstrating the validity of the averaging method at first order is by way of a lemma that we call Besjes' inequality. In this paper, we develop the Besjes inequality for identity maps with perturbations that are (i) at lo...
Germany
Germany
Germany
Germany
Germany
Germany
Germany
A recurrence scheme is defined for the numerical determination of high degree polynomial approximations to functions as, for instance, inverse powers near zero. As an example, polynomials needed in the two-step multi-boson (TSMB) algorithm for fermion simulations are considered. For the polynomials needed in TSMB a code in C is provided which is ea...
We non-perturbatively calculate the scale dependence of the static axial current in the Schroedinger functional scheme by means of a recursive finite-size scaling technique, taking the continuum limit in each step. The bare current in the O(a) improved theory as well as in the original Wilson regularization is thus connected to the renormalization ...
