Eigs function returns complex numbers when computing the largest eigenvalue

2 次查看（过去 30 天）
Pavlos
Pavlos 2015-10-19
回答： Rupesh Rupesh 2017-12-19
Hello, i am contructing an adjacency matrix from real networks as follows:
x = dlmread('file.txt');
left = x(:,1)+1;
right = x(:,2)+1;
Adj = sparse(left,right,1,7319,7319);
eigs(Adj)
The networks are directed, some of them are very sparse while several others may also be disconnected. The problem is that for some networks i get the largest eigenvalue as a complex number. I have read several related threads to my post but i couldn't properly understand the quialitative reason.

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

回答（2 个）

John D'Errico
John D'Errico 2015-10-19
Your matrix is not symmetric. The eigenvalues of a non-symmetric matrix will often be complex numbers.
Rupesh Rupesh
Rupesh Rupesh 2017-12-19
Try using svd

类别

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

标签

Community Treasure Hunt

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

Start Hunting!

Translated by