GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials

DOI10.1007/978-3-642-15274-0_22zbMath1290.68139arXiv1007.1836MaRDI QIDQ3587712

Akira Terui

Publication date: 10 September 2010

Published in: ACM Communications in Computer Algebra, Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.1836

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

90C30: Nonlinear programming

12E05: Polynomials in general fields (irreducibility, etc.)

65D99: Numerical approximation and computational geometry (primarily algorithms)

Related Items

GPGCD

Uses Software

• MultRoot
• GPGCD