File Exchange

image thumbnail

ExhaustiveSearch(a,​b,n,fun)

version 1.0.0.0 (1.01 KB) by mec
Exhaustive search is a bracketing method. It is generally used to reduce the search domain.

4 Downloads

Updated 25 Sep 2015

View License

In the exhaustive search method, the optimum of a Uni-modal function is bracketed by calculating the function values at a number of equally spaced points.The algorithm generally starts its search from the lower bound towards the upper bound. Three consecutive function values are compared.The outcome of comparison will decide whether the search will terminate or continue by replacing one of the three points by a new point.

Cite As

mec (2020). ExhaustiveSearch(a,b,n,fun) (https://www.mathworks.com/matlabcentral/fileexchange/53231-exhaustivesearch-a-b-n-fun), MATLAB Central File Exchange. Retrieved .

Comments and Ratings (0)

Updates

1.0.0.0

figure update

1.0.0.0

Figure updated.

MATLAB Release Compatibility
Created with R2012b
Compatible with any release
Platform Compatibility
Windows macOS Linux
Tags Add Tags