Friends: below code to simulate the Sophienalpe (I can explain if interested) problem:
timer();a=[];for j=1:30000;y=zeros(1,12);i=0;while ~and(y);z=grand(1,1,'uin',1,12);y(z)=y(z)+1;i=i+1;end;a=[a,i];end; timer() On my new Apple silicon M1 iMac it takes 6.7 s; on my old i7 iMac 3.2 GHz it always took 27.5 s. This speed improvement is very useful for my Monte-Carlo simulations. And thanks for providing an Apple silicon SciLab version. Greetings Heinz _______________________________________________ users mailing list - users@lists.scilab.org Click here to unsubscribe: <mailto:users-unsubscr...@lists.scilab.org> https://lists.scilab.org/mailman/listinfo/users This email and any attachments are intended solely for the use of the individual or entity to whom it is addressed and may be confidential and/or privileged. If you are not one of the named recipients or have received this email in error, (i) you should not read, disclose, or copy it, (ii) please notify sender of your receipt by reply email and delete this email and all attachments, (iii) Dassault Systèmes does not accept or assume any liability or responsibility for any use of or reliance on this email. Please be informed that your personal data are processed according to our data privacy policy as described on our website. Should you have any questions related to personal data protection, please contact 3DS Data Protection Officer https://www.3ds.com/privacy-policy/contact/
