Analysis of approximate factorization algorithm. I

DOI10.1007/BF03167271zbMath0808.12001OpenAlexW2003998577MaRDI QIDQ1202761

Tomokatsu Saito, Tateaki Sasaki, Teluhiko Hilano

Publication date: 16 February 1993

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03167271

zbMATH Keywords

algorithmapproximate factorizationfactorization of polynomialsmultivariate polynomialseveral indeterminates

Mathematics Subject Classification ID

Polynomials in real and complex fields: factorization (12D05)

Related Items (11)

A study of approximate polynomials. I: Representation and arithmetic ⋮ Obtaining exact interpolation multivariate polynomial by approximation ⋮ Computing monodromy via continuation methods on random Riemann surfaces ⋮ The integer Chebyshev problem ⋮ Sparse bivariate polynomial factorization ⋮ Obtaining exact value by approximate computations ⋮ A unified method for multivariate polynomial factorizations ⋮ Regularization and Matrix Computation in Numerical Polynomial Algebra ⋮ Approximate factorization of multivariate polynomials using singular value decomposition ⋮ Sharp precision in Hensel lifting for bivariate polynomial factorization ⋮ Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots

Cites Work

• Approximate factorization of multivariate polynomials and absolute irreducibility testing
• Unnamed Item

This page was built for publication: Analysis of approximate factorization algorithm. I