Computing Real Roots of Real Polynomials ... and now For Real!
暂无分享,去创建一个
Fabrice Rouillier | Michael Sagraloff | Alexander Kobel | F. Rouillier | Michael Sagraloff | Alexander Kobel
[1] Arno Eigenwillig,et al. Real root isolation for exact and approximate polynomials using Descartes' rule of signs , 2008 .
[2] Kurt Mehlhorn,et al. A Deterministic Descartes Algorithm for Real Polynomials , 2008 .
[3] N. Obreshkov. Zeros of polynomials , 2003 .
[4] Kurt Mehlhorn,et al. Computing real roots of real polynomials , 2013, J. Symb. Comput..
[5] Kurt Mehlhorn,et al. A Descartes Algorithm for Polynomials with Bit-Stream Coefficients , 2005, CASC.
[6] Alkiviadis G. Akritas,et al. Polynomial real root isolation using Descarte's rule of signs , 1976, SYMSAC '76.
[7] References , 1971 .
[8] Michael Sagraloff,et al. On the complexity of computing with planar algebraic curves , 2014, J. Complex..
[9] A. Rényi,et al. On the zeros of polynomials , 1952 .
[10] P. Zimmermann,et al. Efficient isolation of polynomial's real roots , 2004 .
[11] Michael Sagraloff,et al. On the complexity of the Descartes method when using approximate arithmetic , 2014, J. Symb. Comput..
[12] Elias P. Tsigaridas,et al. Improved bounds for the CF algorithm , 2013, Theor. Comput. Sci..
[13] Kurt Mehlhorn,et al. From approximate factorization to root isolation with application to cylindrical algebraic decomposition , 2013, J. Symb. Comput..
[14] Chee-Keng Yap,et al. Almost tight recursion tree bounds for the Descartes method , 2006, ISSAC '06.
[15] Chee-Keng Yap,et al. A simple but exact and efficient algorithm for complex root isolation , 2011, ISSAC '11.
[16] Kurt Mehlhorn,et al. A deterministic algorithm for isolating real roots of a real polynomial , 2011, J. Symb. Comput..
[17] C. Yap,et al. Amortized Bound for Root Isolation via Sturm Sequences , 2007 .
[18] Michael Sagraloff,et al. When Newton meets Descartes: a simple and fast algorithm to isolate the real roots of a polynomial , 2011, ISSAC.
[19] Jeremy R. Johnson,et al. Polynomial real root isolation using approximate arithmetic , 1997, ISSAC.
[20] Fabrice Rouillier,et al. Motivations for an Arbitrary Precision Interval Arithmetic and the MPFI Library , 2005, Reliab. Comput..
[21] Victor Y. Pan,et al. Univariate Polynomials: Nearly Optimal Algorithms for Numerical Factorization and Root-finding , 2002, J. Symb. Comput..
[22] Victor Y. Pan,et al. Algebraic Algorithms , 1999, Computing Handbook, 3rd ed..
[23] George E. Collins. Continued fraction real root isolation using the Hong root bound , 2016, J. Symb. Comput..