- A Comparison of Various Methods for Computing Bounds for Positive Roots of Polynomials
- Nonlinear Analysis: Modelling and Control, 2005, Vol. 10, No. 4, 297304 A Comparative Study of Two Real Root Isolation
- Syst`emes polynomiaux : que signifie (( resoudre )) ? Universite Lille 1
- Nonlinear Analysis: Modelling and Control, 2008, Vol. 13, No. 3, 265279 Improving the Performance of the Continued Fractions
- On the Various Bisection Methods Derived from Vincent's Alkiviadis G. Akritas, Adam W. Strzebonski and Panagiotis S. Vigklas
- U S I N G M A T H E M A T I C A T O I L L U S T R A T E T H E R A C E T R A C K P R I N C I P L E I N C A L C U L U S Using Mathematica to Illustrate the
- Vincent's Theorem from a modern point of view Alberto Alesina -Massimo Galuzzi
- Computing 38, 369-=-372 (1987) Computing 9 by Springer-Verlag1987
- International Journal of Computer and Information Sciences, Vol. 12, No. 4, 1983 Computationally Efficient Algorithms
- There is no "Uspensky's method" Alkiviadis G. Akritas
- Advances on the Continued Fractions Method Using Better Estimations of Positive Root
- A new Look at one of the Bisection Methods Derived from Vincent's Theorem
- L'Enseignement Mathmatique Alesina, Alberto / Galuzzi, Massimo
- 448 Correspondence that Wells ever gave much attention to statistics, much less
- Nonlinear Analysis: Modelling and Control, 2006, Vol. 11, No. 2, 123136 The SVD-Fundamental Theorem of Linear Algebra
- Computing 24, 299--313 (1980) Computing 9 bySpringer-Verlag1980
- Nikola Obreschkoff's contribution to the problem of isolating real roots of polynomials with continued fractions
- Almost Tight Recursion Tree Bounds for the Descartes Method
- An Introduction to Wavelet Transforms and Data Compression Using Mathematica. Alkiviadis G. Akritas
- Bull. Math. Soc. Sci. Math. Roumanie Tome 53(101) No. 3, 2010, 201211
- Complexity of Real Root Isolation Using Continued Vikram Sharma
- Implementation of Real Root Isolation Algorithms in Mathematica
- Linear and Quadratic Complexity Bounds on the Values of the Positive Roots of Polynomials
- Vincent's Theorem of 1836: Overview and Recent Developments1
- Digital Object Identifier (DOI) 10.1007/s00607-006-0186-y Computing 78, 355367 (2006)
- Polynomial Real Root Isolation Using Descarte's Rule of Signs * George E. Collins
- A New Method for Polynomial Real Root Isolation
- contributions A SHORT NOTE ON A NKWMETHOD
- INFORMATION PRCCESSING LETTERS 20 November 1979 ON THE SOLUTION OF POLYNOMIAL EQUATIONS USING CONTINUED FRACTIONS
- Numer. Math. 36, 53-62 (1980) Numerische 9 by Springer-Verlag1980
- ON THE BUDAN-FOURIER CONTROVERSY in 1796, 1797, and in 1803. Alkiviadis G. Akritas
- Various Proofs of Sylvester's (Determinant) Identity IMACS Symposium SC1993
- Floating-Point Arithmetic Precision and Accuracy
- Reliable Computing 1 (4) (1995), pp. 375-381 Matrix computation of
- On Some Applications of the (Fast) Discrete
- Computation of the Adjoint Matrix Alkiviadis Akritas1
- Solving the Heat and Wave Equations with
- Vincent's theorem of 1836 and real root isolation The two bisection methods derived from Vincent's theorem
- Journal of Mathematical Sciences, Vol. 168, No. 3, 2010 VINCENT'S THEOREM OF 1836: OVERVIEW AND FUTURE RESEARCH
- pologistik lgbra m to Mathematica
- Note on Vincent's Theorem A. M. Ostrowski
- Complexity Analysis of Algorithms in Algebraic Computation
- Computations in Modules over Commutative Domains Alkiviadis G. Akritas
- Univariate Polynomial Real Root Isolation: Continued Fractions Revisited
- Journal of Symbolic Computation 41 (2006) 4966 www.elsevier.com/locate/jsc
- Vincent's Theorem of 1836: Overview and Future Research1
- Serdica J. Computing 2 (2008), 145162 FLQ, THE FASTEST QUADRATIC COMPLEXITY BOUND
- UNIVERSITY OF THESSALY SCHOOL OF ENGINEERING
- 3rd Conference on Informatics in 08-09 2011
