Newton's Method | Lecture 14 | Numerical Methods for Engineers

preview_player
Показать описание
Derivation of Newton's method for root finding.

Рекомендации по теме
Комментарии
Автор

This is an amazing explanation. I took a Numerical Analysis course a couple years ago where we used it, but this really helped me gain a much deeper understanding. Thanks!!

David-cxfc
Автор

Clear explanation and straight to point. Thank you!

python
Автор

Thanks for your good explanation.
I am a bit puzzled with the expression of f(x)=x^2-2. How did you get that?
I am wondering what if another value apart from sqrt of 2 is to be found, then that means we should also guess another expression of f(x) right?

willymuller
Автор

Is this the same as the Newton Raphson Iterativ System? Thanks

louis
Автор

such a nice explanation, thank you very much.

Arwaar
Автор

Prof you explain this very clear thank you SIR😊

blessingmutema
Автор

Hello, this video was really helpful, but I have one follow-up question. How do we determine the last iteration for a general case, or what conditions do we need a solution to satisfy in order to consider it as the most accurate?

natalijamarkovic
Автор

isn't there something wrong? aren't we supposed to substract aff xn then subtract f(x)/f'(x) ?

fireflylyrics
Автор

idk abt u guys but im droping 24/30 on this investigation

baxterkakulas
Автор

Is this the same as Newton-Raphson method

alimishina
Автор

Can you please explain the matter of selecting the right X0?
such that if a sufficient x0 is not selected the assumption of (x-x0)^2 < |x-x0| is not true. How should I determine if a correct X0 is selected?
I know the Burden book for Matlab coding gives an explanation of this by the Taylor polynomials series, yet it is not understandable.

elaheataei
Автор

how can use matlab to deal with the differential without using syms for usual case?

正淯羅
Автор

If you let f(x)=x - sqrt(2) you'll get a more accurate answer quickly (After the 1st iteration)

bonganimathebula