Finding eigenvectors of a matrix when all eigenvalues are known

2 次查看(过去 30 天)
I am currently running a code that has to diagonalise a large number of matrices every run. From other considerations I know what all the eigenvalues of these matrices will be before this calculation start (up to some eps level round off introduced by the code), this there any way I can use this to speed up the diagonalisation?
More specifically I want to keep only eigenvectors with eigenvalue zero, of which there are, say, "n" and denote the set off all such vectors as "Vset". Let us call the matrix 'M' then I wish to solve the problem:
M*Vset = zeros(size(Vset))
(Linsolve doesn't seem to work for this problem!)
Edit: Also all my matrix elements are double precision and real, all eigenvalues are non-negative integers and all eigenvectors will be real, also the matrix is not sparse.
  2 个评论
Wayne King
Wayne King 2012-5-8
"More specifically I want to keep only eigenvectors with eigenvalue zero"
"all eigenvalues are positive integers"
which statement is true?

请先登录,再进行评论。

采纳的回答

James Tursa
James Tursa 2012-5-8
Sounds like you are simply looking for the null space of M:
Vset = null(M);

更多回答(0 个)

类别

Help CenterFile Exchange 中查找有关 Linear Algebra 的更多信息

产品

Community Treasure Hunt

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

Start Hunting!

Translated by