Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding


Robust polynomial rootfinders can be exploited to compute the roots on a real interval of a nonpolynomial function f(x) by the following: (i) expand f as a Chebyshev polynomial series, (ii) convert to a polynomial in ordinary, series-of-powers form, and (iii) apply the polynomial rootfinder. (Complex-valued roots and real roots outside the target interval… (More)
DOI: 10.1137/S0036142901398325


6 Figures and Tables