Jiaxiong Hu
Michael Monagan
- M. BEN-Or, P. Tiwari: A deterministic algorithm for sparse multivariate polynomial interpolate. Proc. 20th annual ACM Symp Theory Comp, 1988, 301--309. Google Scholar
Digital Library
- M. Giesbrecht, G. Labahn, W-S. Lee: Symbolic-numeric sparse interpolation of multivariate polynomials. ISSAC'06, 2006. Google ScholarDigital Library
- E. Kaltofen, Y.N. Lakshman, J-M. Wiley: Modular rational sparse multivariate polynomial interpolation. Watanabe and Nagata, 1990, 135--139. Google ScholarDigital Library
- P. Wang: The EEZ-GCD Algorithm. SIGSAM Bulletin, 14, 1980, 50--60. Google ScholarDigital Library
- R. E. Zippel: Probabilistic algorithms for sparse polynomials. EUROSAM '79, Springer-Verlag LNCS, 2, 1979, 216--226. Google ScholarDigital Library
Index Terms
- A parallel algorithm to compute the greatest common divisor of sparse multivariate polynomials
Recommendations
Using an Efficient Sparse Minor Expansion Algorithm to Compute Polynomial Subresultants and the Greatest Common Denominator
In this paper, the use of an efficient sparse minor expansion method to directly compute the subresultants needed for the greatest common denominator (GCD) of two polynomials is described. The sparse minor expansion method (applied either to Sylvester's ...
Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix
Computer MathematicsAbstractThe comrade matrix of a polynomial is an analogue of the companion matrix when the matrix is expressed in terms of a general basis such that the basis is a set of orthogonal polynomials satisfying the three-term recurrence relation. We present the ...
Barnett's Theorems About the Greatest Common Divisor of Several Univariate Polynomials Through Bezout-like Matrices
This article provides a new presentation of Barnett s theorems giving the degree (resp. coefficients) of the greatest common divisor of several univariate polynomials with coefficients in an integral domain by means of the rank (resp. linear ...
Comments