Implementations of a New Theorem for Computing Bounds for Positive Roots of Polynomials
暂无分享,去创建一个
[1] Doru Stefanescu,et al. New Bounds for Positive Roots of Polynomials , 2005, J. Univers. Comput. Sci..
[2] Alkiviadis G. Akritas,et al. A Comparison of Various Methods for Computing Bounds for Positive Roots of Polynomials , 2007, J. Univers. Comput. Sci..
[3] Alkiviadis G. Akritas,et al. A Comparative Study of Two Real Root Isolation Methods , 2005 .
[4] Maurice Mignotte,et al. Mathematics for computer algebra , 1991 .
[5] L. Zoretti. Sur la résolution des équations numériques , 1909 .
[6] N. Obreshkov. Verteilung und Berechnung der Nullstellen reeller Polynome , 1963 .
[7] Chee-Keng Yap,et al. Fundamental problems of algorithmic algebra , 1999 .
[8] Hoon Hong,et al. Bounds for Absolute Positiveness of Multivariate Polynomials , 1998, J. Symb. Comput..
[9] Alkiviadis G. Akritas,et al. The fastest exact algorithms for the isolation of the real roots of a polynomial equation , 1980, Computing.
[10] C. Rheinboldt. N. Obreschkoff, Verteilung und Berechnung der Nullstellen reeller Polynome. (Hochschulbücher für Mathematik, Band 55) VIII + 296 S. mit 2 Abb. Berlin 1963. Deutscher Verlag der Wissenschaften. Preis geb. DM 43,50 , 1966 .
[11] J B Kiostelikis,et al. Bounds for positive roots of polynomials , 1986 .