Name
Title | ||
|---|---|---|
GCD of multivariate approximate polynomials using beautification with the subtractive algorithm. |
Abstract | ||
|---|---|---|
The GCD problem for approximate polynomials, by which we mean polynomials expressed in some fixed basis but having approximately-known coefficients, has been well-studied at least since the paper of [6]. Important papers include those listed in [4, 2.12.3], and more recently includes [5], [8] and [9]. What is new about the present paper is that we hope to take advantage of some new technology, in order to improve our understanding of the GCD problem and not necessarily to try to improve on existing algorithms. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1145/2331684.2331709 | Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation |
Keywords | DocType | Citations |
fixed basis,present paper,approximately-known coefficient,approximate polynomial,subtractive algorithm,gcd problem,multivariate approximate polynomial,important paper,new technology | Conference | 0 |
PageRank | References | Authors |
0.34 | 6 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Robert M. Corless | 1 | 40 | 7.66 |
| Erik Postma | 2 | 0 | 1.01 |
| David R. Stoutemyer | 3 | 49 | 19.14 |