Numerical factorization of multivariate complex polynomials

DOI10.1016/j.tcs.2004.01.011zbMath1147.13302OpenAlexW2170896432MaRDI QIDQ598228

Jan Verschelde, Charles W. Wampler, Andrew John Sommese

Publication date: 6 August 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.01.011

zbMATH Keywords

Newton interpolationApproximate factorizationDivided differencesGeneric pointsHomotopy continuationIrreducible decompositionMonodromyMultiple rootsNumerical algebraic geometryPolynomialStewart--Gough platformSymbolic-numeric computationTracesWitness points

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Polynomials, factorization in commutative rings (13P05) Computational aspects in algebraic geometry (14Q99)

Related Items

Nonlinear embeddings: applications to analysis, fractals and polynomial root finding, Modular Las Vegas algorithms for polynomial absolute factorization, Reliable root detection with the qd-algorithm: When Bernoulli, Hadamard and Rutishauser cooperate, From an approximate to an exact absolute polynomial factorization, Symbolic-numeric sparse interpolation of multivariate polynomials, The numerical factorization of polynomials, Regularization and Matrix Computation in Numerical Polynomial Algebra, Approximate factorization of multivariate polynomials using singular value decomposition, Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients, Towards toric absolute factorization, Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots

Uses Software

• PHCpack
• mctoolbox

Cites Work

• Irreducible decomposition of curves
• Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
• Parallel robots
• Numerical homotopies to compute generic points on positive dimensional algebraic sets
• Finding a cluster of zeros of univariate polynomials
• Computation of approximate polynomial GCDs and an extension
• Semi-numerical absolute factorization of polynomials with integer coefficients
• Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components
• Towards factoring bivariate approximate polynomials
• Semi-numerical determination of irreducible branches of a reduced space curve
• Approximate multivariate polynomial factorization based on zero-sum relations
• Pseudofactors of multivariate polynomials
• A Globally Convergent Method for Simultaneously Finding Polynomial Roots
• Factoring Rational Polynomials over the Complex Numbers
• Solving a Polynomial Equation: Some History and Recent Progress
• Algorithm 795
• Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item