Questions tagged [matrix-multiplication]
The matrix-multiplication tag has no usage guidance.
21
questions
0
votes
0
answers
11
views
runtime of solving matrix differential equation wrt dimensions of matrix
Suppose a computer solves a coupled differential equations (with given boundary conditions) of which each equation deals with $2^n \times 2^n$ size of matrices as solutions. My question is
Does time-...
3
votes
0
answers
37
views
fast multiplication of power of a matrix by a vector
I'm interested in computing of the product $M^n v$, where $M$ is an $m\times m$ matrix (over a semiring) and $v$ is column-vector, with the smallest number of multiplications in the underlying ...
- 141
4
votes
2
answers
79
views
Best-known complexity for $l \times m$ by $m \times n$ matrix multiplication?
I know that the fastest known algorithm for multiplying two $m \times m$ matrices runs in time $m^{\omega}$, where currently we have $\omega = 2.3728596$ due to Virginia Williams's latest result
(see ...
- 5,144
3
votes
0
answers
47
views
Computing a series of matrix power - matrix products
Assuming we have two dense matrices $A \in \mathbb{R}^{m\times m}, B \in \mathbb{R}^{m\times n}$, is there a smart way to compute all entries of the series $A^1 B, A^2 B, A^3 B, \dots, A^k B$ up to ...
- 31
1
vote
1
answer
45
views
Matrix Multiplication Verification
This question relates to the 2nd edition of Probability and Computation by Mitzenmacher and Upfal.
The authors then use the Law of Total Probability
My question concerns the line that begins with $\...
0
votes
0
answers
54
views
Merging the submatrices' time complexity in matrix multiplication
This is a problem of CLRS:
What is the largest $k$ such that if you can multiply $3 \times 3$ matrices using $k$ multiplications (not assuming commutativity of multiplication), then you can multiply
$...
- 377
1
vote
1
answer
111
views
Matrix-vector multiplication using only lower triangular of matrix
Suppose one has a large sparse symmetric positive definite matrix $A$ and wants to multiply it by a vector $x$. Only the lower triangular part of matrix A is stored/known. The multiplication $Ax$ ...
- 11
0
votes
0
answers
17
views
Best sparse matrix structure for Lanczos algorithm and/or matrix-vector multiplication
I have written a Lanczos routine which I am using for some problems in physics. Now, I would like to feed it some sparse matrices with very low densities (hamiltonians of large systems), and for that ...
- 101
0
votes
1
answer
61
views
Why do researchers only count the number of multiplications when analyse the time complexity of Matrix Multiplication?
In this article about the recent breakthough in Matrix Multiplication, it quotes Chris Umans's words:
Multiplications are everything. The exponent on the eventual running time is fully dependent only ...
- 570
1
vote
1
answer
110
views
Iterated multiplication of permutation matrices
Given $m$ matrices of size $n\times n$ each of which is promised to be a permutation is it in $\mathit{quasiAC}^0$ or $\mathit{AC}^0$ to multiply the permutations where
$m=\mathit{poly}(n)$
$m=\...
- 17
0
votes
1
answer
43
views
matrix multiplication speedup when the matrix elements are 0, 1 and -1
I would like to compute matrix multiplication A * B where A is Nx3 and B is 3x3. We also ...
- 103
2
votes
1
answer
400
views
In Strassen's algorithm, why does padding the matrices with zeros not affect the asymptopic complexity?
In Strassen's algorithm, why does padding the matrices with zeros, in order to multiply matrices that are not powers of 2, not affect the asymptopic complexity?
Hi, I was reading this question but I ...
- 23
5
votes
1
answer
81
views
Is there a polynomial sized arithmetic formula for iterated matrix multiplication?
I found an article on Catalytic space which describes how additional memory (which must be returned to it's arbitrary, initial state) can be useful for computation. There's also an expository follow ...
- 213
1
vote
1
answer
116
views
Why is the weight matrix diagonal in weighted least squares regression?
I was going through the theory for weighted least-squares fitting and I understood its basic underlying concepts, but I couldn't understand why exactly do we keep the weights as a diagonal matrix ...
- 113
21
votes
2
answers
1k
views
What is the intuition behind Strassen's Algorithm?
I came across Strassen's algorithm for matrix multiplication, which has time complexity $O(n^{2.81})$, significantly better than the naive $O(n^3)$. Of course, there have been several other ...
1
vote
0
answers
13
views
Lower bounds for orthogonal matrix multiplication
Is it possible, according to the current state of knowledge, that orthogonal matrices can be multiplied faster than arbitrary matrices?
More precisely, let $T(N)$ denote the worst-case time of the ...
- 215
0
votes
1
answer
102
views
Is this benchmark sufficient to consider my algorithm as an efficient matrix multiplication algorithm?
I built a matrix multiplication algorithm and now I need some thoughts about following benchmark.
C++ chrono:: high resolution clock Time(micro second)
(Dim)256--> (Naive algo ) 296807, (My algo) ...
- 3
1
vote
1
answer
30
views
How can follow this this guide to construct a graph with matrix/reachability
Let's we have k matrices. For example we have 3 now, where first one is 8x5 ($a_1$ x $b_1$), second one is 5 x 6 ($a_2$ x $b_2$) and last one is 6 x 8 ($a_3$ x $b_3$). And our goal is to figure out ...
- 15
0
votes
1
answer
78
views
In a LP problem Ax = b, how to solve for A instead of x?
I have a multi-objective linear programming problem of the form Ax = b, where A is a matrix and x and b are vectors. x is known, and I'm looking to minimise each row of b by solving for A.
Constraints ...
- 103
1
vote
1
answer
57
views
Is matrix multiplication cheaper than inverse?
In wiki, it is shown that the time complexity of matrix multiplication and matrix inverse is similar. But people always to argue it is easier to do matrix multiplication rather than inverse. Is this ...
- 121
3
votes
1
answer
249
views
Calculate boolean matrix multiplication (BMM) using transitive closure
Let us say I am given an algorithm that calculates the transitive closure of a given graph $G = \{ V, E \}$.
How can I use this algorithm in order to perform the Boolean Matrix Multiplication of two ...
- 31