Jacobi Method; Simple system of equations

RogerDodgr
Messages
20
Reaction score
0
I know this is simple, and I am missing something obvious. I'm suposed to use the "jacobi method"; and with each iteration it should be getting closer and closer to the solution (x=2 and y=1, which it is not). Could someone explain what I'm doing wrong, or how to start?
http://www.sudokupuzzles.net/IMG_0031.jpg
 
Last edited by a moderator:
Physics news on Phys.org
If you do it using matrices, you'll get the coefficient matrix

\displaystyle T=\begin{pmatrix} 0 & -\frac{1}{2}\\ 1 & 0 \end{pmatrix}
and
c = \begin{pmatrix} 2.5\\-1\end{pmatrix}

Then you can evaluate each iteration via

\displaystyle x_{k+1} = T x_k + c

where k+1 is your iteration number, and by looking at your work, you've chosen (0,0) to be your initial guess. I'm not too sure the numbers match up with what you've shown, but give it a try.
 
Using a small program in MatLab, I found that in order to be accurate to within 2 decimal places, it requires about 19 iterations. 3 decimal places took 26 iterations, and 4 decimal places takes about 46. Needless to say, it doesn't converge very quickly.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top