Exact Bivariate Polynomial Factorization in Q by Approximation of Roots

Details Exact Bivariate Polynomial Factorization in Q by Approximation of Roots Exact Bivariate Polynomial Factorization in Q by Approximation of Roots

2010-08-21

arxiv.org/abs/1008.3596v1

Mathematics

Algebraic Geometry

Scientific paper

Factorization of polynomials is one of the foundations of symbolic computation. Its applications arise in numerous branches of mathematics and other sciences. However, the present advanced programming languages such as C++ and J++, do not support symbolic computation directly. Hence, it leads to difficulties in applying factorization in engineering fields. In this paper, we present an algorithm which use numerical method to obtain exact factors of a bivariate polynomial with rational coefficients. Our method can be directly implemented in efficient programming language such C++ together with the GNU Multiple-Precision Library. In addition, the numerical computation part often only requires double precision and is easily parallelizable.

Affiliated with

Also associated with

No associations

Rating

Exact Bivariate Polynomial Factorization in Q by Approximation of Roots does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Exact Bivariate Polynomial Factorization in Q by Approximation of Roots, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exact Bivariate Polynomial Factorization in Q by Approximation of Roots will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-188752