论文信息 - Efficient isolation of polynomial's real roots - 字舞流文

Efficient isolation of polynomial's real roots

P. Zimmermann | F. Rouillier

[1] W. Krandick. Trees and jumps and real roots , 2004 .

[2] George E. Collins,et al. Interval Arithmetic in Cylindrical Algebraic Decomposition , 2002, J. Symb. Comput..

[3] Steven Fortune,et al. An Iterated Eigenvalue Algorithm for Approximating Roots of Univariate Polynomials , 2002, J. Symb. Comput..

[4] Steven Fortune,et al. Polynomial root finding using iterated Eigenvalue computation , 2001, ISSAC '01.

[5] Fabrice Rouillier,et al. Well-defined semantics for floating-point computations: the MPFR library , 2000 .

[6] Joachim von zur Gathen,et al. Fast algorithms for Taylor shifts and certain difference equations , 1997, ISSAC.

[7] Jeremy R. Johnson,et al. Polynomial real root isolation using approximate arithmetic , 1997, ISSAC.

[8] Jeremy Johnson,et al. Algorithms for polynomial real root isolation , 1992 .

[9] George E. Collins,et al. Quantifier elimination and the sign variation method for real root isolation , 1989, ISSAC '89.

[10] Alkiviadis G. Akritas,et al. There is no “Uspensky's method.” , 1986, SYMSAC '86.

[11] Alkiviadis G. Akritas,et al. An implementation of Vincent's theorem , 1980 .

[12] Alkiviadis G. Akritas,et al. Polynomial real root isolation using Descarte's rule of signs , 1976, SYMSAC '76.

[13] T. A. Brown,et al. Theory of Equations. , 1950, The Mathematical Gazette.

[14] L. Zoretti. Sur la résolution des équations numériques , 1909 .