Filter löschen
Filter löschen

Fast computation of an equation.

2 Ansichten (letzte 30 Tage)
David Ernesto Caro
David Ernesto Caro am 9 Sep. 2019
Given two matrices:
We want a the fastest way to compute the vector \phi.... (j=1 to m).
Is there a way to use parallel computation, any trick?
  8 Kommentare
David Ernesto Caro
David Ernesto Caro am 9 Sep. 2019
Thanks Walter! Is working.
Bruno Luong
Bruno Luong am 10 Sep. 2019
Bearbeitet: Bruno Luong am 10 Sep. 2019
what are typically m,n and s?
If you have X as matrix the best method might be different, see my answer bellow.

Melden Sie sich an, um zu kommentieren.

Akzeptierte Antwort

Bruno Luong
Bruno Luong am 10 Sep. 2019
Bearbeitet: Bruno Luong am 10 Sep. 2019
The efficientcy of the bellow method depend on m, n, s
% Generate dummy test data
m = 1000;
n = 1000;
s = 1000;
W = rand(m,n);
V = rand(m,n);
X = rand(n,s);
% Walter method
tic
Xp = permute(X,[3 1 2]);
Z1 = sum((Xp-W).*(V-Xp),2);
Z1 = reshape(Z1,[m s]).';
toc % Elapsed time is 2.816333 seconds.
% My new method
tic
Z2 = -sum(X.^2,1)+(W+V)*X-sum(W.*V,2);
Z2 = Z2.';
toc % Elapsed time is 0.040274 seconds.
% Check correctness
norm(Z1-Z2,'fro')/norm(Z1,'fro') % 4.6622e-15

Weitere Antworten (0)

Kategorien

Mehr zu Loops and Conditional Statements finden Sie in Help Center und File Exchange

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by