Hi, in my code I need to evaluate A^n * v where A is a possibly very large sparse matrix and v is a vector. I suppose it is much faster to perform A * (A * ... * (A * v) rather than elevating A to the n-th power, but what is the most efficient way to do so? I currently have function A_pow_n_B!(re…

Best way to repeatedly multiply a Vector by a SparseMatrix

Nectarineimp August 31, 2018, 9:03pm 11

Maybe this is dumb, but instead of iterating the entire giant matrix, why not just get the coordinates of the structurally non-zero elements and operate on just those?

SparseArrays.findnz

Topic		Replies	Views
Fastest way to compute `A^n * x` for large matrices `A` and vector `x` Performance	13	1361	April 22, 2020
Fastest way of doing (constant sparse) * SVector multiplication Performance	9	890	October 16, 2018
Block sparse matrix multiplication with repeated blocks Numerics	4	869	April 26, 2020
Sparse matrix-vector product: much more slow than Matlab Performance matlab , optimization	24	4638	December 20, 2017
Speed comparison: Sparse matrix multiplication vs usual matrix multiplication General Usage question	7	3942	February 13, 2017

Best way to repeatedly multiply a Vector by a SparseMatrix

Related topics