Related papers: Strassen $2\times2$ Matrix Multiplication from a 3…
We give a proof of the $A_2$ conjecture in geometrically doubling metric spaces (GDMS), i.e. a metric space where one can fit not more than a fixed amount of disjoint balls of radius $r$ in a ball of radius $2r$. Our proof consists of three…
There have been several algorithms designed to optimise matrix multiplication. From schoolbook method with complexity $O(n^3)$ to advanced tensor-based tools with time complexity $O(n^{2.3728639})$ (lowest possible bound achieved), a lot of…
In this paper, we investigate the randomized algorithms for block matrix multiplication from random sampling perspective. Based on the A-optimal design criterion, the optimal sampling probabilities and sampling block sizes are obtained. To…
We present a method for randomizing formulas for bilinear computation of matrix products. We consider the implications of such randomization when there are two sources of error: One due to the formula itself only being approximately…
An algorithm for matrix factorization of polynomials was proposed in \cite{fomatati2022tensor} and it was shown that this algorithm produces better results than the standard method for factoring polynomials on the class of summand-reducible…
This article presents new properties of the mesh array for matrix multiplication. In contrast to the standard array that requires 3n-2 steps to complete its computation, the mesh array requires only 2n-1 steps. Symmetries of the mesh array…
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…
In this paper we give expressions for the generalized Drazin inverse of a (2,2,0) operator matrix and a $2\times2$ operator matrix under certain circumstances, which generalizes and unifies several results in the literature.
We propose a more accurate variant of an algorithm for multiplying 4x4 matrices using 48 multiplications over any ring containing an inverse of 2. This algorithm has an error bound exponent of only log 4 $\gamma$$\infty$,2 $\approx$ 2.386.…
We present an algorithm for computing a Smith form with multipliers of a regular matrix polynomial over a field. This algorithm differs from previous ones in that it computes a local Smith form for each irreducible factor in the determinant…
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…
To every product of $2\times2$ matrices, there corresponds a one-dimensional Schr\"{o}dinger equation whose potential consists of generalised point scatterers. Products of {\em random} matrices are obtained by making these interactions and…
The ordered addition of two Lorentz boosts is normally shown to result in a boost by utilizing concepts from group theory and non-Euclidian geometry. We present a method for achieving this addition by performing a sequence of spatial…
We show how to represent a class of expressions involving discrete sums over partitions as matrix models. We apply this technique to the partition functions of 2* theories, i.e. Seiberg-Witten theories with the massive hypermultiplet in the…
We study dual volume sampling, a method for selecting k columns from an n x m short and wide matrix (n <= k <= m) such that the probability of selection is proportional to the volume spanned by the rows of the induced submatrix. This method…
In this paper, we describe a possible generalization of the Wasserstein 2-metric, originally defined on the space of scalar probability densities, to the space of Hermitian matrices with trace one, and to the space of matrix-valued…
The article is devoted to the expansion of iterated Stratonovich stochastic integrals of second multiplicity into the double series of products of standard Gaussian random variables. The proof of expansion is based on the application of…
A technique to compute arbitrary products of a class of Fibonacci $2\times2$ square matrices is proved in this work. General explicit solutions for non autonomous Fibonacci difference equations are obtained from these products. In the…
Matrix double splitting iterations are simple in implementation while solving real non-singular (rectangular) linear systems. In this paper, we present two Alternating Double Splitting (ADS) schemes formulated by two double splittings and…
Variational formulations of reconstruction in computed tomography have the notable drawback of requiring repeated evaluations of both the forward Radon transform and either its adjoint or an approximate inverse transform which are…