相关论文: An extension of the Chudnovsky algorithm
We show that a formalism proposed by Creutz to evaluate Grassmann integrals provides an algorithm of complexity $O(2^n n^3)$ to compute the generating function for the sum of the permanental minors of a matrix of order $n$. This algorithm…
We present a family of algorithms for the numerical approximation of the Schr\"odinger equation with potential concentrated at a finite set of points. Our methods belong to the so-called fast and oblivious convolution quadrature algorithms.…
Using Pascal triangle, we give a simple generalization to the so-called STRAND Puzzle solved by Srinivasa Ramanujan. Thus we are interested in computing the median, first and third quartiles of some integer valued distributions, arising…
This paper presents a new \emph{fast-pivoting} algorithm that computes the $n$ Gittins index values of an $n$-state bandit -- in the discounted and undiscounted cases -- by performing $(2/3) n^3 + O(n^2)$ arithmetic operations, thus…
We present a simple and fast algorithm for computing the $N$-th term of a given linearly recurrent sequence. Our new algorithm uses $O(\mathsf{M}(d) \log N)$ arithmetic operations, where $d$ is the order of the recurrence, and…
A doubly infinite set of series expansion for $1/\pi$ are reported. They follow trivially from a formal expansion for the quotient of the values taken by the gamma function for two (complex) arguments differing by an integer plus one half,…
An iterated refinement procedure for the Guruswami-Sudan list decoding algorithm for Generalised Reed-Solomon codes based on Alekhnovich's module minimisation is proposed. The method is parametrisable and allows variants of the usual list…
Entropy is a fundamental property of both classical and quantum systems, spanning myriad theoretical and practical applications in physics and computer science. We study the problem of obtaining estimates to within a multiplicative factor…
Recently, general fractional calculus was introduced by Kochubei (2011) and Luchko (2021) as a further generalisation of fractional calculus, where the derivative and integral operator admits arbitrary kernel. Such a formalism will have…
The maximum entropy method (MEM) and the Gaussian process (GP) regression, which are both well-suited for the treatment of inverse problems, are used to reconstruct net-baryon number distributions based on a finite number of cumulants of…
In this paper we study in detail a family of continued fraction expansions of any number in the unit closed interval $[0,1]$ whose digits are differences of consecutive non-positive integer powers of an integer $m \geq 2$. For the…
Let $\Gamma\subset \bar{\mathbb Q}^{\times}$ be a finitely generated multiplicative group of algebraic numbers. Let $\alpha_1,\ldots,\alpha_r\in\bar{\mathbb Q}^\times$ be algebraic numbers which are $\mathbb{Q}$-linearly independent and let…
A new efficient numerical algorithm for interacting fermion systems is proposed and examined in detail. The ground state is expressed approximately by a linear combination of numerically chosen basis states in a truncated Hilbert space. Two…
Faulhaber's formula expresses the sum of the first $n$ positive integers, each raised to an integer power $p\geq 0$, as a polynomial in $n$ of degree $p+1$. Ramanujan expressed this sum for $p\in\{\frac12,\frac32,\frac52,\frac72\}$ as the…
We present a general framework in the setting of difference ring extensions that enables one to find improved representations of indefinite nested sums such that the arising denominators within the summands have reduced degrees. The…
In a recent paper we have suggested that the finite temperature density matrix can be computed efficiently by a combination of polynomial expansion and iterative inversion techniques. We present here significant improvements over this…
Linear reversible circuits represent a subclass of reversible circuits with many applications in quantum computing. These circuits can be efficiently simulated by classical computers and their size is polynomially bounded by the number of…
A novel algorithm is proposed for the interpolation step of the Guruswami-Sudan list decoding algorithm. The proposed method is based on the binary exponentiation algorithm, and can be considered as an extension of the Lee-O'Sullivan…
We present a practical algorithm to approximate the exponential of skew-Hermitian matrices up to round-off error based on an efficient computation of Chebyshev polynomials of matrices and the corresponding error analysis. It is based on…
The document contains an outline of a modular proof for Ramanujan-Chudnovsky identity.