search for: alpha1m

...he following code which works fine but takes 16+ hours to run and I was hoping someone could give me a hint as to how I could make it more efficient. Let me explain what the code is supposed to do. Each single row of the m.o.f matrix (n*p dim) has to go through the following operation Dm*m.o.f[i]^alpha1m where both Dm and alpha1m have n*1 dimensions. Each row of the m.o.f is to be evaluated n times for the different values of alpha1m and Dm. My code changes the Dm and alpha1m (n*1) matrices into (n*p) matrices (not shown below, done only 1 time) and also change the (1*p) m.o.f row into a m.o (n*p)...