Timeline for Calculating "element-wise" the angles between two lists of vectors
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2014 at 0:32 | vote | accept | bzm3r | ||
| Jun 16, 2014 at 21:43 | comment | added | hpaulj |
I changed the inputs so the shape is correct. The 3 einsum calculations is still better, though most of the extra in the single einsum case is due to the work of assembling the 3d arrays.
|
|
| Jun 16, 2014 at 21:40 | history | edited | hpaulj | CC BY-SA 3.0 |
deleted 38 characters in body
|
| Jun 16, 2014 at 20:36 | comment | added | bzm3r |
By the way, in my current construction, I am always supplying numpy array objects to the function. The shape should be (10000,).
|
|
| Jun 16, 2014 at 20:30 | comment | added | bzm3r |
Update on the multiprocessing test: its much slower: the normal version is over 9000 (serious, no pun intended) times faster.
|
|
| Jun 16, 2014 at 19:13 | history | edited | hpaulj | CC BY-SA 3.0 |
added 428 characters in body
|
| Jun 16, 2014 at 18:21 | comment | added | bzm3r | I am also considering stealing this code here (there is a function to compute the angle between two vectors), and using PyOpenCL to then implement it. Not sure though. | |
| Jun 16, 2014 at 18:00 | comment | added | bzm3r |
Pretty interesting. I am setting up things on a new computer where I will do my testing, so I hadn't gotten to testing that out yet myself. I can now cross it off of my list. My next idea was to perhaps execute the three einsum in parallel using multiprocessing.pool. I will get back to you with my results from that experiment.
|
|
| Jun 16, 2014 at 17:50 | history | answered | hpaulj | CC BY-SA 3.0 |