Eigs function returns complex numbers when computing the largest eigenvalue
显示 更早的评论
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
2015-10-19
0 个投票
Your matrix is not symmetric. The eigenvalues of a non-symmetric matrix will often be complex numbers.
类别
在 帮助中心 和 File Exchange 中查找有关 Linear Algebra 的更多信息
2017-12-19
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Translated by 
