Related papers: IBIS: Inverse BInomial sum Solver
In this paper, we develop a framework for solving inverse deformation problems using the FEniCS Project finite element software. We validate our approach with experimental imaging data acquired from a soft silicone beam under gravity. In…
Computers are good at evaluating finite sums in closed form, but there are finite sums which do not have closed forms. Summands which do not produce a closed form can often be ``fixed'' by multiplying them by a suitable polynomial. We…
The status of analytical evaluation of double and triple box diagrams is characterized. The method of Mellin-Barnes representation as a tool to evaluate master integrals in these problems is advocated. New MB representations for massive…
We present a faster interior-point method for optimizing sum-of-squares (SOS) polynomials, which are a central tool in polynomial optimization and capture convex programming in the Lasserre hierarchy. Let $p = \sum_i q^2_i$ be an…
Intersection numbers are rational scalar products among functions that admit suitable integral representations, such as Feynman integrals. Using these scalar products, the decomposition of Feynman integrals into a basis of linearly…
Let $G\cong \mathbb Z/m_1\mathbb Z\times\ldots\times \mathbb Z/m_r\mathbb Z$ be a finite abelian group with $m_1\mid\ldots\mid m_r=\exp(G)$. The $n$-term subsums version of Kneser's Theorem, obtained either via the DeVos-Goddyn-Mohar…
In this paper, we propose a new method for evaluating scalar one-loop Feynman integrals in generalized D-dimension. The calculations play an important building block for two-loop and higher-loop corrections to the processes at future…
We present algorithms to solve coupled systems of linear differential equations, arising in the calculation of massive Feynman diagrams with local operator insertions at 3-loop order, which do {\it not} request special choices of bases.…
During the last several years remarkable progress has been made in numerical calculations of dimensionally regulated multi-loop Feynman diagrams using Mellin-Barnes (MB) representations. The bottlenecks were non-planar diagrams and…
Using integration by parts relations, Feynman integrals can be represented in terms of coupled systems of differential equations. In the following we suppose that the unknown Feynman integrals can be given in power series representations,…
Mellin-Barnes (MB) integrals appear in various branches of physics and mathematics and are, in particular, used as a standard tool for evaluating multi-loop, multi-scale Feynman integrals both analytically and numerically. Recent geometric…
Inverse iteration is known to be an effective method for computing eigenvectors corresponding to simple and well-separated eigenvalues. In the non-symmetric case, the solution of shifted Hessenberg systems is a central step. Existing…
Intelligent reflecting surface (IRS) is a promising solution to build a programmable wireless environment for future communication systems. In practice, an IRS consists of massive low-cost elements, which can steer the incident signal in…
The purpose of the paper is to introduce two new algorithms. The first one computes a linear recursion for proper hypergeometric multisums, by treating one summation variable at a time, and provides rational certificates along the way. A…
Power series in which the summand satisfies a linear recurrence relation with polynomial coefficients are shown to be the solution of a linear differential or algebraic equation. Solving the associated differential or algebraic equation…
The Invar package is introduced, a fast manipulator of generic scalar polynomial expressions formed from the Riemann tensor of a four-dimensional metric-compatible connection. The package can maximally simplify any polynomial containing…
The Mathematica toolkit AMBRE derives Mellin-Barnes (MB) representations for Feynman integrals in d=4-2eps dimensions. It may be applied for tadpoles as well as for multi-leg multi-loop scalar and tensor integrals. AMBRE uses a loop-by-loop…
The computational complexity of simultaneous inference methods in high-dimensional linear regression models quickly increases with the number variables. This paper proposes a computationally efficient method based on the Moore-Penrose…
There are numerous ways to represent real numbers. We may use, e.g., Cauchy sequences, Dedekind cuts, numerical base-10 expansions, numerical base-2 expansions and continued fractions. If we work with full Turing computability, all these…
Active reconfigurable intelligent surface (RIS) is a new RIS architecture that can reflect and amplify communication signals. It can provide enhanced performance gain compared to the conventional passive RIS systems that can only reflect…