Related papers: Resummation methods for Master Integrals
We consider the approximate recovery of multivariate periodic functions from a discrete set of function values taken on a rank-$s$ integration lattice. The main result is the fact that any (non-)linear reconstruction algorithm taking…
We identify a common scheme in several existing algorithms addressing computational problems on linear differential equations with polynomial coefficients. These algorithms reduce to computing a linear relation between vectors obtained as…
We consider regularized cutting-plane methods to minimize a convex function that is the sum of a large number of component functions. One important example is the dual problem obtained from Lagrangian relaxation on a decomposable problem.…
To conduct a more in-depth investigation of randomized solvers for solving linear systems, we adopt a unified randomized batch-sampling Kaczmarz framework with per-iteration costs as low as cyclic block methods, and develop a general…
Partial differential equations can be used to model many problems in several fields of application including, e.g., fluid mechanics, heat and mass transfer, and electromagnetism. Accurate discretization methods (e.g., finite element or…
We consider continuous linear programs over a continuous finite time horizon $T$, with a constant coefficient matrix, linear right hand side functions and linear cost coefficient functions, where we search for optimal solutions in the space…
The calculation of exclusive observables beyond the one-loop level requires elaborate techniques for the computation of multi-leg two-loop integrals. We discuss how the large number of different integrals appearing in actual two-loop…
In this short paper, we give an upper bound for the number of different basic feasible solutions generated by the simplex method for linear programming problems having optimal solutions. The bound is polynomial of the number of constraints,…
We propose a general method for simplifying master equations by eliminating from the description rapidly evolving states. The physical recipe we impose is the suppression of these states and a renormalization of the rates of all the…
Iterative methods based on matrix splittings are useful in solving large sparse linear systems. In this direction, proper splittings and its several extensions are used to deal with singular and rectangular linear systems. In this article,…
We study a version of the randomized Kaczmarz algorithm for solving systems of linear equations where the iterates are confined to the solution space of a selected subsystem. We show that the subspace constraint leads to an accelerated…
Given two matroids $\mathcal{M}_{1} = (E, \mathcal{B}_{1})$ and $\mathcal{M}_{2} = (E, \mathcal{B}_{2})$ on a common ground set $E$ with base sets $\mathcal{B}_{1}$ and $\mathcal{B}_{2}$, some integer $k \in \mathbb{N}$, and two cost…
In this paper, we develop an online basis enrichment method with the mortar mixed finite element method, using the oversampling technique, to solve for flow problems in highly heterogeneous media. We first compute a coarse grid solution…
The present paper deals with the discrete inverse problem of reconstructing binary matrices from their row and column sums under additional constraints on the number and pattern of entries in specified minors. While the classical…
As it stands, density matrix purification is a powerful tool for linear scaling electronic structure calculations. The convergence is rapid and depends only weakly on the band gap. However, as will be shown in this paper, there is room for…
Three-loop vacuum integrals are an important building block for the calculation of a wide range of three-loop corrections. Until now, only results for integrals with one and two independent mass scales are known, but in the electroweak…
In this paper, we study numerical homogenization methods based on integral equations. Our work is motivated by materials such as concrete, modeled as composites structured as randomly distributed inclusions imbedded in a matrix. We…
Solution methods for linear equation systems in a commutative ring are discussed. Four methods are compared, in the setting of several different rings: Dodgson's method [1], Bareiss's method [2] and two methods of the author - method by…
We give some new methods for perfect reconstruction from frame and sampling erasures in finitely many steps. By bridging an erasure set we mean replacing the erased Fourier coefficients of a function with respect to a frame by appropriate…
A technique for reducing the number of integrals in a Monte Carlo calculation is introduced. For integrations relying on classical or mean-field trajectories with local weighting functions, it is possible to integrate analytically at least…