A unified method for multivariate polynomial factorizations
It is desired to factorize the polynomial \(F(x,y,\dots,z)\). First \(f(0,0,\dots, 0)\) is factorized and then the generalized Hensel construction leads to \(F=\prod_{i=1}^ m G_ i(x,y,\dots, z)\) modulo \((y,\dots,z)^{k+1}\) for a sufficiently large integer \(k\). The final stage is to solve a linear system on the numerical coefficients derived from the \(G_ i\), and it is at this stage that this method differs from that of \textit{P. Wang} and \textit{L. Rothschild} [Math. Comput. 29, 935-950 (1975; Zbl 0311.10052)]. The method is applicable over various coefficient domains.
- Analysis of approximate factorization algorithm. I
- Approximate factorization of multivariate polynomials and absolute irreducibility testing
- Factoring Multivariate Polynomials over Algebraic Number Fields
- Factoring Multivariate Polynomials Over the Integers
- Factoring Polynomials Over Algebraic Number Fields
- Factoring polynomials with rational coefficients
- Fast parallel absolute irreducibility testing
- scientific article; zbMATH DE number 3834091 (Why is no real title available?)
- scientific article; zbMATH DE number 3723860 (Why is no real title available?)
- On Hensel factorization. I
- Factoring polynomials over global fields
- Relative factorization of polynomials of several variables
- Solving multivariate algebraic equation by Hensel construction
- Computation of simple and group factors of multivariate polynomials
- A new algorithm for computing the extended Hensel construction of multivariate polynomials
- A study of approximate polynomials. I: Representation and arithmetic
- Lifting and recombination techniques for absolute factorization
- Improved dense multivariate polynomial factorization algorithms
- Approximate factorization of multivariate polynomials using singular value decomposition
- On multivariate polynomial matrix factorization problems
- Factoring multivariate polynomials represented by black boxes: a Maple + C implementation
- Approximate multivariate polynomial factorization based on zero-sum relations
- Extension of expansion base algorithm for multivariate analytic factorization including the case of singular leading coefficient
- Sharp precision in Hensel lifting for bivariate polynomial factorization
- A Unified Algorithm for Multivariate Analytic Factorization
- A Hybrid Approach for Normal Factorization of Polynomials
- Regularization and matrix computation in numerical polynomial algebra
- Topology and factorization of polynomials
- scientific article; zbMATH DE number 1087966 (Why is no real title available?)
- A unified approach to evaluation algorithms for multivariate polynomials
- scientific article; zbMATH DE number 3997161 (Why is no real title available?)
- Sparse bivariate polynomial factorization
- Factorization of multivariate polynomials by extended Hensel construction
- Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring
- Computing monodromy via continuation methods on random Riemann surfaces
- Factoring sparse polynomials fast
- Factoring polynomials and the knapsack problem
This page was built for publication: A unified method for multivariate polynomial factorizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689904)
