Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
From MaRDI portal
Publication:2341619
DOI10.1007/s11424-014-2170-5zbMath1328.65108MaRDI QIDQ2341619
Wenyuan Wu, Yong Feng, Jingwei Chen, Jing-Zhong Zhang
Publication date: 27 April 2015
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-014-2170-5
numerical continuation; minimal polynomial; interpolation methods; factorization of multivariate polynomials
65H04: Numerical computation of roots of polynomial equations
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Sparse bivariate polynomial factorization
- Numerical factorization of multivariate complex polynomials
- A lifting and recombination algorithm for rational factorization of sparse polynomials
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
- HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
- Irreducibility of multivariate polynomials
- A homotopy for solving general polynomial systems that respects m- homogeneous structures
- Approximate factorization of multivariate polynomials and absolute irreducibility testing
- Analysis of approximate factorization algorithm. I
- On Hilbert's irreducibility theorem
- Fast separable factorization and applications
- Factoring bivariate polynomials using adjoints
- From an approximate to an exact absolute polynomial factorization
- Improved dense multivariate polynomial factorization algorithms
- Obtaining exact value by approximate computations
- An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation
- Approximate factorization of multivariate polynomials using singular value decomposition
- Numerical solutions of index-1 differential algebraic equations can be computed in polynomial time
- On Hensel factorization. I
- Semi-numerical absolute factorization of polynomials with integer coefficients
- Bertini_real: Software for One- and Two-Dimensional Real Algebraic Sets
- Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations
- Towards factoring bivariate approximate polynomials
- Approximate multivariate polynomial factorization based on zero-sum relations
- Exact polynomial factorization by approximate high degree algebraic numbers
- Factoring bivariate lacunary polynomials without heights
- Sharp precision in Hensel lifting for bivariate polynomial factorization
- Pseudofactors of multivariate polynomials
- Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers
- A Remark on the Hensel Factorization Method
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Algorithm 795
- Approximate factorization of multivariate polynomials via differential equations
- Factoring multivariate polynomials via partial differential equations
- A complete algorithm to find exact minimal polynomial by approximations
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
