Talk:Tridiagonal matrix algorithm

Tridiagonal matrix algorithm l'exemple de trensport de la chaleure dans un bare

Edited the C example to clarify parts of the algorithm. Specifically, the C algorithm computed 1/m and then multiplied, instead of just dividing by m. This is dangerous in floating point arithmetic, and should be avoided. The code also more closely matches the algorithm in the example above. David Souther (talk) 16:17, 30 October 2008 (UTC)[reply]

Also, in the C# code, the variable 'f' is not declared anywhere so this code will not compile. I believe that the 'x' array is suppose to have the same length as 'd' (or 'b' for that matter). And seeing how 'N' is being used to determine it's limit within the program, changing f.Length to d.Length makes sense.206.162.205.234 (talk) 09:42, 29 November 2008 (UTC)[reply]

Alright, I am making some more changes. First off, the code is actually different between the two languages when it comes to the back substitution. Also, the beginning of this C# doesn't make much sense. All of the arrays need to have the same length or else it does match the math above and the code won't work. I modified so that it better fits with C sample code (which actually works). I just rewrote it to be more like the C code. I also duplicated the comments. I think this will make it all easier to read. 206.162.205.234 (talk) 11:14, 30 November 2008 (UTC)[reply]

C# code example superfluous?

What is the point of having the C# example there when it is virtually line for line identical to the C one right above it? I will remove it as it seems to add no value to the discussion. SiegeLord (talk) 02:12, 11 May 2009 (UTC)[reply]

Hu-Gallash?

google says that the only reference in all the internet to the "hu-gallash" algorithm is on this page and its translations. can someone find a reference or else delete this? —Preceding unsigned comment added by 69.200.245.55 (talk) 11:55, 28 July 2009 (UTC)[reply]

I've removed Hu-Gallash. Probably a hoax. Salih (talk) 13:04, 28 July 2009 (UTC)[reply]