1469 search results - page 1 / 294 » Approximate polynomial decomposition |
JSC
2008
13 years 5 months ago
2008
We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficie...
ISSAC
1999
Springer
13 years 9 months ago
1999
Springer
ISSAC
1995
Springer
13 years 9 months ago
1995
Springer
This paper introduces singular value decomposition (SVD) algorithms for some standard polynomial computations, in the case where the coefficients are inexact or imperfectly known....
JSC
2007
13 years 5 months ago
2007
Triangular decompositions for systems of polynomial equations with n variables, with exact coefficients, are well developed theoretically and in terms of implemented algorithms i...
TALG
2010
13 years 3 months ago
2010
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...