This is an old revision of this page, as edited by KSmrq(talk | contribs) at 13:39, 15 June 2007(revise rating: poorly written, moderately important both mathematically and for parallel computing). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.Revision as of 13:39, 15 June 2007 by KSmrq(talk | contribs)(revise rating: poorly written, moderately important both mathematically and for parallel computing)
This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
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 <= n; i++)
if(abs(S[k][i]) > abs(S[k][m])) m = i;
return m;
}
I hope there are no more errors...
