I've seen several tables that list operation counts for matrix-inversion related problems, but none of them actually brought forward the way of computing them.
I'm interested in solving
k-diagonal sparse matrix
A - which is a sparse matrix that has zero elements on all but
k many diagonals. On these
k diagonals, it can have either zero or non-zero elements.
I'd like to find out the number of operations as a function of
N, the length of
k, the number of diagonals in
Is there an explicit answer? How could I compute it?