Related papers: Recursive technique for evaluation of Feynman diag…
A refinement of manifold data is a computational process, which produces a denser set of discrete data from a given one. Such refinements are closely related to multiresolution representations of manifold data by pyramid transforms, and…
Among the available perturbative approaches in quantum field theory, heat kernel techniques provide a powerful and geometrically transparent framework for computing effective actions in nontrivial backgrounds. In this work, resummation…
This paper introduces Farey Recursive Functions and investigates their basic properties. Farey Recursive Functions are a special type of recursive function from the rationals to a commutative ring. The recursion of these functions is…
A method for calculating the $1/d$ expansion coefficients for solutions of integration by parts relations for Feynman integrals is presented. The idea is to use linear substitutions to transform these relations to an explicitly recursive…
The computation of higher order processes very often involves a large number of diagrams. In addition, it is in general not possible to solve the occurring integrals explicitly and expansions in small quantities have to be performed. This…
We propose a new procedure by using the recursive Green's functions which remove all the repetition terms from the time-independent perturbation series for finite-level quantum systems. These Green's functions are introduced as a…
This paper presents a regularized recursive identification algorithm with simultaneous on-line estimation of both the model parameters and the algorithms hyperparameters. A new kernel is proposed to facilitate the algorithm development. The…
They run our lives, if you believe the hype in the news, but there is no precise definition of "algorithms" which is generally accepted by the mathematicians, logicians and computer scientists who create and study them. My main aims here…
We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…
This study presents the derivation of a recursive formula for integrals of products of $N$ Hermite polynomials, establishing a numerically stable scheme for their accurate evaluation in computer codes. The derivation is notably simple and…
New iterative methods for solving linear equations are presented that are easy to use, generalize good existing methods, and appear to be faster. The new algorithms mix two kinds of linear recurrence formulas. Older methods have either high…
I discuss algorithms for the evaluation of Feynman integrals. These algorithms are based on Hopf algebras and evaluate the Feynman integral to (multiple) polylogarithms.
Recursive algorithms for computing the Frobenius norm of a real array are proposed, based on hypot, a hypotenuse function. Comparing their relative accuracy bounds with those of the BLAS routine DNRM2 it is shown that the proposed…
Procedural material models have been gaining traction in many applications thanks to their flexibility, compactness, and easy editability. We explore the inverse rendering problem of procedural material parameter estimation from…
We extend Gegenbauer Polynomials technique to evaluate a class of complicated Feynman diagrams. New results in the form of $_3F_2$-hypergeometrical series of unit argument, are presented. As a by-product, we present a new transformation…
In this work we discuss techniques for the numerical computation of Fox functions that represent Feynman integrals. Illustrative examples based on Sinc numerical methods and Quasi-Monte Carlo methods are given
The differential equation method is applied to evaluate analytically two-loop vertex Feynman diagrams. Three on-shell infrared divergent planar two-loop diagrams with zero thresholds contributing to the processes Z --> bb bar (for zero b…
This paper provides a general account of the notion of recursive program schemes, studying both uninterpreted and interpreted solutions. It can be regarded as the category-theoretic version of the classical area of algebraic semantics. The…
This study proposes a recursive and easy-to-implement algorithm to compute the score and Hessian matrix in general regime-switching models. We use simulation to compare the asymptotic variance estimates constructed from the Hessian matrix…
A method is introduced to calculate the UV-divergent parts at one-loop level in dimensional regularization. The method is based on the recursion, and the basic integrals are just the scaleless integrals after the recursive reduction, which…