Related papers: A fast amortized algorithm for computing quadratic…
In order to make quantitative predictions for jet cross sections in perturbative QCD, it is essential to calculate them to next-to-leading accuracy. This has traditionally been an extremely laborious process. Using a new formalism,…
In this rather computational paper, we determine certain representation numbers of ideals in real quadratic number fields explicitly in order to obtain a representation of the associated Dirichlet series in terms of Dirichlet L-functions…
We present new algorithms to detect and correct errors in the lower-upper factorization of a matrix, or the triangular linear system solution, over an arbitrary field. Our main algorithms do not require any additional information or…
In this paper, we present a quantum algorithm for dynamic programming approach for problems on directed acyclic graphs (DAGs). The running time of the algorithm is $O(\sqrt{\hat{n}m}\log \hat{n})$, and the running time of the best known…
In this paper, we give a detailed account of the algorithm outlined in [1] for Feynman integral reduction and $\varepsilon$-factorised differential equations. The algorithm consists of two steps. In the first step, we use a new geometric…
We propose and study a generalized continued fraction algorithm that can be executed in an arbitrary imaginary quadratic field, the novelty being a non-restriction to the five Euclidean cases. Many hallmark properties of classical continued…
A robust, fast and accurate method for solving the Colebrook-like equations is presented. The algorithm is efficient for the whole range of parameters involved in the Colebrook equation. The computations are not more demanding than…
Nonlinear differential equations model diverse phenomena but are notoriously difficult to solve. While there has been extensive previous work on efficient quantum algorithms for linear differential equations, the linearity of quantum…
We present LinApart, a routine designed for efficiently performing the univariate partial fraction decomposition of large symbolic expressions. Our method is based on an explicit closed formula for the decomposition of rational functions…
We show that $n$-bit integers can be factorized by independently running a quantum circuit with $\tilde{O}(n^{3/2})$ gates for $\sqrt{n}+4$ times, and then using polynomial-time classical post-processing. The correctness of the algorithm…
In this paper, we present a quantum algorithm for the dynamic programming approach for problems on directed acyclic graphs (DAGs). The running time of the algorithm is $O(\sqrt{\hat{n}m}\log \hat{n})$, and the running time of the best known…
We show that the generating function corresponding to the sequence of denominators of the best rational approximants of a quadratic irrational is a rational function with integer coefficients. Consequently we can compute the L\'evy constant…
We give two algorithms to compute linear determinantal representations of smooth plane curves of any degree over any field. As particular examples, we explicitly give representatives of all equivalence classes of linear determinantal…
An equation containing a fractional power of an elliptic operator of second order is studied for Dirichlet boundary conditions. Finite difference approximations in space are employed. The proposed numerical algorithm is based on solving an…
We derive an efficient algorithm to find solutions to Euler's concordant form problem and rational points on elliptic curves associated with this problem.
We propose a linear algorithm for determining two function parameters by their linear combination. These functions must satisfy the first order differential equations with polynomial coefficients and our parameters are the coefficients of…
For Dirichlet characters $\chi$ mod $k$ where $k\geq 3$, we here give a computable formula for evaluating the mean square sums $\sum\limits_{\substack{\chi \text{ mod }k\\\chi(-1)=(-1)^r}}|L(r,\chi)|^2$ for any positive integer $r\geq 3$.…
This paper is concerned with the problem of finding a quadratic common Lyapunov function for a family of stable linear systems. We present gradient iteration algorithms which give deterministic convergence for finite system families and…
In this paper we describe a quantum algorithm to solve sparse systems of nonlinear differential equations whose nonlinear terms are polynomials. The algorithm is nondeterministic and its expected resource requirements are polylogarithmic in…
Improved algorithms for computing (partial and full) exterior algebraic shifts of hypergraphs and simplicial complexes are presented. The main benefit is in positive characteristic. Experiments with an implementation in OSCAR with various…