Polynomial Factorization in Maple 2019

Monagan, Michael; Tuncer, Baris

doi:10.1007/978-3-030-41258-6_28

Search citation statements

Order By: Relevance

Paper Sections

Select...

Timing Benchmarks1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2022

2023

Publication Types

Select...

Article2

Other1

Relationship

Self Cite1

Independent2

Authors

Journals

Cited by 3 publications

(1 citation statement)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If the time for gcd is slower than factor then something is wrong as we could simply use the factorization of 𝐴 and 𝐵 to determine the gcd 𝐺. The factor code Maple has been using since Maple2019 is the work of Monagan and Tuncer [16,17,18]. As the reader can see Maple's factor command is faster than our GCD1 timings when #𝐺 ≫ # Ā.…”

Section: Timing Benchmarksmentioning

confidence: 99%

Speeding up polynomial GCD, a crucial operation in Maple

Monagan

2022

Maple Trans.

Self Cite

View full text Add to dashboard Cite

Given two multivariate polynomials A and B with integer coefficientswe present a new GCD algorithm which computes G = gcd(A,B).Our algorithm is based on the Hu/Monagan GCD algorithm.If A = G A̅ and B = G B̅ we have modified the Hu/Monaganso that it can interpolate the smaller of G and A̅. We have implemented the new GCD algorithm in Maple withseveral subroutines coded in C for efficiency.Maple currently uses Zippel's sparse modular GCD algorithm.We present timing results comparing Maple's implementation of Zippel's algorithm

show abstract

Section: Timing Benchmarksmentioning

confidence: 99%