Research Article

Multipoint Iterative Methods for Finding All the Simple Zeros in an Interval

Algorithm 1

Clear[Global`*]
f[x_]:= ChebyshevT[20, x]    ChebyshevU[40, x] + Sin[x + 1]    11/10;
a = 1.; b = +1.;
p = Plot[f[x], {x, a, b}, Mesh  ->   0 , MeshFunctions  ->  (f[#] &),
PlotPoints  ->  1000, PerformanceGoal  ->  Quality,
WorkingPrecision  ->  128];