1. General
  2. Pytania
0
Z odpowiedzią

multiplication / addition performance

ccc 4 lat temu • Ostatnio zmodyfikowane przez Pavel Holoborodko 4 lat temu • 3

is there a speed-up when we do the vector-matrix multiplication addition by using your toolbox?

Odpowiedź

+1
Odpowiedź
Z odpowiedzią
Pavel Holoborodko 4 lat temu

Your question is not clear. "Speed-up" compared to what?

If we would compare it to VPA then we see ~53 times speed-up:

>> A = vpa(rand(1000));
>> x = vpa(rand(1000,1));
>> tic; y = A*x; toc;
Elapsed time is 1.143934 seconds.

>> A = rand(1000,'mp');
>> x = rand(1000,1,'mp');
>> tic; y = A*x; toc;
Elapsed time is 0.021398 seconds.
+1
Odpowiedź
Z odpowiedzią
Pavel Holoborodko 4 lat temu

Your question is not clear. "Speed-up" compared to what?

If we would compare it to VPA then we see ~53 times speed-up:

>> A = vpa(rand(1000));
>> x = vpa(rand(1000,1));
>> tic; y = A*x; toc;
Elapsed time is 1.143934 seconds.

>> A = rand(1000,'mp');
>> x = rand(1000,1,'mp');
>> tic; y = A*x; toc;
Elapsed time is 0.021398 seconds.
Michal Kvasnicka 4 lat temu

From my point of view is very important to compare multi-precision arrays creation, too!!!


>> tic; A = vpa(rand(1000));toc
Elapsed time is 16.637381 seconds.


>> tic; A = rand(1000,'mp');toc
Elapsed time is 0.026866 seconds.

So in this case, you can see ~ 619x speed up!!!

I think, the MCT is really excellent tool ... :)

Pavel Holoborodko 4 lat temu

Just as a note, we have more examples of VPA vs. MCT in our user's manual:

https://www.advanpix.com/documentation/users-manual/#Symbolic_Math_Toolbox_VPA_vs_Multiprecision_Computing_Toolbox

Customer support service by UserEcho