Related papers: Efficient computation of the Zassenhaus formula
We represent the Riemann zeta function in the half-plane $\Re s >1$ via series whose terms admit geometrically decreasing bounds. Due to an underlying recurrence relation, which is used to compute coefficients entering into the terms, the…
Given a Feynman parameter integral, depending on a single discrete variable $N$ and a real parameter $\epsilon$, we discuss a new algorithmic framework to compute the first coefficients of its Laurent series expansion in $\epsilon$. In a…
There is increasing interest within the research community in the design and use of recursive probability models. Although there still remains concern about computational complexity costs and the fact that computing exact solutions can be…
A method is presented in which matrix elements for some processes are calculated recursively. This recursive calculational technique is based on the method of basis spinors.
Number sequences defined by a linear recursion relation are studied by means of generating functions. Indices of the terms in the recursion relation have arbitrary differenses. In addition to formulas for the nth term an algorithm is…
We explicitly describe an expansion of $e^{A+B}$ as an infinite sum of the products of $B$ multiplied by the exponential function of $A$. This is the explicit description of the Zassenhaus formula. We also express the…
Linear algebraic expressions are the essence of many computationally intensive problems, including scientific simulations and machine learning applications. However, translating high-level formulations of these expressions to efficient…
We derive recursions for the probability distribution of random sums by computer algebra. Unlike the well-known Panjer-type recursions, they are of finite order and thus allow for computation in linear time. This efficiency is bought by the…
Kaczmarz algorithm is an efficient iterative algorithm to solve overdetermined consistent system of linear equations. During each updating step, Kaczmarz chooses a hyperplane based on an individual equation and projects the current estimate…
We propose a recursive method for the computation of the cumulants of self-exciting point processes of Hawkes type, based on standard combinatorial tools such as Bell polynomials. This closed-form approach is easier to implement on…
We propose a new definition of effective formulas for problems in enumerative combinatorics. We outline the proof of the fact that every linear recurrence sequence of integers has such a formula. It follows from a lower bound that can be…
In this paper, we propose a fast method for exactly enumerating a very large number of all lower cost solutions for various combinatorial problems. Our method is based on backtracking for a given decision diagram which represents all the…
This paper reports on a simple pure numerical method developed for computing Hansen coefficients by using recursive harmonic analysis technique. The precision criteria of the computations are very satisfactory and provide materials for…
Simplification of fractional powers of positive rational numbers and of sums, products and powers of such numbers is taught in beginning algebra. Such numbers can often be expressed in many ways, as this article discusses in some detail.…
Conrey, Farmer, Keating, Rubinstein and Snaith have given a recipe that conjecturally produces, among others, the full moment polynomial for the Riemann zeta function. The leading term of this polynomial is given as a product of a factor…
The Zassenhaus formula finds many applications in theoretical physics or mathematics, from fluid dynamics to differential geometry. The non-commutativity of the elements of the algebra implies that the exponential of a sum of operators…
Tensor decompositions, which represent an $N$-order tensor using approximately $N$ factors of much smaller dimensions, can significantly reduce the number of parameters. This is particularly beneficial for high-order tensors, as the number…
Recursive formulas extending some known $_{2}F_{1}$ and $_{3}F_{2}$ summation formulas by using contiguous relations have been obtained. On the one hand, these recursive equations are quite suitable for symbolic and numerical evaluation by…
In this paper, the author present a reliable symbolic computational algorithm for inverting a general comrade matrix by using parallel computing along with recursion. The computational cost of our algorithm is O(n^2). The algorithm is…
We describe a new, convenient, recursive tensor integral reduction scheme for one-loop $n$-point Feynman integrals. The reduction is based on the algebraic Davydychev-Tarasov formalism where the tensors are represented by scalars with…