A Chebyshev Polynomial Interval-Searchin
โ
John P. Boyd
๐
Article
๐
1995
๐
Elsevier Science
๐
English
โ 362 KB
To search a given real interval for roots, our algorithm is to replace \(f(\lambda)\) by \(f_{N}(\lambda)\), its \(N\)-term Chebyshev expansion on the search interval \(\lambda \in\left[\lambda_{\min }, \lambda_{\max }\right]\), and compute the roots of this proxy. This strategy is efficient if and