Given that A is a sparse matrix, norm(A(i,:)) takes a very long time. Why and can one do better ?
5 ビュー (過去 30 日間)
古いコメントを表示
I am computing norm(A(i,:)) within a loop, where A is a sparse matrix. This seems to be a bottleneck, is there anyway to perform this faster ? Thank you.
1 件のコメント
Walter Roberson
2020 年 8 月 10 日
Can you recode with the matrix transposed? Accessing sparse by columns is faster than by row.
採用された回答
John D'Errico
2020 年 8 月 10 日
You really don't want to use loops to do something like this.
>> A = sprand(10000,10000,0.001);
>> timeit(@() norm(A(1,:)))
ans =
0.000121650132
>> timeit(@() sqrt(sum(A.^2,2)))
ans =
0.000442972132
So, the time to compute the norm of just one of the rows was a significant fraction of the total time to compute the norm of all rows at once.
0 件のコメント
その他の回答 (2 件)
Walter Roberson
2020 年 8 月 11 日
編集済み: Walter Roberson
2020 年 8 月 11 日
If you were going to do this repeatedly, then
%one time cost
At = A.';
%then
norm(At(:,1))
is over 100 times faster than
norm(A(1,:))
For John's suggestion of A = sprand(10000,10000,0.001); then the cost of transposing A is roughly the same as the cost of calculating 11 row norms of A.
... And of course, it might happen to be practical to work with the transposed version instead of the original, so in some cases there would be no computation cost, just the cost of changing the code.
0 件のコメント
James Tursa
2020 年 8 月 9 日
編集済み: James Tursa
2020 年 8 月 9 日
Will you eventually need all of the rows? E.g., do this once at the beginning outside the loop
n = sqrt(sum(A.^2,2))
And then just pick off the element you want each iteration.
Alternatively, you could do this calculation one row at a time in a mex routine in order to avoid the data copy associated with forming the A(i,:) row explicitly.
0 件のコメント
参考
カテゴリ
Help Center および File Exchange で Creating and Concatenating Matrices についてさらに検索
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!