Fast computation of diagonal elements

I have two matrices, A of size m-by-n and B of size m-by-m. I need to quickly compute the digonal elements of (A'*B*A). Here m is of order 100 while n is of order 10000.
How would I do it ? Doing diag(A'*B*A) will be slow.
Neither B nor A is diagonal. they are full matrices.

 Respuesta aceptada

Matt J
Matt J el 5 de Nov. de 2013
Editada: Matt J el 5 de Nov. de 2013
diagonal = sum(A.*(B*A),1);

2 comentarios

or
sum((A'*B).*A',2)
Matt J
Matt J el 5 de Nov. de 2013
It works. But you'll have overhead from the transpositions.

Iniciar sesión para comentar.

Más respuestas (2)

Sean de Wolski
Sean de Wolski el 5 de Nov. de 2013
m = 100;
n = 10000;
A = rand(m,n);
B = rand(m);
timeit(@()diag(A'*B*A)) % R2013b
ans = 0.8128
So it takes slightly less than a second on my Win7x64 laptop. How many times do you need to do this computation?

2 comentarios

Saurabh
Saurabh el 5 de Nov. de 2013
I need to compute this for possibly 200 iterations.
Sean de Wolski
Sean de Wolski el 5 de Nov. de 2013
Editada: Sean de Wolski el 5 de Nov. de 2013
I.e. less than three minutes total? I would just do the above 200x and go get a cup of coffee while MATLAB is crunchin'

Iniciar sesión para comentar.

Azzi Abdelmalek
Azzi Abdelmalek el 5 de Nov. de 2013
Editada: Azzi Abdelmalek el 5 de Nov. de 2013
This will reduce the time
S=A'*B;
d1=arrayfun(@(x) S(x,:)*A(:,x),1:n);

1 comentario

Saurabh
Saurabh el 5 de Nov. de 2013
This solution is slightly slower than Matt's.

Iniciar sesión para comentar.

Categorías

Preguntada:

el 5 de Nov. de 2013

Comentada:

el 5 de Nov. de 2013

Community Treasure Hunt

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

Start Hunting!

Translated by