ApaTools
From MaRDI portal
Software:14084
swMATH1344MaRDI QIDQ14084FDOQ14084
Author name not available (Why is that?)
Cited In (13)
- The approximate irreducible factorization of a univariate polynomial. Revisited
- Variable projection methods for approximate (greatest) common divisor computations
- A numerical elimination method for polynomial computations
- Algorithm 931
- The numerical greatest common divisor of univariate polynomials
- Regularization and Matrix Computation in Numerical Polynomial Algebra
- Chern numbers of smooth varieties via homotopy continuation and intersection theory
- Software for algebraic geometry. Papers of a workshop, Minneapolis, MN, USA, October 23--27, 2006
- Title not available (Why is that?)
- A Numerical Local Dimension Test for Points on the Solution Set of a System of Polynomial Equations
- Symbolic-numeric integration of rational functions
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
- The numerical factorization of polynomials
This page was built for software: ApaTools
