A constructive algorithm for finding the exact roots of polynomials with computable real coefficients

Author： Lester D.   Chambers S.   Lu H.L.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.279, Iss.1, 2002-05, pp. : 51-64

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

An Iterated Eigenvalue Algorithm for Approximating Roots of Univariate Polynomials

By Fortune S.  

Journal of Symbolic Computation, Vol. 33, Iss. 5, 2002-05 ,pp. : 627-646

Academic Press

Access to resources Recommend Favorite

Constructive mathematics: a foundation for computable analysis

By Bridges D.S.  

Theoretical Computer Science, Vol. 219, Iss. 1, 1999-05 ,pp. : 95-109

Elsevier

Access to resources Recommend Favorite

Recent Advances on Determining the Number of Real Roots of Parametric Polynomials

By Yang L.  

Journal of Symbolic Computation, Vol. 28, Iss. 1, 1999-07 ,pp. : 225-242

Academic Press

Access to resources Recommend Favorite

On a method for finding the roots of an ideal

By Mesyanzhin A.  

Programming and Computer Software, Vol. 31, Iss. 2, 2005-03 ,pp. : 97-102

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Effectively closed sets and graphs of computable real functions

By Cenzer D.   Remmel J.B.  

Theoretical Computer Science, Vol. 284, Iss. 2, 2002-07 ,pp. : 279-318

Elsevier

Access to resources Recommend Favorite