Related papers: Improved algorithms for splitting full matrix alge…
The dynamical symmetries of the Kratzer-type molecular potentials (generalized Kratzer molecular potentials) are studied by using the factorization method. The creation and annihilation (ladder) operators for the radial eigenfunctions…
Two kinds of approximation algorithms exist for the k-BALANCED PARTITIONING problem: those that are fast but compute unsatisfying approximation ratios, and those that guarantee high quality ratios but are slow. In this paper we prove that…
We develop several efficient algorithms for the classical \emph{Matrix Scaling} problem, which is used in many diverse areas, from preconditioning linear systems to approximation of the permanent. On an input $n\times n$ matrix $A$, this…
Quantum affine reflection algebras are coideal subalgebras of quantum affine algebras that lead to trigonometric reflection matrices (solutions of the boundary Yang-Baxter equation). In this paper we use the quantum affine reflection…
This paper shows that it is possible to improve the computational cost, the memory requirements and the accuracy of Quick Fourier Transform (QFT) algorithm for power-of-two FFT (Fast Fourier Transform) just introducing a slight modification…
A generalization of recent group-theoretic matrix multiplication algorithms to an analogue of the theory of partial matrix multiplication is presented. We demonstrate that the added flexibility of this approach can in some cases improve…
We present an efficient alternating direction method of multipliers (ADMM) algorithm for segmenting a multivariate non-stationary time series with structural breaks into stationary regions. We draw from recent work where the series is…
This paper presents a quantum algorithm that computes the product of two $n\times n$ Boolean matrices in $\tilde O(n\sqrt{\ell}+\ell\sqrt{n})$ time, where $\ell$ is the number of non-zero entries in the product. This improves the previous…
We consider the problem of reconstructing a low rank matrix from a subset of its entries and analyze two variants of the so-called Alternating Minimization algorithm, which has been proposed in the past. We establish that when the…
A standard bicovariant differential calculus on a quantum matrix space ${\tt Mat}(m,n)_q$ is considered. The principal result of this work is in observing that the $U_q\frak{s}(\frak{gl}_m\times \frak{gl}_n))_q$ is in fact a…
Censor-Hillel et al. [PODC'15] recently showed how to efficiently implement centralized algebraic algorithms for matrix multiplication in the congested clique model, a model of distributed computing that has received increasing attention in…
Let $k$ be a field containing an algebraically closed field of characteristic zero. If $G$ is a finite group and $D$ is a division algebra over $k$, finite dimensional over its center, we can associate to a faithful $G$-grading on $D$ a…
In these notes we present preliminary results on quantum-like algorithms where tensor product is replaced by geometric product. Such algorithms possess the essential properties typical of quantum computation (entanglement, parallelism) but…
We observe that any $T(n)$ time algorithm (quantum or classical) for several central linear algebraic problems, such as computing $\det(A)$, $tr(A^3)$, or $tr(A^{-1})$ for an $n \times n$ integer matrix $A$, yields a $O(T(n)) + \tilde…
The structure-preserving doubling algorithm (SDA) is a fairly efficient method for solving problems closely related to Hamiltonian (or Hamiltonian-like) matrices, such as computing the required solutions to algebraic Riccati equations.…
We argue that one can factorize the difference equation of hypergeometric type on the nonuniform lattices in general case. It is shown that in the most cases of q-linear spectrum of the eigenvalues this directly leads to the dynamical…
Algebraic matrix multiplication algorithms are designed by bounding the rank of matrix multiplication tensors, and then using a recursive method. However, designing algorithms in this way quickly leads to large constant factors: if one…
Let $n = \mathrm{p}\!\cdot\!\mathrm{q}$ (p < q) and $\Delta = \lvert p-q \rvert$, where p,q are odd integers, then, it is hypothesized that factorizing this composite n will take O(1) time once the steady state value is reached for any…
Let $K$ be an imaginary quadratic field different from $\mathbb{Q}(\sqrt{-1})$ and $\mathbb{Q}(\sqrt{-3})$. For a positive integer $N$, let $K_\mathfrak{n}$ be the ray class field of $K$ modulo $\mathfrak{n}=N\mathcal{O}_K$. By using the…
We construct a quadratic basis of generators of matrix-extended $\mathcal{W}_{1+\infty}$ using a generalization of the Miura transformation. This makes it possible to conjecture a closed-form formula for the operator product expansions…