In numerical analysis, the secant method is a root-finding algorithm that uses a succession of roots of secant lines to better approximate a root of a function f. The secant method can be thought of as a finite-difference approximation of Newton's method. See for the details: http://mathworld.wolfram.com/SecantMethod.html
Enter left point of interval 2
Enter right point of interval 3
Enter the error 0.001
The root is 2.707 >>
Manotosh Mandal (2020). Secant method (https://www.mathworks.com/matlabcentral/fileexchange/72481-secant-method), MATLAB Central File Exchange. Retrieved .
Method details with example.
Matlab code for secant method with example.