Computation of Approximate Polynomial GCDs and an Extension

ISSN： 0890-5401

Source： Information and Computation, Vol.167, Iss.2, 2001-06, pp. : 71-85

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

Computation of the Galois group of a polynomial with rational coefficients. I

By Durov N.

Journal of Mathematical Sciences, Vol. 134, Iss. 6, 2006-05 ,pp. : 2511-2548

Springer Publishing Company

Access to resources Recommend Favorite

An extension of the Krylov method for calculating the coefficients of the minimal polynomial

By Ermakov S. Vidyaeva K.

Computational Mathematics and Mathematical Physics, Vol. 53, Iss. 5, 2013-05 ,pp. : 521-529

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Sorting-based localization and stable computation of zeros of a polynomial. I

By Romm Ya.

Cybernetics and Systems Analysis, Vol. 43, Iss. 1, 2007-01 ,pp. : 139-154

Springer Publishing Company

Access to resources Recommend Favorite

Sorting-based localization and stable computation of zeros of a polynomial. II

By Romm Ya.

Cybernetics and Systems Analysis, Vol. 43, Iss. 2, 2007-03 ,pp. : 291-302

Springer Publishing Company

Access to resources Recommend Favorite

Polynomial-Time Computation of the Degree of a Dominant Morphism in Characteristic Zero. I

By Chistov A.

Journal of Mathematical Sciences, Vol. 131, Iss. 2, 2005-11 ,pp. : 5547-5568

Springer Publishing Company

Access to resources Recommend Favorite