question: this method attempts to find two values a and b satisfying lowerbound f a f b if f is continuous on a , b , this means that a and b bracket a root of f . the algorithm starts by setting a : = initial -1 ; b : = initial +1 , examines the value of the function at a and b and keeps moving the endpoints out by one unit each time through a loop that terminates when one of the following happens : f a f b -- success ! a = lower and b = upper -- convergenceexception integer.max _ value iterations elapse -- convergenceexception note : this method can take integer.max _ value iterations to throw a convergenceexception . unless you are confident that there is a root between lowerbound and upperbound near initial , it is better to use #bracket univariaterealfunction , double , double , double , int , explicitly specifying the maximum number of iterations . concode_field_sep UnivariateRealSolverFactory factory concode_field_sep double solve concode_elem_sep double solve concode_elem_sep double midpoint concode_elem_sep void setup
target: double [ ] function ( UnivariateRealFunction arg0 , double arg1 , double arg2 , double arg3 ) { return bracket ( arg0 , arg1 , arg2 , arg3 , Integer . MAX_VALUE ) ; }