• INTLAB

  • Referenced in 356 articles [sw04004]
  • clusters) quadrature for univariate functions univariate polynomial zeros (simple and clusters) interval arithmetic for real ... simple) univariate functions univariate and multivariate (interval) polynomials rigorous real interval standard functions (fast, very...
  • CoCoA

  • Referenced in 564 articles [sw00143]
  • perform simple and sophisticated operations on multivaraiate polynomials and on various data related to them ... ideal of zero-dimensional schemes, Poincare’ series and Hilbert functions, factorization of polynomials, toric ideals...
  • na10

  • Referenced in 42 articles [sw11511]
  • Numerical computation of polynomial zeros by means of Aberth’s method. n algorithm for computing ... polynomial zeros, based on Aberth’s method, is presented. The starting approximations are chosen ... with the numberk i of zeros of the polynomial contained in each annulusA ... computed approximations are the exact zeros of a “nearby” polynomial. This implies the backward stability...
  • ORTHPOL

  • Referenced in 68 articles [sw00659]
  • generated, such as zeros of orthogonal polynomials and Gauss-type quadrature rules, for which routines...
  • PolyBoRi

  • Referenced in 40 articles [sw00723]
  • specialised data structure for Boolean polynomials based on zero-suppressed binary decision diagrams, which...
  • RegularChains

  • Referenced in 58 articles [sw00796]
  • facilities for symbolic computations with systems of polynomial equations. In particular, it allows to compute ... recombination) handles zero-divisors and parameters. This permits triangular decomposition of polynomial equations...
  • HOMPACK

  • Referenced in 117 articles [sw05324]
  • qualitatively different algorithms for tracking the homotopy zero curve: ordinary differential equation-based, normal flow ... included for the special case of polynomial systems...
  • CPOLY

  • Referenced in 13 articles [sw05303]
  • Algorithm 419: zeros of a complex polynomial [C2] The subroutine CPOLY is a Fortran program ... find all the zeros of a complex polynomial by the three-stage complex algorithm described ... Traub [4]. (An algorithm for real polynomials is given in [5].) The algorithm is similar ... zeros one at a time in roughly increasing order of modulus and deflates the polynomial...
  • DEMiCs

  • Referenced in 21 articles [sw00196]
  • Newton polytopes of a general semi-mixed polynomial system through dynamic enumeration of all mixed ... role for computing all isolated zeros of a polynomial system by polyhedral homotopy continuation method...
  • IZSS1

  • Referenced in 3 articles [sw06177]
  • step procedure for simultaneous finding of polynomial zeros. The aim of this paper ... where each interval contains a zero of a polynomial. The IZSS1 method will produce successively ... that are guaranteed to still contain the zeros. The convergence rate of the procedure IZSS1 ... procedure is run on five test polynomials and the results obtained show that the modified...
  • HOMPACK90

  • Referenced in 45 articles [sw00412]
  • Jacobian matrix – are provided for tracking homotopy zero curves, as well as separate routines ... level driver for the special case of polynomial systems is also provided. Changes to HOMPACK...
  • Surfer

  • Referenced in 7 articles [sw00931]
  • visualized are given by the zero set of a polynomial equation in 3 variables. Surfer...
  • CharSets

  • Referenced in 3 articles [sw13623]
  • computing characteristic sets and various zero decompositions of polynomial systems and other related polynomial calculations ... systems of polynomial equations, and factorizing multivariate polynomials over algebraic extension fields. A new module ... corresponding zero decompositions for systems of ordinary differential polynomials. Some of the routines from...
  • HOM4PS

  • Referenced in 66 articles [sw00410]
  • polyhedral homotopy continuation method for solving polynomial systems. It updates its original version HOM4PS ... surpasses the existing packages in finding isolated zeros, such as PHCpack [J. Verschelde, ACM Trans...
  • QPmR

  • Referenced in 4 articles [sw07640]
  • compute all the zeros of a quasi-polynomial located in a given region...
  • na1

  • Referenced in 50 articles [sw11516]
  • value is zero or is different from zero but small in Lanczos type algorithms ... avoided by considering only the existing orthogonal polynomials in the Lanczos type algorithms. The methods...
  • GLESP

  • Referenced in 1 article [sw29740]
  • based on the Gauss-Legendre polynomials zeros and allows one to create strict orthogonal expansion...
  • GAIA

  • Referenced in 4 articles [sw03223]
  • reduced to the zero set of a polynomial equation f(s,t)=0 of degree...
  • StronglyStableIdeals

  • Referenced in 7 articles [sw27084]
  • case of polynomial rings with coefficients in a field of characteristic zero, the notion ... saturated strongly stable ideals in a given polynomial ring with a given Hilbert polynomial...