secant(f,x0,x1,tol)

SECANT METHOD

The Newton-Raphson algorithm requires the evaluation of two functions (the function and its derivative) per each iteration. If they are complicated expressions it will take considerable amount of effort to do hand calculations or large amount of CPU time for machine calculations. Hence it is desirable to have a method that converges
clear all
clc
tol=0.01;
x0=1;
x1=2;
x=-3:0.1:3;
y=x.^3-3*x+1;
f=@(x)x^3-3*x+1;
plot(x,y)
grid on
z =secant(f,x0,x1,tol);

ref: https://mat.iitm.ac.in/home/sryedida/public_html/caimna/transcendental/iteration%20methods/secant/secant.html