fastest way for multiplication of symmetric matrix and sparse matrix

12 次查看（过去 30 天）
Nguyen Van Hieu
Nguyen Van Hieu 2021-5-16
评论： Nguyen Van Hieu 2021-5-18
I am doing a multiplication as: P=A*P*A'
where size of A and P are 6640x6640. The nonzero element of A and P is 309028 and 0. P is symmetric.
If I use sparse matrix for A, the time to calculate A*P*A' is twice as if I use dense matrix for A.
I want to reduce the computational time for this calculation, can you recommend a method? I am planning to use PARDISO solver from https://www.pardiso-project.org/
Thank you!

请先登录，再回答此问题。

采纳的回答

Matt J
Matt J 2021-5-18
编辑：Matt J 2021-5-18
Ran in:
If I use sparse matrix for A, the time to calculate A*P*A' is twice as if I use dense matrix for A.
You have a strange computer. I see very much the opposite. One thing you can check is whether nzmax(A)=nnz(A). You can also shave off some time by precomputing A'.
N=6640/2;
A=sprand(N,N,.007);
At=A;
P=rand(N); P=P+P.';
Af=full(A);
Aft=Af';
tic
A*P*A';
toc
Elapsed time is 0.738674 seconds.
tic
A*P*At;
toc
Elapsed time is 0.631558 seconds.
tic;
Af*P*Aft;
toc;
Elapsed time is 2.053788 seconds.

更多回答（0 个）

类别

在 Help Center 和 File Exchange 中查找有关 Sparse Matrices 的更多信息

标签

Community Treasure Hunt

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

Start Hunting!

Translated by