Publisher
Springer International Publishing
Reference57 articles.
1. Abbott, J.: Quadratic interval refinement for real roots. ACM Commun. Comput. Algebra 48(1/2), 3–12 (2014). https://doi.org/10.1145/2644288.2644291 . http://doi.acm.org/10.1145/2644288.2644291
2. Agrawal, A., Requicha, A.: A paradigm for the robust design of algorithms for geometric modeling. In: Computer Graphics Forum, vol. 13, no. 3, pp. 33–44 (1994). 15th Annual Conference and Exhibition. EUROGRAPHICS 1994
3. Becker, R.: The Bolzano method to isolate the real roots of a bitstream polynomial. Bachelor thesis, University of Saarland, Saarbruecken, Germany, May 2012
4. Becker, R., Sagraloff, M., Sharma, V., Xu, J., Yap, C.: Complexity analysis of root clustering for a complex polynomial. In: 41st International Symposium on Symbolic and Algebraic Computation, iSSAC 2016, Wilfrid Laurier University, Waterloo, Canada, 20–22 July, pp. 71–78 (2016)
5. Becker, R., Sagraloff, M., Sharma, V., Yap, C.: A near-optimal subdivision algorithm for complex root isolation based on Pellet test and Newton iteration. J. Symbolic Comput. 86, 51–96 (2018)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献