Talk:Jacobi method

From Wikipedia, the free encyclopedia

Mathematics Portal This article is within the scope of WikiProject Mathematics, which collaborates on articles related to mathematics.
Mathematics rating:	Start Class	Low Priority	Field: Algebra
Please update this rating as the article progresses, or if the rating is inaccurate. Click to show/hide comments. Please add to or update the comments to suggest improvements to the article. Needs references. Geometry guy 23:36, 17 June 2007 (UTC)

[edit] Unclear

This article is not so clear. Maybe further improvement is needed. —The preceding unsigned comment was added by 65.206.118.19 (talk • contribs) 20:02, 6 July 2006 (UTC)

[edit] v.s. Gauss-Seidel

I don't agree that the difference in storage "is the most meaningful difference" between Jacobi and Gauss-Seidel. More important would be two facts: Gauss-Seidel is faster (it uses "more recent" information), but there are some cases when Jacobi converges and Gauss-Seidel doesn't (and vice-versa). Also important is the fact that Jacobi converges regardless of the row ordering of the matrix (and the corresponding linear system), while Gauss-Seidel depends on the ordering.

Also, after putting the algorithm into the common matrix forms (e.g. write A = D - L - U), it would be nice to compare it to Gauss-Seidel.

And mention of JOR (Jacobi Over Relaxation) would be nice.

Even better would be some data on flops required per iteration, some sample problems solved (e.g. how many iterations to reach a desired tolerance), and some analysis about the convergence rates (especially compared to other methods).

Lavaka 02:40, 18 September 2006 (UTC)