John P. Boyd. (2002). Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding: Computing zeros on a real interval through Chebyshev expansion and polynomial rootfinding. SIAM Journal on Numerical Analysis, 40, 1666-1682. https://doi.org/10.1137/s0036142901398325
ISO-690 (author-date, English)JOHN P. BOYD, 2002. Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding: Computing zeros on a real interval through Chebyshev expansion and polynomial rootfinding. SIAM Journal on Numerical Analysis. 1 January 2002. Vol. 40, , p. 1666-1682. DOI 10.1137/s0036142901398325.
Modern Language Association 9th editionJohn P. Boyd. “Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding: Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding”. SIAM Journal on Numerical Analysis, vol. 40, Jan. 2002, pp. 1666-82, https://doi.org/10.1137/s0036142901398325.
Mohr Siebeck - Recht (Deutsch - Österreich)John P. Boyd: Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding: Computing zeros on a real interval through Chebyshev expansion and polynomial rootfinding, SIAM Journal on Numerical Analysis 2002, 1666-1682.
Emerald - HarvardJohn P. Boyd. (2002), “Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding: Computing zeros on a real interval through Chebyshev expansion and polynomial rootfinding”, SIAM Journal on Numerical Analysis, Vol. 40, pp. 1666-1682.