Glad to be a lifesaver, Joseph! I retired a year ago, thinking maybe I'd bust out some other videos in my newfound free time, but I seem to have gotten distracted by other fun projects!
Thanks professor Waterman. I'm preparing for Fogarty's test tomorrow, and totally found this helpful as I have been too ill to attend class and missed these lectures.
Thanks for explaining this! I am in health data science masters and have to write a python fx for this. I was freaking out after doing some reading trying to understand what I was doing
Thanks for lucid explanation... You saved my day! And I assume that we need to iterate unless we get correct approximations where further approximation is not possible... Thanks and subscribed 😇
Hi Gregg, do you not subtract the old x1 from the new x1 then divide all by the new x1 and multiply by 100 (like Gauss Seigal method) to get the iteration %
Hie Gregg, say we do not know the exact solution, How do we know if we have obtained the right value for either X1 , X2 OR X3. Also when we get the value for X1 , does that mean all the other values are now correct?
The iterations should start at zero since it's initial instead of starting at 1 when we look at the table right? We are assuming the initial guess is zero not the guess at iteration 1.
so, once you have reached the correct values for all 3 variables, the iterations beyond that will continue to give the same values over and over? I am assuming thats when you know you are right, right?
How do you know when to stop the iterations? Are you provided with the solutions at the start? Or is there going to be a consistency in results at a point to tell that we're at the solutions?
Your solutions are going to start converging after n iterations, or sometimes question would state number of iterations to be used. First check for convergence criteria in system of linear equation, hope this helps ;)
how we use zero approximation =0 and use the dependence values on it why we do not take zero approximation equall to 1 or 2 or 3 or any thing and depend on the values depend on them?
How do we confirm that we have reached the solution point and we don't need further iterations? does it relate to the difference b/w values obtained from subsequent iterations?
A bit late, but... with Jacobi you calculate values for each of the variables using all three previous values, then "update" them all at once. With Gauss-Seidel you keep updating each variable as you go. This is why you usually get faster convergence with Gauss-Seidel.
Very good question whose answer I do not know! As a teacher, I would say that learning the Jacobi method might make learning Gauss-Seidel a tiny bit easier to learn!
A situation where you would use Jacobi over Gauss-Seidel is when you have a large system of linear equations and within each iteration you want to compute x1, x2, ..., xn in parallel. You can do that with Jacobi but not with Gauss-Seidel since x1, ..., xn has to be computed sequentially as each result depends on values from the previous x.
Is there any limit for Jacobi method? I use Jacobi method, but cannot solve this linear system. 2x - 6y + z = 11; -5x + y -2z = -12; x + 2y + 73z = 20. the Jacobi method answer is 0.7, -2.4, 0. However, the actually answer is 2, -1, 0
5 years later still saving lives, thank you !
7 years later he is still saving lives)))
8...
@@shahriarinan4540 8 and a few days
@@Hxcker471 9
9 years later
Glad to be a lifesaver, Joseph! I retired a year ago, thinking maybe I'd bust out some other videos in my newfound free time, but I seem to have gotten distracted by other fun projects!
9 years later and it's still useful 😊😊😊😊 thank you
Full semester of running from this and procrastinating. Less than 3hrs to the exam and here i am.... You're stil saving lives
Thanks professor Waterman. I'm preparing for Fogarty's test tomorrow, and totally found this helpful as I have been too ill to attend class and missed these lectures.
Simple elegantly explained and straight to the point. You’re amazing at teaching.
This is one of the best no-bullshit explanation for the Jacobi method. ManyThank s!
2020 Still saving lives here..Thank you from Greece!!
Is the x1 for 3rd iteration=1.175 instead of 0.815?
Yes, you are correct, Jonathan! Everyone else take note...
Gregg Waterman Anyway, thank you Gregg for the videos. Very informative and easy to understand. Cheers!
Jonathan Tan thank you so much
@@watermanOIT thank you for the video but more importantly for the correction
i was like ahhh what the hell i am doing wrong.
The 3rd iteration of x1 should be 1.175, not 0.815; correct me if I'm wrong.
Yes, it's 1.175
omg i was so confused!!!
You're right
Definitely true !
ok that 's good to know, i almost want to throw my sci cal due to the confusion on the vid
Really good tutorial taught me what my lecturer couldnt
If only our teacher explained it to us this way.... Thanks, you saved me.
2021 still valuable thx :D . It even reminded me of those old good times of windows 7
I must commend your ability to ignore the blinking icon in the taskbar, haha. Thanks for the explanation.
Always appreciate all your help and support ❤️, thanks
Saving me,8 years later
Oh boy, you just saved my MatLab homework!
simple and clean. Thank you
i would state a mistake :) x1 second iteration
where :-
(12+( -3.15) -2(1.5) ) /5 - is not equal 0.815 - its 1.175 *
9 years later, still saving lives!
thank you. this was so much easier to understand than the way my professor explained it.
when you post this i was in the 8 class and now I'm in the 3 stage in uni wow
I love how easy you made it for us thank you sir!
Thanks for explaining this! I am in health data science masters and have to write a python fx for this. I was freaking out after doing some reading trying to understand what I was doing
simple and best explanation
Thanks for lucid explanation... You saved my day! And I assume that we need to iterate unless we get correct approximations where further approximation is not possible...
Thanks and subscribed 😇
This is realy helpful. Recieve my thanks oh sir.
Excellent explanation. Thank you
6years and still saving lives
Thank you very much, I'm having a test in the next 2 days, I hope this will help me very much :)
+Gregg Waterman can you make a video on successive over-relaxation method?
the answer after rounding off is x1=1,x2=-3,x3=2
great video, love how you explain it
this man is **ing great
Thanks! Very clearly put.
Thank you for your education !
Thanks so much for making this video.
Keep up the good work
Thankx for that, but I have noted the value for x1 =1.175
very well done, thank you so much Sir !!
merci infiniment
Hi,
How do you calculate the errors like a relative error, absolute error and residual error for this example?
Thank you
Hi Gregg, do you not subtract the old x1 from the new x1 then divide all by the new x1 and multiply by 100 (like Gauss Seigal method) to get the iteration %
Thank you for this video
10 years later..watching it
It was really helpful, thanks!
Hie Gregg, say we do not know the exact solution, How do we know if we have obtained the right value for either X1 , X2 OR X3. Also when we get the value for X1 , does that mean all the other values are now correct?
The iterations should start at zero since it's initial instead of starting at 1 when we look at the table right? We are assuming the initial guess is zero not the guess at iteration 1.
Thank you Sir 🙏
god bless you prof
That thing on the taskbar flickering all throughout the video made me sick.
thanks for sharing bro
compare this explanation with the one from the textbook, day vs night
so, once you have reached the correct values for all 3 variables, the iterations beyond that will continue to give the same values over and over? I am assuming thats when you know you are right, right?
Very clear but I just wanted to ask, at what point do we stop iterating?
Usually it's good to have around 10 iterations and by then yiu usually have an idea of the number the devimal places are trying to reach to.
such a life saver!!!
How do you know when to stop the iterations? Are you provided with the solutions at the start? Or is there going to be a consistency in results at a point to tell that we're at the solutions?
have you got an answer ? because that was also my exactquestion :)
Your solutions are going to start converging after n iterations, or sometimes question would state number of iterations to be used. First check for convergence criteria in system of linear equation, hope this helps ;)
There is a mistake in the result of first value in third column
When computing x1 in the third iteration I get 1.175.
Thank you Sir!
how we use zero approximation =0 and use the dependence values on it why we do not take zero approximation equall to 1 or 2 or 3 or any thing and depend on the values depend on them?
when do we stop iterating?
How do we confirm that we have reached the solution point and we don't need further iterations? does it relate to the difference b/w values obtained from subsequent iterations?
Using convergence criteria u can answer iy
How can find absolute error for each iteration in jacobi method
thanks. this helped a lot
how it will work if i have 6x6
فلتحظك الالهه
حفظك الاله امون
Perfect 5star💥
but when do we stop the iterations???
when you can see that numbers dont change much :) it means that you have mistaken possibly little.
After 8 iterations
My answer came out
X1=1
X2=3
X3=2
What is the difference between Gauss- Seidel method and Jacobi method?
A bit late, but... with Jacobi you calculate values for each of the variables using all three previous values, then "update" them all at once. With Gauss-Seidel you keep updating each variable as you go. This is why you usually get faster convergence with Gauss-Seidel.
Why would you ever use jacobi instead of gauss siedel?
+Chrispollis When a test question forces you to use it
+Chrispollis i'm interested in this as well,good question
Very good question whose answer I do not know! As a teacher, I would say that learning the Jacobi method might make learning Gauss-Seidel a tiny bit easier to learn!
just because it might be asked in the exam to solve the question from Jaobi's method :3 :v
A situation where you would use Jacobi over Gauss-Seidel is when you have a large system of linear equations and within each iteration you want to compute x1, x2, ..., xn in parallel. You can do that with Jacobi but not with Gauss-Seidel since x1, ..., xn has to be computed sequentially as each result depends on values from the previous x.
This is lit sir👌
Thank you!
Is the Gauss-Seidel method
3rd Iteration x1 and x3 are wrong
x1 should be 47/40
x3 should be 269/160
Thank you Sir
Where did you get "The actual solution of the system of equation ...1,-3,2" ????
They converge to those numbers. By doing more iterations, they approach that solution.
Do you study those in collage ?
8 years after...
Wow. I have a Math Method named after me, neat.
do you have an email that i can ask you questions on?
Yeh gauss Seidel method hai
i love you !!!!!!!
thanx sir
Is there any limit for Jacobi method? I use Jacobi method, but cannot solve this linear system. 2x - 6y + z = 11; -5x + y -2z = -12; x + 2y + 73z = 20.
the Jacobi method answer is 0.7, -2.4, 0. However, the actually answer is 2, -1, 0
@@inayatullah2739 diagonally dominant is for Gauss-Seidel Method
Thx 😊
x1=1.175
not 0.815
sahit 😀😀😀😀
He sounds like Bill Nye.
Am l the only one getting 1.175 instead of 0.815?
osm very easy
IT DOESNT ADD UP!
Nice
My test is in an hour
Steve Kerr, is that you?
No, it's Greg Popovitch! :-)
They made a method based on me
same
❤️❤️❤️❤️
my name is jacobi
not me in 2021
My name is Jacobi wtf