Which is faster, the sparse or spdiag function?

In each iteration of a for loop I'm creating a big (approximatlly 10k*10k) five diagonal sparse matrix. Does anybody knows which function work faster? The sparse or spdiags. Is there a faster way to it if I only update the values of an existing sparse matrix in each iteration?

2 个评论

Be careful, updating an existing sparse matrix is slow if you are adding non-zero elements beyond what was allocated for the matrix with spalloc()
Even if you are not exceeding the currently allocated memory for the matrix, it can be slow if the operation causes a large number of existing elements to be moved around in this memory.

请先登录,再进行评论。

回答(1 个)

spdiags() invokes sparse() after packaging together the appropriate content and indices.

1 个评论

So, it means that sparse() is better in terms of time consuming. Thanks.

请先登录,再进行评论。

类别

帮助中心File Exchange 中查找有关 Sparse Matrices 的更多信息

提问:

d
d
2018-4-10

评论:

d
d
2018-4-11

Community Treasure Hunt

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

Start Hunting!

Translated by