Related papers: Fast Ramanujan-type Series for Logarithms. Part I
Computing discrete logarithms in finite fields is a main concern in cryptography. The best algorithms in large and medium characteristic fields (e.g., {GF}$(p^2)$, {GF}$(p^{12})$) are the Number Field Sieve and its variants (special,…
Concerned with the Stokes systems with rapidly oscillating periodic coefficients, we mainly extend the recent works in \cite{SGZWS,G} to those in term of Lipschitz domains. The arguments employed here are quite different from theirs, and…
We outline an elementary method for proving numerical hypergeometric identities, in particular, Ramanujan-type identities for $1/\pi$. The principal idea is using algebraic transformations of arithmetic hypergeometric series to translate…
System logs are crucial for monitoring and diagnosing modern computing infrastructure, but their scale and complexity require reliable and efficient automated interpretation. Since severity levels are predefined metadata in system log…
Following advances in the abstract theory of composites, we develop rapidly converging series expansions about $z=\infty$ for the resolvent ${\bf R}(z)=[z{\bf I}-{\bf P}^\dagger{\bf Q}{\bf P}]^{-1}$ where ${\bf Q}$ is an orthogonal…
First we give general formulas for proving real or complex Ramanujan series for $1/\pi$. Then, as an example, we apply them for providing complete proofs of the fastest series for $1/\pi$ due to Ramanujan using Russell and Weber modular…
We give new positive and negative results (some conditional) on speeding up computational algebraic geometry over the reals: (1) A new and sharper upper bound on the number of connected components of a semialgebraic set. Our bound is novel…
We show how the theory of linear forms in two logarithms allows one to get effective irrationality measures for $n$-th roots of rational numbers ${a \over b}$, when $a$ is very close to $b$. We give a $p$-adic analogue of this result under…
In the early 1980's an elementary algorithm for computing conformal maps was discovered by R. K\"uhnau and the first author. The algorithm is fast and accurate, but convergence was not known. Given points z_0,...,z_n in the plane, the…
This paper is concerned with the quantitative homogenization of $2m$-order elliptic systems with bounded measurable, rapidly oscillating periodic coefficients. We establish the sharp $O(\varepsilon)$ convergence rate in $W^{m-1, p_0}$ with…
Log parsing is a fundamental step for automated log analysis, which transforms raw log messages into structured formats. Existing syntax-based parsers struggle with complex logs because they lack semantic reasoning ability. Emerging…
We state and discuss numerous mathematical identities involving Jacobi elliptic functions sn(x,m), cn(x,m), dn(x,m), where m is the elliptic modulus parameter. In all identities, the arguments of the Jacobi functions are separated by either…
The aim of this paper is to establish new series transforms of Bailey type and to show that these Bailey type transforms work as efficiently as the classical one and give not only new $q$-hypergeometric identities, converting double or…
Methods for the computation of classical Gaussian quadrature rules are described which are effective both for small and large degree. These methods are reliable because the iterative computation of the nodes has guaranteed convergence, and…
We provide in this work an algorithm for approximating a very broad class of symmetric Toeplitz matrices to machine precision in $\mathcal{O}(n \log n)$ time with applications to fitting time series models. In particular, for a symmetric…
Fast Fourier transform (FFT) based methods have turned out to be an effective computational approach for numerical homogenisation. In particular, Fourier-Galerkin methods are computational methods for partial differential equations that are…
This paper introduces Modular Linear Tokenization (MLT), a reversible and deterministic technique for encoding high-cardinality categorical identifiers into compact numerical vectors. Unlike traditional hashing or one-hot encodings, MLT…
We present a compact quantum circuit for factoring a large class of integers, including some whose classical hardness is expected to be equivalent to RSA (but not including RSA integers themselves). Most notably, we factor $n$-bit integers…
The rise of large language models (LLMs) like ChatGPT has significantly improved automated code generation, enhancing software development efficiency. However, this introduces challenges in academia, particularly in distinguishing between…
Many applications of computer vision rely on the alignment of similar but non-identical images. We present a fast algorithm for aligning heterogeneous images based on optimal transport. Our approach combines the speed of fast Fourier…