My results show that the first is actually faster:
n = 10000;
P1 = rand(1,n);
A1 = sqrt(sum(P1.^2));
Answered 1 year ago
Today I used atand(x) and atan(x). To my great surprise atand(x) was not just a little bit slower than atan(x) but is incredibly...
Asked 2 years ago
I have an algorithm that loops billions (trillions) of times and manipulates a matrix stored in 7 dimensions [...
Asked 1 year ago
I have a large data matrix in which I want to calculate the average of elements satisfying certain conditions. The ...
Join the conversation