Related papers: An extension of the Chudnovsky algorithm
A new technique is presented to solve a class of linear boundary value problems (BVP). Technique is primarily based on an operational matrix developed from a set of modified Bernoulli polynomials. The new set of polynomials is an…
Based on functional analysis, we propose an algorithm for finite-norm solutions of higher-order linear Fuchsian-type ordinary differential equations (ODEs) P(x,d/dx)f(x)=0 with P(x,d/dx):=[\sum_m p_m (x) (d/dx)^m] by using only the four…
In this work, we deal with extreme value theory in the context of continued fractions using techniques from probability theory, ergodic theory and real analysis. We give an upper bound for the rate of convergence in the Doeblin-Iosifescu…
John Tromp introduced the so-called 'binary lambda calculus' as a way to encode lambda terms in terms of 0-1-strings using the de Bruijn representation along with a weighting scheme. Later, Grygiel and Lescanne conjectured that the number…
Golden ratio primal-dual algorithm (GRPDA) is a new variant of the classical Arrow-Hurwicz method for solving structured convex optimization problem, in which the objective function consists of the sum of two closed proper convex functions,…
We study weighted basic parallel processes (WBPP), a nonlinear recursive generalisation of weighted finite automata inspired from process algebra and Petri net theory. Our main result is an algorithm of 2-EXPSPACE complexity for the WBPP…
We develop summation by parts (SBP) approach for generating high-order finite-difference schemes on the interval and propose new sets of schemes up to the 12th order. The coefficients of the schemes are governed by values of grid spacing…
Using the theory of Calabi-Yau differential equations we obtain all the parameters of Ramanujan-Sato-like series for $1/\pi^2$ as $q$-functions valid in the complex plane. Then we use these q-functions together with a conjecture to find new…
The distributional analysis of Euclidean algorithms was carried out by Baladi and Vall\'{e}e. They showed the asymptotic normality of the number of division steps and associated costs in the Euclidean algorithm as a random variable on the…
This article presents a validation of a recently proposed strongly polynomial-time algorithm for the general linear programming problem. The proposed algorithm is an implicit reduction procedure that combines primal and dual linear…
Motivated by the increasing availability of high-performance parallel computing, we design a distributed parallel algorithm for linearly-coupled block-structured nonconvex constrained optimization problems. Our algorithm performs…
One of the major successes in computational biology has been the unification, using the graphical model formalism, of a multitude of algorithms for annotating and comparing biological sequences. Graphical models that have been applied…
Hamiltonian simulation represents an important module in a large class of quantum algorithms and simulations such as quantum machine learning, quantum linear algebra methods, and modeling for physics, material science and chemistry. One of…
In this paper, we first give formulas for the order polynomial $\Omega (\Pw; t)$ and the Eulerian polynomial $e(\Pw; \lambda)$ of a finite labeled poset $(P, \omega)$ using the adjacency matrix of what we call the $\omega$-graph of $(P,…
The binary expansions of irrational algebraic numbers can serve as high-quality pseudorandom binary sequences. This study presents an efficient method for computing the exact binary expansions of real quadratic algebraic integers using…
Fast convergent, accurate, computationally efficient, parallelizable, and robust matrix inversion and parameter estimation algorithms are required in many time-critical and accuracy-critical applications such as system identification,…
Two results on palindromicity of bi-infinite words in a finite alphabet are presented. The first is a simple, but efficient criterion to exclude palindromicity of minimal sequences and applies, in particular, to the Rudin-Shapiro sequence.…
Koblitz curves are a special set of elliptic curves and have improved performance in computing scalar multiplication in elliptic curve cryptography due to the Frobenius endomorphism. Double-base number system approach for Frobenius…
This article discusses a more general and numerically stable Rybicki Press algorithm, which enables inverting and computing determinants of covariance matrices, whose elements are sums of exponentials. The algorithm is true in exact…
This work derives 5 methods to evaluate families of odd zeta values by combining a power of $\pi$ with Lambert series whose ratios of successive terms tend to $e^{-\pi\sqrt{a}}$ with integers $a\ge7$, outperforming Ramanujan's results with…