Related papers: Strassen $2\times2$ Matrix Multiplication from a 3…
A simple and algorithmic description of matrix shape invariant potentials is presented. The complete lists of generic matrix superpotentials of dimension $2\times2$ and of special superpotentials of dimension $3\times3$ are given…
We describe an efficient algorithm for computing the matrix vector products that appear in the numerical resolution of boundary integral equations in 2 space dimension. This work is an extension of the so-called Sparse Cardinal Sine…
By using the matrix formulation of the two-step approach to distributions of patterns in random sequences, recurrence and explicit formulas for the generating functions of successions in random permutations of arbitrary multisets are…
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…
The two-by-two scattering matrix for one-dimensional scattering processes is a three-parameter Sp(2) matrix or its unitary equivalent. For one-dimensional crystals, it would be repeated applications of this matrix. The problem is how to…
The main result of this paper is the decidability of the membership problem for $2\times 2$ nonsingular integer matrices. Namely, we will construct the first algorithm that for any nonsingular $2\times 2$ integer matrices $M_1,\dots,M_n$…
Gilbert Strang posited that a permutation matrix of bandwidth $w$ can be written as a product of $N < 2w$ permutation matrices of bandwidth 1. A proof employing a greedy ``parallel bubblesort'' algorithm on the rows of the permutation…
We present an algorithm to compute the Jordan chain of a nearly defective matrix with a $2\times2$ Jordan block. The algorithm is based on an inverse-iteration procedure and only needs information about the invariant subspace corresponding…
Any associative bilinear multiplication on the set of n-by-n matrices over some field of characteristic not two, that makes the same vectors orthogonal and has the same trace as ordinary matrix multiplication, must be ordinary matrix…
We present an algorithm for the recovery of a matrix $\mathbb{M}$ % (non-singular $\in $ $\mathbb{C}^{N\times N}$) by only being aware of two of its powers, $\mathbb{M}_{k_{1}}:=\mathbb{M}^{k_{1}}$ and $\mathbb{M}%…
A new algorithm for calculating the stransverse mass, $M_{T2}$, in either symmetric or asymmetric situations has been developed which exhibits good stability, high precision and quadratic convergence for the majority of the $M_{T2}$…
In this article, we use results of Number Theory to prove the conjecture on eigenvalue problem of a 2D elliptic PDE proposed by P. Korman in his recent paper \cite{ref}: for any even integer $2k$, one can find an eigenvalue $N$ that can be…
We show that multiplication can be done in polynomial time on a three counter machine that receives its input as the contents of two counters. The technique is generalized to functions of two variables computable by deterministic Turing…
The existing doubling algorithms have been proven efficient for several important nonlinear matrix equations arising from real-world engineering applications. In a nutshell, the algorithms iteratively compute a basis matrix, in one of the…
In analogy to a characterisation of operator matrices generating $C_0$-semigroups due to R. Nagel (\cite{[Na89]}), we give conditions on its entries in order that a $2\times 2$ operator matrix generates a cosine operator function. We apply…
A factorization of the inverse of a Hermetian positive definite matrix based on a diagonal by diagonal recurrence formulae permits the inversion of Toeplitz Block Toeplitz matrices using minimized matrix-vector products, with a complexity…
We study the dynamical symmetries of a class of two-dimensional superintegrable systems on a 2-sphere, obtained by a procedure based on the Marsden-Weinstein reduction, by considering its shape-invariant intertwining operators. These are…
In 2010, A. Shpilka and I. Volkovich established a prominent result on the equivalence of polynomial factorization and identity testing. It follows from their result that a multilinear polynomial over the finite field of order 2 can be…
Traditional numerical methods for calculating matrix eigenvalues are prohibitively expensive for high-dimensional problems. Iterative random sparsification methods allow for the estimation of a single dominant eigenvalue at reduced cost by…
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…