Cited in
(21)- Variable projection methods for approximate (greatest) common divisor computations
- The closedness subspace method for computing the multiplicity structure of a polynomial system
- Algorithm 931
- The numerical greatest common divisor of univariate polynomials
- Software for algebraic geometry. Papers of a workshop, Minneapolis, MN, USA, October 23--27, 2006
- A numerical elimination method for polynomial computations
- Symbolic-numeric integration of rational functions
- MultRoot
- SNAP
- SYNAPS
- GPGCD
- PHClab
- NACLab
- MR
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
- NumericalHilbert
- Regularization and matrix computation in numerical polynomial algebra
- A numerical local dimension test for points on the solution set of a system of polynomial equations
- The approximate irreducible factorization of a univariate polynomial. Revisited
- Chern numbers of smooth varieties via homotopy continuation and intersection theory
- The numerical factorization of polynomials
This page was built for software: ApaTools
