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

RaulDurand August 31, 2018, 12:09pm 5

Singular value decomposition can be used to calculate A^n in one step. Depending on the size of A and n it may be cheaper.

1 Like

Topic		Replies	Views
Fastest way to multiply a constant sparse matrix to a vector Performance	7	1899	October 22, 2018
Matrix-vector multiplication slower than a 'naive' for loop? Performance vector	7	1651	July 30, 2020
Speeding up elementwise Vector-SparseMatrixCSC multiplication broadcasting Performance sparse	11	545	December 12, 2024
Best way to parallelize Julia at Scale parallel , linearalgebra , sparse	12	1339	August 25, 2022
Slow multiplication of transpose of sparse matrix Performance	5	936	April 27, 2022