Name
Abstract | ||
|---|---|---|
A new algorithm is presented for factoring bivariate approximate polynomials over C[x, y]. Given a particular polynomial, the method constructs a nearby composite polynomial, if one exists, and its irreducible factors. Subject to a conjecture, the time to produce the factors is polynomial in the degree of the problem. This method has been implemented in Maple, and has been demonstrated to be efficient and numerically robust. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1145/384101.384114 | ISSAC |
Keywords | Field | DocType |
particular polynomial,irreducible factor,nearby composite polynomial,new algorithm,bivariate approximate polynomial,grobner basis | Discrete mathematics,Combinatorics,Polynomial matrix,Minimal polynomial (field theory),Degree of a polynomial,Reciprocal polynomial,Matrix polynomial,Irreducible polynomial,Symmetric polynomial,Factorization of polynomials,Mathematics | Conference |
ISBN | Citations | PageRank |
1-58113-417-7 | 32 | 1.59 |
References | Authors | |
18 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Robert M. Corless | 1 | 143 | 21.54 |
| Mark W. Giesbrecht | 2 | 77 | 4.54 |
| Mark Van Hoeij | 3 | 393 | 44.57 |
| Ilias S. Kotsireas | 4 | 168 | 29.72 |
| Stephen M. Watt | 5 | 671 | 84.72 |