Related papers: A nearly-optimal method to compute the truncated t…

We exploit the truncated singular value decomposition and the recently proposed circulant decomposition for an efficient first-order approximation of the multiplication of large dense matrices. A decomposition of each matrix into a sum of a…

This paper introduces a novel method for approximating the dynamics of a large autonomous system projected onto a fixed subspace. The core contribution is a novel recursive algorithm to construct an effective time-dependent generator that…

The aim of this paper is to apply an original computation method due to Malesevic and Makragic [5] to the problem of approximating some trigonometric functions. Inequalities of Wilker-Cusa-Huygens are discussed, but the method can be…

We apply the Frobenius method to the Schr\"{o}dinger equation with a truncated Coulomb potential. By means of the tree-term recurrence relation for the expansion coefficients we truncate the series and obtain exact eigenfunctions and…

In this paper we extend the theory of optimal approximations of functions $f: \R \to \R$ in the $L^1(\R)$-metric by entire functions of prescribed exponential type (bandlimited functions). We solve this problem for the truncated and the odd…

We conjecture results about the complex moments of the derivative of the Riemann zeta function, evaluated at the non-trivial zeros of the Riemann zeta function. We do this via two different random matrix computations. In the first, we find…

We revisit the method of Carleman linearization for systems of ordinary differential equations with polynomial right-hand sides. This transformation provides an approximate linearization in a higher-dimensional space through the exact…

An algorithm is devised for computing $\Phi(n) = \phi(1) + \phi(2) + \cdots + \phi(n)$ in time $\widetilde{\Theta}(n^{2/3})$ and space $\widetilde{\Theta}(n^{1/3})$. The starting point is an existing algorithm based on the Dirichlet…

Motivated by the groundbreaking work of Andrews and Merca, truncated theta series have been extensively studied over the years. In particular, Merca made conjectures on the non-negativity of the coefficient of $q^N$ in truncated series from…

This article presents two methods, in parallel, of solving more complex integrals, among which is the Poisson's integral, in order to emphasize the obvious advantages of a new method of integration, which uses the supermathematics circular…

We describe an algorithm to numerically evaluate Riemann theta functions in any dimension in quasi-linear time in terms of the required precision, uniformly on reduced input. This algorithm is implemented in the FLINT number theory library…

Given the asymptotic expansion for the logarithmic integral $\int_0^n \frac{dt}{\ln(t)}$, obtained from repeated integration by parts until the expansion terms reach a minimum; approaching zero. Which determines a cut-off for the number of…

We present an algorithm that enumerates all the minimal triangulations of a graph in incremental polynomial time. Consequently, we get an algorithm for enumerating all the proper tree decompositions, in incremental polynomial time, where…

We describe a method to accelerate the numerical computation of the coefficients of the polynomials $P_k(x)$ that appear in the conjectured asymptotics of the $2k$-th moment of the Riemann zeta function. We carried out our method to compute…

In this work we introduce a new polynomial representation of the Bernoulli numbers in terms of polynomial sums allowing on the one hand a more detailed understanding of their mathematical structure and on the other hand provides a…

We propose a randomized algorithm to compute the log-partition function of weakly interacting fermions with polynomial runtime in both the system size and precision. Although weakly interacting fermionic systems are considered tractable for…

The intrinsic volumes induced by a stationary Poisson k-flat process inside a compact and convex sampling window are considered. Using techniques from stochastic analysis, more precisely calculus with multiple stochastic integrals and a…

We present a~novel approach to the problem of automated theorem proving. Polynomial cost procedures that recognise sentences belonging to a theory are generated on a basis of a set of axioms of the so-called Truncated Predicate Calculus…

In this paper, we use basic asymptotic analysis to establish some uniform asymptotic formulas for the Fourier coefficients of the inverse of Jacobi theta functions. In particular, we answer and improve some problems suggested and…

In this paper we propose methods for computing Fresnel integrals based on truncated trapezium rule approximations to integrals on the real line, these trapezium rules modified to take into account poles of the integrand near the real axis.…