Related papers: Derivation of a low multiplicative complexity algo…
A method of fast linear transform algorithm synthesis for an arbitrary tensor, matrix, or vector is proposed. The method is based on factorization of a tensor and using the factors for building computational structures performing fast…
The structure of octonionic bimodules is formulated in this paper. It turns out that every octonionic bimodule is a tensor product, the category of octonionic bimodules is isomorphic to the category of real vector spaces. We show that there…
We exploit the truncated singular value decomposition and the recently proposed circulant decomposition for an efficient first-order approximation of the multiplication of large dense matrices. A decomposition of each matrix into a sum of a…
We present an efficient numerical method for computing Hamiltonian matrix elements between non-orthogonal Slater determinants, focusing on the most time-consuming component of the calculation that involves a sparse array. In the usual case…
An orthogonal product basis (OPB) of a finite-dimensional Hilbert space $H=H_1\otimes H_2\otimes\cdots\otimes H_n$ is an orthonormal basis of $H$ consisting of product vectors $x_1\otimes x_2\otimes\cdots\otimes x_n$. We show that the…
Quantum computing and modern tensor-based computing have a strong connection, which is especially demonstrated by simulating quantum computations with tensor networks. The other direction is less studied: quantum computing is not often…
Fast algorithms for arithmetic on real or complex polynomials are well-known and have proven to be not only asymptotically efficient but also very practical. Based on Fast Fourier Transform (FFT), they for instance multiply two polynomials…
We present an efficient algorithm for one- and two-component relativistic exact-decoupling calculations. Spin-orbit coupling is thus taken into account for the evaluation of relativistically transformed (one-electron) Hamiltonian. As the…
Randomization has been applied to Hamiltonian simulation in a number of ways to improve the accuracy or efficiency of product formulas. Deterministic product formulas are often constructed in a symmetric way to provide accuracy of even…
Moosbauer and Poole have recently shown that the multiplication of two $5\times 5$ matrices requires no more than 93 multiplications in the (possibly non-commutative) coefficient ring, and that the multiplication of two $6\times 6$ matrices…
This paper proposes new factorizations for computing the Neumann series. The factorizations are based on fast algorithms for small prime sizes series and the splitting of large sizes into several smaller ones. We propose a different basis…
In this paper, we develop numerical algorithms that use small requirements of storage and operations for the computation of hyperbolic cocycles over a rotation. We present fast algorithms for the iteration of the quasi-periodic cocycles and…
We identify all hyperbolic knots whose complements are in the census of orientable one-cusped hyperbolic manifolds with eight ideal tetrahedra. We also compute their Jones polynomials.
We present two fast algorithms for matrix-vector multiplication $y=Ax$, where $A$ is a Hankel matrix. The current asymptotically fastest method is based on the Fast Fourier Transform (FFT), however in multiprecision arithmetics with very…
We offer multiplication method for factoring big natural numbers which extends the group of the Fermat's and Lehman's factorization algorithms and has run-time complexity $O(n^{1/3})$. This paper is argued the finiteness of proposed…
Motivated by the problems of computing sample covariance matrices, and of transforming a collection of vectors to a basis where they are sparse, we present a simple algorithm that computes an approximation of the product of two n-by-n real…
Ootomo, Ozaki, and Yokota [Int. J. High Perform. Comput. Appl., 38 (2024), p. 297-313] have proposed a strategy to recast a floating-point matrix multiplication in terms of integer matrix products. The factors A and B are split into integer…
In the simulation of biological molecules, it is customary to impose constraints on the fastest degrees of freedom to increase the time step. The evaluation of the involved constraint forces must be performed in an efficient manner, for…
W. Thurston suggested a method for computing hyperbolic volume of hyperbolic 3-manifolds, based on a triangulation of the manifold. The method was implemented by J. Weeks in the program SnapPea, which produces a decimal approximation as a…
Matrix multiplication is a fundamental kernel in high performance computing. Many algorithms for fast matrix multiplication can only be applied to enormous matrices ($n>10^{100}$) and thus cannot be used in practice. Of all algorithms…