Related papers: A Recursive Method to Calculate UV-divergent Parts…
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 common approach to radial distortion is by the means of polynomial approximation, which introduces distortion-specific parameters into the camera model and requires estimation of these distortion parameters. The task of estimating…
In this article we investigate the connection between regularization theory for inverse problems and dynamic programming theory. This is done by developing two new regularization methods, based on dynamic programming techniques. The aim of…
The Euler scheme is up to date the most important numerical method for ordinary differential inclusions, because the use of the available higher-order methods is prohibited by their enormous complexity after spatial discretization.…
The problem of inverting the total divergence operator is central to finding components of a given conservation law. This might not be taxing for a low-order conservation law of a scalar partial differential equation, but integrable systems…
We report on the implementation of an algorithm for computing the set of all regular triangulations of finitely many points in Euclidean space. This algorithm, which we call down-flip reverse search, can be restricted, e.g., to computing…
We report on a program for the numerical evaluation of divergent multi-loop integrals. The program is based on iterated sector decomposition. We improve the original algorithm of Binoth and Heinrich such that the program is guaranteed to…
I present a novel Four-Dimensional Regularization/Renormalization approach (FDR) to ultraviolet divergences in field theories which can be interpreted as a natural separation between physical and non physical degrees of freedom. Based on…
Reparameterization (RP) and likelihood ratio (LR) gradient estimators are used to estimate gradients of expectations throughout machine learning and reinforcement learning; however, they are usually explained as simple mathematical tricks,…
We present further properties of a previously proposed recursive scheme for parameterisation of n-by-n unitary matrices. We show that the factors in the recursive formula may be introduced in any desired order. The method is used to study…
Finding an efficient and compelling regularization of soft and collinear degrees of freedom at the same invariant mass scale, but separated in rapidity is a persistent problem in high-energy factorization. In the course of a calculation,…
This paper discusses basic results and recent developments on variational regularization methods, as developed for inverse problems. In a typical setup we review basic properties needed to obtain a convergent regularization scheme and…
In this paper, modulating functions-based method is proposed for estimating space-time dependent unknowns in one-dimensional partial differential equations. The proposed method simplified the problem into a system of algebraic equations…
We present a new procedure using on-shell recursion to determine coefficients of integral functions appearing in one-loop scattering amplitudes of gauge theories, including QCD. With this procedure, coefficients of integrals, including…
Higher-order radiative corrections play an important role in precision studies of the electroweak and Higgs sector, as well as for the detailed understanding of large backgrounds to new physics searches. For corrections beyond the one-loop…
An algorithm is described to compute the canonical basis of an irreducible module over a quantized enveloping algebra of a finite-dimensional semisimple Lie algebra. The algorithm works for modules that are constructed as a submodule of a…
A simple formula for one-loop logarithmic divergences on the background of a two-dimensional curved space-time is derived for theories for which the second variation of the action is a nonminimal second order operator with small nonminimal…
This paper introduces a coordinate descent version of the V\~u-Condat algorithm. By coordinate descent, we mean that only a subset of the coordinates of the primal and dual iterates is updated at each iteration, the other coordinates being…
Numerous vector angular spectrum methods have been presented to model the vectorial nature of diffractive electromagnetic field, facilitating optical field engineering in polarization-related and high numerical aperture systems. However,…
We propose a method to reduce non-uniform sample variance to a predetermined target level. The proposed space-variant filter can equalize variance of the non-stationary signal, or vary filtering strength based on image features, such as…