[Scilab-users] u .^ k ?

[Lamy Alain]

Hi,

Does anyone know how to perform efficiently an operation like :
u .^k

with:
u = [u1, u2, ..., un]  // ui : real numbers
and:
k = [k1; k2; kp]  // ki : positive integers


The result being :

[ u1^k1, u2^k1, ..., un^k1;
  u1^k2, u2^k2, ..., un^k2;
...
  u1^kp, u2^kp, ..., un^kp ]


I know  how to do it with cumprod (for instance), but it does not seem to be
efficient enough.