Related papers: SecDec-3.0: numerical evaluation of multi-scale in…
Analyzing electromagnetic fields in complex, multi-material environments presents substantial computational challenges. To address these, we propose a hybrid numerical method that couples discrete exterior calculus (DEC) with surface…
In a recent paper we have presented an automated subtraction method for divergent multi-loop/leg integrals in dimensional regularisation which allows for their numerical evaluation, and applied it to diagrams with massless internal lines.…
A program to calculate the three-particle hyperspherical brackets is presented. Test results are listed and it is seen that the program is well applicable up to very high values of the hypermomentum and orbital momenta. The listed runs show…
This work explores an unexpected application of Implicit Computational Complexity (ICC) to parallelize loops in imperative programs. Thanks to a lightweight dependency analysis, our algorithm allows splitting a loop into multiple loops that…
Nowadays the sector decomposition technique, which can isolate divergences from parametric representations of integrals, becomes a quite useful tool for numerical evaluations of the Feynman loop integrals. It is used to verify the…
We describe a major update of our Matlab freeware GloptiPoly for parsing generalized problems of moments and solving them numerically with semidefinite programming.
We present a semi-numerical method to compute one-loop corrections to processes involving many particles. We treat in detail cases with up to five external legs and massless internal propagators, although the method is more general.
Multi-objective verification problems of parametric Markov decision processes under optimality criteria can be naturally expressed as nonlinear programs. We observe that many of these computationally demanding problems belong to the…
This paper describes a novel unbounded software model checking approach to find errors in programs written in the C language based on incremental SAT-solving. Instead of using the traditional assumption based API to incremental SAT solvers…
Incrementalization speeds up computations by avoiding unnecessary recomputations and by efficiently reusing previous results. While domain-specific techniques achieve impressive speedups, e.g., in the context of database queries, they are…
Software-hardware co-design solutions for decimal computation can provide several Pareto points to development of embedded systems in terms of hardware cost and performance. This paper demonstrates how to accurately evaluate such co-design…
Within recent years, considerable progress has been made regarding high-performance solvers for Partial Differential Equations (PDEs), yielding potential gains in efficiency compared to industry standard tools. However, the latter largely…
We introduce the concept of $\delta$-sequence. A $\delta$-sequence $\Delta$ generates a well-ordered semigroup $S$ in $\mathbb{Z}^2$ or $\mathbb{R}$. We show how to construct (and compute parameters) for the dual code of any evaluation code…
Program specialization is a program transformation methodology which improves program efficiency by exploiting the information about the input data which are available at compile time. We show that current techniques for program…
Statistical depth functions provide center-outward orderings in spaces of dimension larger than one, where a natural ordering does not exist. The numerical evaluation of such depth functions can be computationally prohibitive, even for…
Row-merged polar codes are a family of pre-transformed polar codes (PTPCs) with little precoding overhead. Providing an improved distance spectrum over plain polar codes, they are capable to perform close to the finite-length capacity…
In this work we propose RELDEC, a novel approach for sequential decoding of moderate length low-density parity-check (LDPC) codes. The main idea behind RELDEC is that an optimized decoding policy is subsequently obtained via reinforcement…
Monte Carlo Application Toolkit (MCATK) commonly uses surface tracking on a structured mesh to compute scalar fluxes. In this mode, higher fidelity requires more mesh cells and isotopes and thus more computational overhead -- since every…
FormCalc is a matrix-element generator that turns FeynArts amplitudes up to one loop into a Fortran code for computing the squared matrix element. The generated code can be run with FormCalc's own driver programs or used with other…
This paper presents a program analysis method that generates program summaries involving polynomial arithmetic. Our approach builds on prior techniques that use solvable polynomial maps for summarizing loops. These techniques are able to…