Це відео не доступне.
Перепрошуємо.
Fibonacci Search Method
Вставка
- Опубліковано 8 сер 2024
- For the book, you may refer: amzn.to/3aT4ino
This video will explain to you the easiest method for solving the unconstrained optimization problems using Fibonacci Search Method.
Golden Section Search: • Golden Section Search ...
Hookes Jeeves Pattern Search Method: • Hookes Jeeves Pattern ...
Matlab Code of this lecture (Fibonacci Search method)
ua-cam.com/video/GAePSfF0dZI/v-deo.html
best video, helping me so much with studying for my exams - thank you!
Wow what an amazing way you explain this method,GOD BLESS YOU
This is really clear, especially for those good examples, it helps me better understand how to use this algorithm to solve out the real problem. Before watching this video, the textbooks only show the proof of how this algorithm without any explanation, I feel quite confused about some points. But now, your video really helps me better understand how this algorithm works.
My pleasure... Keep watching
As fn-k/fn-k+1 value changing
X1 or x2 both value will change as k value changing
Thank you so much sir 🙏
Thank you sir...!!!
most organized lecture.
Most welcome... Keep watching and sharing... Thanks
Correction: I'm not sure, but in (16:45) when you preserve the left value, the new x2 should be the previous x1 - you made it the other way round. Let me know whether it's true, thank you.
Good luck and thank you! :)
See the quadratic form lecture... New lecture uploaded
ua-cam.com/video/6jjTLDX_JOk/v-deo.html
Thank you air Sir
Dasgupta, C. H. Papadimitriou, and U. V. Vazirani
Quadratic interpolation method vedio
equation 4 in 16:48 is wrong i think so since x2 their will be 0.6 and x1 will be 0.6 if i am wrong please correct me
correct
Which book to follow for these topics. Please reply sir
No book follows..... just share my knowledge
umm, how is L -5+15? L is length right? Shouldn't it be 15-(-5)?
Na they are points don't take it as a length
The best teaching.👏👏🙇♀️🙏
Many thanks
16:55 but sir if we had preserved R value our x* would be 0.9 and f(x*)=-.54
Well explained sir 👍
See the quadratic form lecture... New lecture uploaded
ua-cam.com/video/6jjTLDX_JOk/v-deo.html
Thank You!
You're welcome!
May I know which reference book dr used for this video?
ALGORITHMS by - Dasgupta, C. H. Papadimitriou, and U. V. Vazirani
Thank you very very very much
You are most welcome
good method
See the quadratic form lecture... New lecture uploaded
ua-cam.com/video/6jjTLDX_JOk/v-deo.html
Ye method khin bhi nhi hai and aapke method se answer bhi nhi aare
thank you
My pleasure.
amazing tutorial sir
Many thanks... Keep watching other lectures also..
Sir how can we know the value of k
No need to know value of k... K start from 0 to n.
How to choose n?
n is given value
It was told in tutorial that x2= fn-2/fn, so it should be f5/f7, but we have taken f6/f7, why sir? ( In example 1). Thanks
Yes... In that case x2= R- (Fn-2/Fn)(R-L)... Here in example 1, (for easy calculation), we compute x2 =L+(Fn-1/Fn)(R-L)... So Both are same
Can we continue the same process by taking f5/f7
How in 1 example 2 step 8/13 came
1st you have to subtract 21-13 then 8 comes in numerator and denominator is similar to the previous numerator
sir why you are using the formula of x1 for finding x2.
Because x1 and x2 are equidistant from end points. So to make calculation easier and easy to remember... I prefer this method (shortcut )
See the quadratic form lecture... New lecture uploaded
ua-cam.com/video/6jjTLDX_JOk/v-deo.html
Is it used in optimisation?
Yes, exactly
See the quadratic form lecture... New lecture uploaded
ua-cam.com/video/6jjTLDX_JOk/v-deo.html
How to choose n in the first example??
In the first example, n is already given to you in the statement as Perform 7 iteration. I.e. n=7.
In second example, use Ln/L0=1/Fn formula to calculate "n".
Hope it clear
It was told in tutorial that x2= fn-2/fn, so it should be f5/f7, but we have taken f6/f7, why sir? ( In example 1). Thanks
poor teaching