Work

Optimizing the half-gcd algorithm

Year: 2022

Type: preprint

Abstract: In this paper, we propose a carefully optimized "half-gcd" algorithm for polynomials. We achieve a constant speed-up with respect to previous work for the asymptotic time complexity. We also discuss special optimizations that are possible when polynomial multiplication is done using radix two FFTs.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2212.12389

Author: van der Hoeven, Joris

Institutions: Centre National de la Recherche Scientifique, École Polytechnique, Laboratoire d'Informatique de l'École Polytechnique, Institut Polytechnique de Paris

Language: English

Topic: Polynomial and algebraic computation

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W4312206366

Cites:

Cited by:

Related to: 10