Related papers: Untangling the IBP Equations
Image restoration is typically addressed through non-convex inverse problems, which are often solved using first-order block-wise splitting methods. In this paper, we consider a general type of non-convex optimisation model that captures…
We tackle the problem of graph partitioning for image segmentation using correlation clustering (CC), which we treat as an integer linear program (ILP). We reformulate optimization in the ILP so as to admit efficient optimization via…
Triangular factorizations are an important tool for solving integral equations and partial differential equations with hierarchical matrices ($\mathcal{H}$-matrices). Experiments show that using an $\mathcal{H}$-matrix LR factorization to…
Scattering amplitudes at loop level can be expressed in terms of Feynman integrals. The latter satisfy partial differential equations in the kinematical variables. We argue that a good choice of basis for (multi-)loop integrals can lead to…
We study the problem of computing the matrix exponential of a block triangular matrix in a peculiar way: Block column by block column, from left to right. The need for such an evaluation scheme arises naturally in the context of option…
Obtaining the inverse of a large symmetric positive definite matrix $\mathcal{A}\in\mathbb{R}^{p\times p}$ is a continual challenge across many mathematical disciplines. The computational complexity associated with direct methods can be…
In this paper, we propose an incremental algorithm for computing cylindrical algebraic decompositions. The algorithm consists of two parts: computing a complex cylindrical tree and refining this complex tree into a cylindrical tree in real…
We summarize two geometrical approaches to analytically evaluate higher-fold Mellin-Barnes (MB) integrals in terms of hypergeometric functions. The first method is based on intersections of conic hulls, while the second one, which is more…
Despite the advances in the development of numerical methods analytical approaches still play the key role on the way towards a deeper understanding of many-particle systems. In this regards, diagonalization schemes for Hamiltonians…
In this paper, we give an algorithm that finds an epsilon-approximate solution to a mixed integer quadratic programming (MIQP) problem. The algorithm runs in polynomial time if the rank of the quadratic function and the number of integer…
It is by now well established that, by means of the integration by part identities, all the integrals occurring in the evaluation of a Feynman graph of given topology can be expressed in terms of a few independent master integrals. It is…
In this report, we propose a novel quantum diagonalization algorithm based on the optimization of variational quantum circuits. Diagonalizing a quantum state is a fundamental yet computationally challenging task in quantum information…
These notes develop aspects of perturbation theory of matrices related to so-called diagonalisation schemes. Primary focus is on constructive tools to derive asymptotic expansions for small/large parameters of eigenvalues and…
We explore the utilization of higher-order discretization techniques in optimizing the gate count needed for quantum computer based solutions of partial differential equations. To accomplish this, we present an efficient approach for…
In this paper, we describe a numerical approach to evaluate Feynman loop integrals. In this approach the key technique is a combination of a numerical integration method and a numerical extrapolation method. Since the computation is carried…
The method of differential equations has been proven to be a powerful tool for the computation of multi-loop Feynman integrals appearing in quantum field theory. It has been observed that in many instances a canonical basis can be chosen,…
Some variants of the numerical Picard iterations method are presented to solve an IVP for an ordinary differential system. The term numerical emphasizes that a numerical solution is computed. The method consists in replacing the right hand…
We study the computational complexity of a diagonalization technique for multivariate homogeneous polynomials, that is, expressing them as sums of powers of independent linear forms. It is based on Harrison's center theory and consists of a…
Loop amplitudes are conveniently expressed in terms of master integrals whose coefficients carry the process dependent information. Similarly before integration, the loop integrands may be expressed as a linear combination of propagator…
We propose an extended variant of the reformulation and decomposition algorithm for solving a special class of mixed-integer bilevel linear programs (MIBLPs) where continuous and integer variables are involved in both upper- and lower-level…