An Efficient Algorithm for Factoring Polynomials over Algebraic Extension Field

Details An Efficient Algorithm for Factoring Polynomials over Algebraic Extension Field An Efficient Algorithm for Factoring Polynomials over Algebraic Extension Field

2009-07-14

arxiv.org/abs/0907.2300v2

Computer Science

Symbolic Computation

Scientific paper

A new efficient algorithm is proposed for factoring polynomials over an algebraic extension field. The extension field is defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its Groebner basis, no extra Groebner basis computation is needed for factoring a polynomial over this extension field. Nothing more than linear algebraic technique is used to get a polynomial over the ground field by a generic linear map. Then this polynomial is factorized over the ground field. From these factors, the factorization of the polynomial over the extension field is obtained. The new algorithm has been implemented and computer experiments indicate that the new algorithm is very efficient, particularly in complicated examples.

Affiliated with

Also associated with

No associations

Rating

An Efficient Algorithm for Factoring Polynomials over Algebraic Extension Field 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 An Efficient Algorithm for Factoring Polynomials over Algebraic Extension Field, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Efficient Algorithm for Factoring Polynomials over Algebraic Extension Field will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-331516