zeroth

Denmark

Age: 29

Apr
23
awarded Nice Answer
Apr
22
comment Will intel mkl sparse BLAS coogemv internally change coo to csr storage?
Also, if I remember correctly, mkl also provides a greater variation of algorithms for csr matrices.
Apr
22
comment Will intel mkl sparse BLAS coogemv internally change coo to csr storage?
I have no idea what mkl does internally, but I think you should take the time to transfer data to csr format, it is not that difficult and you will be pleased with all the libraries that use csr matrices intrinsically :)
Apr
8
answered Updating values for only certain keys in a list of dicts in python
Mar
14
awarded Good Answer
Feb
20
answered Positioning of named nodes and paths within groupplot environments
Feb
13
awarded Supporter
Jan
23
awarded Guru
Jan
13
reviewed No Action Needed Missing = inserted for \ifnum
Jan
13
reviewed No Action Needed Align equal sign in algorithm in vertical line
Jan
6
comment Efficient algorithm for iterative ranking of a vector
@David have you tried this? I think it is the fastest of the versions currently posted.
Jan
5
comment Efficient algorithm for iterative ranking of a vector
So did it work? I have just tested with the algorithm you provided, your implementation and mine yield the same result.
Jan
5
revised Efficient algorithm for iterative ranking of a vector
fixed error in initialization
Jan
5
comment Efficient algorithm for iterative ranking of a vector
I have not tried it because I have no function to generate the data... I have only tried on a 10 element case (which works). However, there is one error which is now corrected.
Jan
4
comment Efficient algorithm for iterative ranking of a vector
@David you could try the edit which perhaps is slightly faster, however, it is more dependent on input and fluctuations in speed may occur.
Jan
4
revised Efficient algorithm for iterative ranking of a vector
added new algorithm.
Jan
4
comment Efficient algorithm for iterative ranking of a vector
@David, hint, there is a difference ;)
Jan
4
comment Efficient algorithm for iterative ranking of a vector
Please decipher how many read and writes there are in your code, opposed to my code. This should clarify where the difference comes from.
Jan
4
revised Efficient algorithm for iterative ranking of a vector
wrong
Jan
4
revised Efficient algorithm for iterative ranking of a vector
EDIT should be order n
1 2 3 4 5