Approximate factorization of multivariate polynomials via differential equations

DOI10.1145/1005285.1005311MaRDI QIDQ4657319zbMATH OpenOpenAlexFDO

Authors Shuhong Gao, Erich L. Kaltofen, John P. May, Zhengfeng Yang, Lihong Zhi

Publication date 14 March 2005

Published in Proceedings of the 2004 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1005285.1005311

Mathematics Subject Classification ID

Computational aspects and applications of commutative rings (13P99) Numerical computation of solutions to single equations (65H05) Symbolic computation and algebraic computation (68W30)

Recommendations

• Approximate factorization of multivariate polynomials using singular value decomposition
• Analysis of approximate factorization algorithm. I
• scientific article; zbMATH DE number 2151235
• Towards factoring bivariate approximate polynomials
• Approximate multivariate polynomial factorization based on zero-sum relations

Cited in

(32)

• Approximate factorization of multivariate polynomials and absolute irreducibility testing
• The computation of the degree of the greatest common divisor of three Bernstein basis polynomials
• Approximate polynomial GCD by approximate syzygies
• Complexity of solving parametric polynomial systems
• Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
• Lifting and recombination techniques for absolute factorization
• From an approximate to an exact absolute polynomial factorization
• Approximate factorization of multivariate polynomials using singular value decomposition
• Symbolic differentiation of factorized polynomials with repeated roots and the identification of their loci
• A quadratically convergent algorithm for structured low-rank approximation
• The approximate irreducible factorization of a univariate polynomial. Revisited
• Towards factoring bivariate approximate polynomials
• Approximate multivariate polynomial factorization based on zero-sum relations
• Extracting numerical factors of multivariate polynomials from Taylor expansions
• Pseudofactors of multivariate polynomials
• Regularization and matrix computation in numerical polynomial algebra
• scientific article; zbMATH DE number 2151235 (Why is no real title available?)
• Factorization in the multirefined tangent method
• Computing Divisors and Common Multiples of Quasi-linear Ordinary Differential Equations
• The numerical factorization of polynomials
• Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients
• scientific article; zbMATH DE number 5220462 (Why is no real title available?)
• scientific article; zbMATH DE number 966297 (Why is no real title available?)
• Symbolic-numeric sparse interpolation of multivariate polynomials
• Numerical factorization of multivariate complex polynomials
• SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials
• The calculation of the degree of an approximate greatest common divisor of two polynomials
• Computing monodromy via continuation methods on random Riemann surfaces
• Approximate polynomial GCD over integers
• Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation
• Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials
• Encounters in symbolic computation: ideas for the ages

Describes a project that uses

Uses Software

• MultRoot
• CARS

This page was built for publication: Approximate factorization of multivariate polynomials via differential equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4657319)