Description: Golden Section search algorithm used for cos (x), x ∈ [-π/2, π/2] the maximum specific procedure designed to enable dynamic demonstration searching process.
- [climb] - numerical algorithms : Algorithm of moun
- [paixu] - Using Java language to achieve a variety
- [zhanheduilie] - (1) the use of chain-store to achieve st
- [erfensousuo] - Using binary search algorithm for x = 2s
- [pashansousuo] - Climbing method with f (x, y) = 1/(x2+ Y
- [chazhisuanfa] - Known f (xn) = yn, n = 0,1,2, ..., N see
- [gold] - The realization of the machine through t
File list (Check if you may need any files):
Download