Return to Question

Minor edits

Source Link

edit approved Apr 8, 2018 at 12:42

What is the upper Upper bound on the number of non zeros for-zero entries of the product of sparse matrices

I have two sparse matrices, A: $A$ of dimension m x k$m \times k$ and B$B$ of dimension k x n$k \times n$.

Is there a way to know before hand how many non-zero elements will beentries there are in C = A*B$C = A B$ without computing A*B.$A B$?

I can see that the trivial upper bound is m*n$m n$ but can iI get a better upper bound?

What is the upper bound on the number of non zeros for the product of sparse matrices

I have two sparse matrices, A of dimension m x k and B of dimension k x n.

Is there a way to know before hand how many non-zero elements will be there in C = A*B without computing A*B. I can see that the trivial upper bound is m*n but can i get a better upper bound?

Upper bound on the number of non-zero entries of the product of sparse matrices

I have two sparse matrices: $A$ of dimension $m \times k$ and $B$ of dimension $k \times n$.

Is there a way to know how many non-zero entries there are in $C = A B$ without computing $A B$?

I can see that the trivial upper bound is $m n$ but can I get a better upper bound?

Source Link

asked Apr 8, 2018 at 0:04

Morpheus

What is the upper bound on the number of non zeros for the product of sparse matrices

I have two sparse matrices, A of dimension m x k and B of dimension k x n.

Is there a way to know before hand how many non-zero elements will be there in C = A*B without computing A*B. I can see that the trivial upper bound is m*n but can i get a better upper bound?

linear-algebra sparse-matrices