scientific article; zbMATH DE number 1253987
From MaRDI portal
Publication:4226966
zbMath0920.11081MaRDI QIDQ4226966
Stephen M. Watt, Andre Galligo
Publication date: 23 September 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials in real and complex fields: factorization (12D05) Polynomials (irreducibility, etc.) (11R09) Factorization (11Y05)
Related Items (10)
Semi-numerical absolute factorization of polynomials with integer coefficients ⋮ Parametrization of approximate algebraic curves by lines ⋮ Obtaining exact interpolation multivariate polynomial by approximation ⋮ Computing monodromy via continuation methods on random Riemann surfaces ⋮ Obtaining exact value by approximate computations ⋮ The numerical factorization of polynomials ⋮ Regularization and Matrix Computation in Numerical Polynomial Algebra ⋮ Approximate factorization of multivariate polynomials using singular value decomposition ⋮ Irreducible decomposition of curves ⋮ Probabilistic absolute irreducibility test for polynomials
Uses Software
This page was built for publication:
