How to parallel for the computation of eigensystem of a sparse matrix

1 回表示 (過去 30 日間)
HongTu Nguyen
HongTu Nguyen 2012 年 4 月 26 日
回答済み: Andrew Knyazev 2015 年 5 月 15 日
Hi everyone, I have a similarity matrix of image. It's symmetric, and sparse, large matrix. The computation of eigenvalues of this matrix takes too much time and memory. So I think parallelism of this computation will get better performance. But I don't know the way do that. Please give me any guide. Thanks!
  2 件のコメント
Jan
Jan 2012 年 4 月 26 日
Please post the code you are using and define "large" explicitly. Sometimes users of this forum use "large" for 20x20 matrices already.
HongTu Nguyen
HongTu Nguyen 2012 年 4 月 26 日
With image I(130, 132), the similarity matrix would be 17160x17160. It's too large, but I know it symmetric and sparse. So how to compute eigenvalues from this matrix fast?

サインインしてコメントする。

回答 (1 件)

Andrew Knyazev
Andrew Knyazev 2015 年 5 月 15 日
use SLEPc

カテゴリ

Help Center および File ExchangeLinear Algebra についてさらに検索

Community Treasure Hunt

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

Start Hunting!

Translated by