Related papers: Efficient computation of non-archimedean theta fun…
Building on our previous work (arXiv:1405.5711), we develop the first practical algorithm for computing topological zeta functions of nilpotent groups, non-associative algebras, and modules. While we previously depended upon non-degeneracy…
In this paper we present iterative methods of high efficiency by the criteria of J. F. Traub and A. M. Ostrowski. We define {\it s-nonstationary iterative processes} and prove that, for any one-point iterative process without memory, such…
We develop techniques for computing zeta functions associated with nilpotent groups, not necessarily associative algebras, and modules, as well as Igusa-type zeta functions. At the heart of our method lies an explicit convex-geometric…
The division operation is important for many areas of data processing. Especially considering today's demand for hardware accelerators for machine learning algorithms, there is a high demand for an efficient calculation of the division…
The Riemann theta function is a complex-valued function of g complex variables. It appears in the construction of many (quasi-) periodic solutions of various equations of mathematical physics. In this paper, algorithms for its computation…
We present a new algorithm by which the Adomian polynomials can be determined for scalar-valued nonlinear polynomial functional in a Hilbert space. This algorithm calculates the Adomian polynomials without the complicated operations such as…
This paper presents iterative methods for solving tensor equations involving the T-product. The proposed approaches apply tensor computations without matrix construction. For each initial tensor, these algorithms solve related problems in a…
An important step in the efficient computation of multi-dimensional theta functions is the construction of appropriate symplectic transformations for a given Riemann matrix assuring a rapid convergence of the theta series. An algorithm is…
This paper introduces an efficient algorithm for computing the general oscillatory matrix functions. These computations are crucial for solving second-order semi-linear initial value problems. The method is exploited using the scaling and…
The prime objective of this paper is to design a new family of eighth-order iterative methods by accelerating the order of convergence and efficiency index of well existing seventh-order iterative method of \cite{Soleymani1} without using…
In this paper, we introduce an iterative numerical method to solve systems of nonlinear equations. The third-order convergence of this method is analyzed. Several examples are given to illustrate the efficiency of the proposed method.
This contains a new version of the so-called non-commutative Gauss algorithm for polycyclic groups. Its results allow to read off the order and the index of a subgroup in an (possibly infinite) polycyclic group.
Jacobi's $\theta$ function has numerous applications in mathematics and computer science; a naive algorithm allows the computation of $\theta(z,\tau)$, for $z, \tau$ verifying certain conditions, with precision $P$ in $O(\mathcal{M}(P)…
We present here algorithms for efficient computation of linear algebra problems over finite fields.
We give an iterative algorithm for phase estimation of a parameter theta, which is within a logarithmic factor of the Heisenberg limit. Unlike other methods, we do not need any entanglement or an extra rotation gate which can perform…
We develop a practical method for computing local zeta functions of groups, algebras, and modules in fortunate cases. Using our method, we obtain a complete classification of generic local representation zeta functions associated with…
We express the Riemann zeta function $\zeta\left(s\right)$ of argument $s=\sigma+i\tau$ with imaginary part $\tau$ in terms of three absolutely convergent series. The resulting simple algorithm allows to compute, to arbitrary precision,…
This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…
We present a new algorithm for computing the first discrete homology group of a graph. By testing the algorithm on different data sets of random graphs, we find that it significantly outperforms other known algorithms.
In this paper we give efficient algorithms for computing second-, third-, and fourth-order linear recurrences. We also present an algorithm scheme for computing terms with the indices $N,\ldots,N+n-1$ of an $n$th-order linear recurrence.…