BCR: A Simple and Efficient Method of Unidimensional Search by EliminationBarcellos JCH*, Cipparone FAM and Ranzini E
PCS, Polytechnic School of USP, Brazil
- *Corresponding Author:
- Barcellos JCH
PCS, Polytechnic School of USP
E-mail: [email protected]
Received date: August 03, 2015; Accepted date: August 20, 2015; Published date: August 25, 2015
Citation:Barcellos JCH, Cipparone FAM, Ranzini E (2015) BCR: A Simple and Efficient Method of Unidimensional Search by Elimination. J Appl Computat Math 4:244. doi:10.4172/2168-9679.1000244
Copyright: ©2015 Barcellos JCH, et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
The algorithm proposed in this paper belongs to the methodological category of unidimensional search by elimination, and may be used, therefore, in the optimization of discontinuous functions. This new method is based on the dichotomous search algorithm and is, in many cases, superior to Fibonacci’s algorithm (up to the present considered the most efficient method of elimination), with the advantage of being much simpler.