Three new algorithms for multivariate polynomial GCD (original) (raw)
Related papers
Four New Algorithms for Multivariate Polynomial GCD
2016
GPGCD, an iterative method for calculating approximate GCD, for multiple univariate polynomials
ACM SIGSAM Bulletin, 2011
GPGCD: An iterative method for calculating approximate GCD of univariate polynomials
Theoretical Computer Science, 2013
A Symbolic-Numeric Software Package for the Computation of the GCD of Several Polynomials
A simple algorithm for GCD of polynomials
Annals of mathematics and physics, 2022
Using an efficient sparse minor expansion algorithm to compute polynomial subresultants and GCD
GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation
Journal of Symbolic Computation, 1989
Simple algorithm for GCD of polynomials
ArXiv, 2022
Approximate GCD of Multivariate Polynomials
ANZIAM Journal, 2019
High-performance polynomial GCD computations on graphics processors
2011 International Conference on High Performance Computing & Simulation, 2011
Algorithms for computing greatest common divisors of parametric multivariate polynomials
Journal of Symbolic Computation, 2021
Eprint Arxiv 1007 1834, 2010
A sparse modular GCD algorithm for polynomials over algebraic function fields
Proceedings of the 2007 international symposium on Symbolic and algebraic computation - ISSAC '07, 2007
Algorithms for polynomial GCD computation over algebraic function fields
Proceedings of the 2004 international symposium on Symbolic and algebraic computation - ISSAC '04, 2004
2015
Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix
Lecture Notes in Computer Science, 2008
On the genericity of the modular polynomial GCD algorithm
1999
Resultant properties of gcd of many polynomials and a factorization representation of gcd
International Journal of Control, 2003
Computing Approximate GCD of Univariate Polynomials by Structure Total Least Norm 1)
2000
Algorithms for the non-monic case of the sparse modular GCD algorithm
Proceedings of the 2005 international symposium on Symbolic and algebraic computation - ISSAC '05, 2005
An alternating projection algorithm for the “approximate” GCD calculation
IFAC-PapersOnLine
On the Remainders Obtained in Finding the Greatest Common Divisor of Two Polynomials
Serdica Journal of Computing, 2016
A novel fast hybrid GCD computation algorithm
International Journal of Computing Science and Mathematics, 2014
Numerical univariate polynomial GCD
LECTURES IN APPLIED …, 1996
Computing univariate GCDs over number fields
Symposium on Discrete Algorithms, 1998
Title Approximate GCD of Multivariate Polynomials (Theory and Application in Computer Algebra)
2000
On a modular algorithm for computing GCDs of polynomials over algebraic number fields
Proceedings of the international symposium on Symbolic and algebraic computation - ISSAC '94, 1994
Linear Algebra and Its Applications, 2006