Approximate factorization of multivariate polynomials and absolute irreducibility testing
From MaRDI portal
Publication:1179781
DOI10.1007/BF03167142zbMath0757.12006MaRDI QIDQ1179781
Masayuki Suzuki, Miroslav Kolář, Mutsuko Sasaki, Tateaki Sasaki
Publication date: 27 June 1992
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
factorization algorithmabsolute irreducibility of multivariate polynomialspolynomials with approximate complex coefficients
Polynomials in real and complex fields: factorization (12D05) Numerical approximation and computational geometry (primarily algorithms) (65D99)
Related Items
A study of approximate polynomials. I: Representation and arithmetic ⋮ Semi-numerical absolute factorization of polynomials with integer coefficients ⋮ Hensel construction with an arbitrary degree of convergence ⋮ Obtaining exact interpolation multivariate polynomial by approximation ⋮ Sparse bivariate polynomial factorization ⋮ Obtaining exact value by approximate computations ⋮ The numerical factorization of polynomials ⋮ A unified method for multivariate polynomial factorizations ⋮ Analysis of approximate factorization algorithm. I ⋮ 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 ⋮ Towards toric absolute factorization ⋮ Solving multivariate algebraic equation by Hensel construction ⋮ Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots ⋮ Approximate eigenvalues, eigenvectors and inverse of a matrix with polynomial entries
Cites Work
