This is not just your opinion; it is a simple fact that the number of operations in the case of a sparse matrix depends on the data, so you cannot get a reasonable answer without knowing about the data. This makes it impossible to evaluate a one-time set of all data.
This is probably one of those situations where you can think a lot about it for many hours (and do a lot of research) to make an accurate assessment, or you could spend several minutes writing a version of your existing one that increments the counter every time when he performs an operation. Of course, it will take quite a while (especially if you do not do this on a CUDA-enabled form), but probably much less time than it takes to do the thinking, and when the answer comes out, you donβt have to work hard to convince yourself that's right.
Brooks moses
source share