Jump to content

Talk:Jacobi eigenvalue algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Issso (talk | contribs) at 08:41, 21 August 2006 (algorithm bug). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Hi all! I've just tried to use the algorithm, but there's a BUG! The maxind method is totaly wrong. A correct one would be:
int maxind(int k)
{
int m = 1;
for (int i = 2; i <= 4; i++)
if(abs(S[k-1][i-1]) > abs(S[k-1][m-1])) m = i;
return m;
}
I hope there are no more errors...