Implement the golden section search or ternary search algorithm. Using any programming language create a function that takes following paramters:

$-$a black$-$box function f $($assuming that it's strictly decreasing and then strictly increasing$)$ taking $1-$dim argument, use X$^2$ as an example;

$-$Two floating point values: Ib for lower bound of desired point of minimum and ub for upper bound;

$-$the allowed absolute error for returned value and returns the function argument value at which the the function takes the minimum value in accordance with precision required.