A New Greatest Common Divisor Algorithm for Polynomials


10:00 AM - 11:00 AM

Tencent link: https://meeting.tencent.com/dm/ZXHBSuZucryS


  • Time: 10:00-11:00 pm  (Beijing Time)
  • Date: Thursday,  April 11, 2024
  • Venue:Tencent link: https://meeting.tencent.com/dm/ZXHBSuZucryS

    Tencent ID: 373-176-409(Tencent password: 314159)

  • Speaker: Dr. Qiao-Long Huang (Shandong University)


The Greatest Common Divisor (GCD) of polynomials plays a crucial role in polynomial operations and algebraic theory. For example: simplifying polynomials, solving polynomial equations, polynomial factorization, etc. In this talk, I will introduce a new algorithm we propose for finding the GCD of polynomials. Our algorithm uses a new substitution method to find partial GCD terms each time. The experimental results show that the new algorithm is faster than the built-in Maple algorithm and has advantages over the Monagan-Hu algorithm.


Dr. Qiao-Long Huang got his PhD from the Institute of Mathematics and Systems Science, Chinese Academy of Sciences in 2019, and later worked as a postdoctoral fellow at the University of Waterloo and Shandong University, respectively. He joined the School of Mathematics at Shandong University in 2021, and currently is an associate researcher. He is mainly engaged in research on symbol computation and its applications. He hosted a National Natural Science Foundation Youth Fund and published over 10 papers.

You may be interested.