Borrar filtros
Borrar filtros

Fast computation of an equation.

1 visualización (últimos 30 días)
David Ernesto Caro
David Ernesto Caro el 9 de Sept. de 2019
Comentada: David Ernesto Caro el 11 de Sept. de 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 comentarios
David Ernesto Caro
David Ernesto Caro el 9 de Sept. de 2019
Thanks Walter! Is working.
Bruno Luong
Bruno Luong el 10 de Sept. de 2019
Editada: Bruno Luong el 10 de Sept. de 2019
what are typically m,n and s?
If you have X as matrix the best method might be different, see my answer bellow.

Iniciar sesión para comentar.

Respuesta aceptada

Bruno Luong
Bruno Luong el 10 de Sept. de 2019
Editada: Bruno Luong el 10 de Sept. de 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

Más respuestas (0)

Categorías

Más información sobre Loops and Conditional Statements en Help Center y File Exchange.

Etiquetas

Community Treasure Hunt

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

Start Hunting!

Translated by