scientific article; zbMATH DE number 1253987

MaRDI QIDQ4226966zbMATH OpenFDO

Authors Stephen M. Watt, André Galligo

Publication date 23 September 1999

zbMATH Keywords

absolute factorsbivariate polynomialsnumerical absolute primality criterionprobabilistic algorithm

Mathematics Subject Classification ID

Polynomials (irreducibility, etc.) (11R09) Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16) Polynomials in real and complex fields: factorization (12D05) Symbolic computation and algebraic computation (68W30)

Recommendations

• Modular Las Vegas algorithms for polynomial absolute factorization
• Probabilistic absolute irreducibility test for polynomials
• Semi-numerical absolute factorization of polynomials with integer coefficients
• scientific article; zbMATH DE number 2151216

Cited in

(11)

• When are two numerical polynomials relatively prime?
• Probabilistic absolute irreducibility test for polynomials
• Obtaining exact interpolation multivariate polynomial by approximation
• Obtaining exact value by approximate computations
• Approximate factorization of multivariate polynomials using singular value decomposition
• Semi-numerical absolute factorization of polynomials with integer coefficients
• Regularization and matrix computation in numerical polynomial algebra
• The numerical factorization of polynomials
• Parametrization of approximate algebraic curves by lines
• Computing monodromy via continuation methods on random Riemann surfaces
• Irreducible decomposition of curves

Describes a project that uses

Uses Software

• Maple

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4226966)