If you get benefit from these videos then please share it with your friends, students, and people who need, so that they can also get benefit. Thank you. Have a wonderful day.
Я не иронично заявляю - индийцы сверхраса. В моменты отчаяния всегда найдется какой-нибудь индус, который объяснит и покажет, как решить вашу проблему лучше всех тех, кто делает то же самое в моем русскоязычном сегменте TH-cam. БРАВО! I do not ironically declare - the Indians are a super race. In moments of desperation, there will always be some Indian who will explain and show you how to solve your problem better than all those who do the same in my Russian-language TH-cam segment. BRAVO!
good job , even though i'm studying this in french but it's cristal clear for me now , ty sir , shout out to indian guys traching us better than our teachers
Wouldn't it be easier to use dX= x(k+1) -x(k) and just rearranging the equation to J(X(k)).dX= - F(x(k)) and then using substitution and gaussian elimination we can directly find X(k+1) instead of finding an inverse which can be very lengthy and complex on larger matrices or with more unknowns.
If the initial approximation is not given then check the question if there is any hint regarding that. If no information is given then you have to assume yourself.
My professor gets paid six figures to teach this and still can’t give a decent explanation. In 8 minutes you simplified what he couldn’t within a 50 minute lecture. I really wish some of that money would go to independent TH-cam educators as opposed to tenured, elderly and entitled curmudgeons who teach at my college since TH-cam is the reason I’m passing my classes. All in all, thank you kindly for the explanation.
If you get benefit from these videos then please share it with your friends, students, and people who need, so that they can also get benefit. Thank you. Have a wonderful day.
I have general question- how to guarantee the initial guess you took converges? Do we take it random hit and trial? One condition for sure to satisfy is jacobin shouldn’t be zero but still all guess doesn’t converge. Do you know something like what is radius of convergence? I would really appreciate
It always converges at some point (can be infinite number of iterations for a very very bad guess). Better the guess, lesser number of iterations it takes to converge.
Yes, the computation is rigid for hand calculation. Also, other methods are there. But this is little faster. Up to 3 by 3 matrix it's manageable by calculators.
Newton Raphsion method (Newton's method) works nicely if the initial approximation is nearer to the exact value. But if we don't know the initial approximation, then we may assume such approximations which can nearly satisfy the equations. Also, we may use incremental search technique to get the initial approximation.
If you get benefit from these videos then please share it with your friends, students, and people who need, so that they can also get benefit. Thank you. Have a wonderful day.
Na ho to apne se choose karna hai. X ka value 0, 1, 2, ... Dal k function value check karo. Jahan function ka opposite value aaye, rukjao. Aur last two x values k beech me se koi v ek x value leke start karo.
There may be other rules but this is Newton's Method (Newton-Raphson method). You please see the video repeatedly, I believe you can definitely get it.
The fact the a guy teaching maths in India can help me sitting here in Ireland is just bloody amazing. Thank you sir. Much appreciated.
Thank you so much for your nice words.
If you get benefit from these videos then please share it with your friends, students, and people who need, so that they can also get benefit. Thank you. Have a wonderful day.
Я не иронично заявляю - индийцы сверхраса. В моменты отчаяния всегда найдется какой-нибудь индус, который объяснит и покажет, как решить вашу проблему лучше всех тех, кто делает то же самое в моем русскоязычном сегменте TH-cam. БРАВО!
I do not ironically declare - the Indians are a super race. In moments of desperation, there will always be some Indian who will explain and show you how to solve your problem better than all those who do the same in my Russian-language TH-cam segment. BRAVO!
good job , even though i'm studying this in french but it's cristal clear for me now , ty sir , shout out to indian guys traching us better than our teachers
I swear it is the best video on this topic with example the concept got crystal clear
Thanks I will program this example first to solve my problem! Very clear explanation!!
Outstanding sir ji....take love...❤❤❤
Very nice 👍. Please tell me what is the criteria for choosing initial approximation
sir u will crush everone in coming days
Wouldn't it be easier to use dX= x(k+1) -x(k) and just rearranging the equation to J(X(k)).dX= - F(x(k)) and then using substitution and gaussian elimination we can directly find X(k+1) instead of finding an inverse which can be very lengthy and complex on larger matrices or with more unknowns.
This video was so helpful. Thank you sir.
How we should take initial approximation if values did not mention in question ?
I also have same question
If the initial approximation is not given then check the question if there is any hint regarding that. If no information is given then you have to assume yourself.
Can you please help me solve the solution to the multilateration problem
thank you for this clear explanation.
My professor gets paid six figures to teach this and still can’t give a decent explanation. In 8 minutes you simplified what he couldn’t within a 50 minute lecture. I really wish some of that money would go to independent TH-cam educators as opposed to tenured, elderly and entitled curmudgeons who teach at my college since TH-cam is the reason I’m passing my classes. All in all, thank you kindly for the explanation.
crystal clear explanation
If you get benefit from these videos then please share it with your friends, students, and people who need, so that they can also get benefit. Thank you. Have a wonderful day.
Nice and helpful video but Please use bigger board so you don't have to rub the previous work.
Thank you so much for your nice suggestions. Actually, I am working on that to fix the problem.
Youre really good.
Thank u so much.
Sir j-1k will be always one for all values of k, so equation becomes easier
what is and how we get initial guess or approximation
Thank you so much, but I have a question. What do we have to do if the delta of the Jacobian matrix is zero?
Can you please mention what is delta in your query?
@@SukantaNayakedu I think he means the determinant. What happens if the determinant is 0? Then, when calculating J_k^-1, you'll end up dividing by 0.
@@gamerdio2503 then u have to change your initial assumed numbers of x and y
best teacher
awesome lacture sir😘
greate job sir,,,,,,,,
I have general question- how to guarantee the initial guess you took converges? Do we take it random hit and trial? One condition for sure to satisfy is jacobin shouldn’t be zero but still all guess doesn’t converge. Do you know something like what is radius of convergence? I would really appreciate
It always converges at some point (can be infinite number of iterations for a very very bad guess). Better the guess, lesser number of iterations it takes to converge.
A big thank you from Romania ^_^
Sir we have to find J inverse again n again and it takes lot of time so can u have some short tricks so that we can find this
General form of J inverse need not be find again and again. Only we to compute for different X vectors. By computer program easily can be done.
Yes, the computation is rigid for hand calculation. Also, other methods are there. But this is little faster. Up to 3 by 3 matrix it's manageable by calculators.
What is the method for guessing initial point if not already given in problem?
Initial approximation kaise nikala jata h na diya ho to
Newton Raphsion method (Newton's method) works nicely if the initial approximation is nearer to the exact value. But if we don't know the initial approximation, then we may assume such approximations which can nearly satisfy the equations. Also, we may use incremental search technique to get the initial approximation.
Sir normally how many iterations are we required to perform in this method to achieve the required solution
as much would be required in the question.
Sir how to take x0,y0 if not given
Ideally choose any vector near the exact vector.
Sir
Do you have
Any videos regarding electrical engineering
Psa,psoc,hvdc transmission
Important video
No, I don't have.
which equations cannot solve through Newton
Raphson Method with reasons plz.
I think every equation (which is solvable) can be solved with the NR method, as long as you choose a good starting point.
How to get that initial approximations..?
It will be given in the question...!
Sir what if we take f(xy) and g(xy) just opposite of what u have taken
good work sir
If you get benefit from these videos then please share it with your friends, students, and people who need, so that they can also get benefit. Thank you. Have a wonderful day.
Awesome
Sir if initial approximations na ho toh?matlab set of nonlinear equations ko kaise solve karna hai!!
Na ho to apne se choose karna hai. X ka value 0, 1, 2, ... Dal k function value check karo. Jahan function ka opposite value aaye, rukjao. Aur last two x values k beech me se koi v ek x value leke start karo.
Sir kya aap contact number de skte he!
Sir actually I am a PhD student. So but doubts hai.so
You can contact me with E-mail.
Thank u sir.
what will happen if the jacobian matrix is not square?
It should be square otherwise you can't find.
Sir if intial value is not given then what should we apply sir
You get the initial value by hit and trial method.
you are live saver .
Very good
Masterpiece
Sir normally how many iterations are we required to perform in this method to achieve the required solution ?
It depends on the problem and the tolerance value considered.
@@SukantaNayakedu thank you sir
Can we solve this question by Taylor series method
thank you for everything
Can you tell how to Find approximate
????
Initial aproximation will be given ok
Please how do I get the first roots?
God bless you😊😊
Thank you.
Nice vidio
Thank you.
Can i make the same steps but by using one equation and not one
Yes can try.
Congratulations for the great lecture sir! Regards from Brazil
Thank u sir ❤️
Very useful video.
Thank you for your comments.
if x, y, z,then?
Then J_k will be a 3×3 matrix. Accordingly, the expression will come with respect to x, y and z.
@@SukantaNayakedu Thank you sir!!!
how to take initial roots?
Take (1, 1)
Board clear nhi hai , plz camera ki quality badhao.
Thank you very much for your comments and suggestions. I am working on it.
function value is wrong not negative sign with -3.75 and -5.50 ok right value is 3.75 and 5.50
na sai kala palikari!
Sorry sir
I am not gating you.
Please solve it other rules
If you have
There may be other rules but this is Newton's Method (Newton-Raphson method). You please see the video repeatedly, I believe you can definitely get it.
Solution is wrong
तमीज से समझा दे करो इतना बकवास बताया
Sir what to do if initial approximation has not been given in a question?
Use nonnegativity condition and accordingly choose initial point.