A complete algorithm to find exact minimal polynomial by approximations

Author： Qin Xiaolin   Feng Yong   Chen Jingwei   Zhang Jingzhong  

Publisher： Taylor & Francis Ltd

ISSN： 0020-7160

Source： International Journal of Computer Mathematics, Vol.89, Iss.17, 2012-11, pp. : 2333-2344

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

On the Best Polynomial Approximations of 2-Periodic Functions and Exact Values of n -Widths of Functional Classes in the Space L 2

By Vakarchuk S.B.  

Ukrainian Mathematical Journal, Vol. 54, Iss. 12, 2002-12 ,pp. : 1943-1957

Springer Publishing Company

Access to resources Recommend Favorite

Minimal Homogeneous Bases for Polynomial Ideals

By Yılmaz Erol  

Applicable Algebra in Engineering, Communication and Computing, Vol. 15, Iss. 3-4, 2004-11 ,pp. : 267-278

Springer Publishing Company

Access to resources Recommend Favorite

On the acceleration of an algorithm for polynomial factorization

By Malyshev A.  

Doklady Mathematics, Vol. 88, Iss. 2, 2013-09 ,pp. : 586-589

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Uniform polynomial approximations on convex domains in n

By Shirokov N.  

Journal of Mathematical Sciences, Vol. 141, Iss. 5, 2007-03 ,pp. : 1564-1572

Springer Publishing Company

Access to resources Recommend Favorite

Polynomial Approximations on Closed Subsets of Elliptic Curves

By Khaustov A.   Shirokov N.  

Journal of Mathematical Sciences, Vol. 129, Iss. 3, 2005-09 ,pp. : 3916-3921

Springer Publishing Company

Access to resources Recommend Favorite