Approximate multivariate polynomial factorization based on zero-sum relations

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2001, Pages 284-291

  Sasaki, T ^a  

^a UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; CONVERGENCE OF NUMERICAL METHODS; DIGITAL ARITHMETIC; POLYNOMIALS; VECTORS;

MULTIVARIABLE POLYNOMIAL FACTORIZATION; NUMERIC MATRIX MANIPULATION METHOD; ZERO-SUM RELATIONS;

MATRIX ALGEBRA;

EID: 0034782199     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/384101.384139     Document Type: Conference Paper

References (12)

1. A numerical absolute primality test for bivariate polynomials
2. Pseudofactors of multivariate polynomials
3. Fast parallel absolute irreducibility testing
4. Approximate factorization of multivariable polynomials
5. Approximate multivariate polynomial factorization and its time complexity
6. Approximate greatest common divisor of multivariate polynomials and its application to ill-conditioned system of algebraic equations
7. On cancellation error in newton's method for power series roots of multivariate polynomial
8. Analysis of approximate factorization algorithm
9. Approximate factorization of multivariate polynomials and absolute irreducibility testing
10. An analysis of cancellation error in multivariate hensel construction with floating-point number arithmetic
11. Error bounds for zeros of a polynomial based on gerschgorin's theorems
12. Approximate gcd of multivariate polynomials