Sparse Matrix multiplication in Java?

Up vote 0 down vote favorite share g+ share fb share tw.

Hello I know there are a lot of questions on sparse matrix multiplication, but many of the answers say to just use libraries. I want to do it without using library functions. So far I've done the easy part, getting my matrices into the form of element array column array row array.

What I need help is the logic portion. If matrix A is M*N and matrix B is N*P, how do I do this? I considered iterating over the elements in matrix A and checking if it's rowA== colB, and if so if colA==rowB and if thats true then multiply.

I currently know my version is wrong, but I can't think of a way to make it right :( Any hints or direction would be helpful.(This isn't homework BTW) for(int I = 0; I Get(i) == row_valuesb. Get(k)) { sum += (short) (elements. Get(i)*elementsb.

Get(k)); } elementsc. Add(sum); row_valuesc. Add(row_values.

Get(i)); col_valuesc. Add(col_values. Get(k)); } java matrix multiplication sparse link|improve this question asked 1 hour agouser6306061.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.