• Octave

  • Referenced in 288 articles [sw00646]
  • algebra problems, finding the roots of nonlinear equations, integrating ordinary functions, manipulating polynomials, and integrating...
  • insulate

  • Referenced in 23 articles [sw21729]
  • problem so far require finding and counting real roots of polynomials over an algebraic extension ... those polynomials are algebraic numbers. Various algebraic approaches for this real root finding and counting ... correct and that avoids finding and counting real roots of polynomials with non-rational coefficients...
  • Bertini

  • Referenced in 231 articles [sw06683]
  • Numerical Algebraic Geometry. Software for solving polynomial systems. Finds isolated solutions using total-degree start ... parallel-link robots. Adaptive multiprecision implemented for finding isolated solutions and for the numerical irreducible ... power-series endgame to accurately compute singular roots Allows for subfunctions. Allows for witness...
  • COPRIN

  • Referenced in 14 articles [sw04826]
  • Minimal and maximal real roots of parametric polynomials using interval analysis In this ... paper we are interested in parametric polynomials, i.e. polynomials whose coefficients are analytical functions ... such as finding the extremal real roots for the set of polynomials and determining...
  • QROOT

  • Referenced in 14 articles [sw07929]
  • package finds real or complex roots of characteristic equations which may be of polynomial (with ... QROOT package was originally designed to find roots of equations that occur in queueing theory...
  • INTBIS

  • Referenced in 31 articles [sw00442]
  • variables. Where practical, the package should find all roots with mathematical certainty. Though based ... require programming if the equations are polynomials; it is structured for further algorithmic research...
  • QPmR

  • Referenced in 6 articles [sw07640]
  • plane. The root-finding task is based on mapping the quasi-polynomial in the complex...
  • fourier

  • Referenced in 1 article [sw20915]
  • roots of the Legendre polynomial, but finds the roots by looking for the eigenvalues ... matrix of the n’th degree Legendre polynomial. The companion matrix is constructed...
  • Algorithm 954

  • Referenced in 3 articles [sw20214]
  • both polynomials. This puts upper bounds on the magnitude of the roots and is very ... root finding process. The cubic solver is based on dividing the cubic polynomial into ... classes. By analyzing the root surface for each class, a fast convergent Newton-Raphson starting...
  • MAPC

  • Referenced in 23 articles [sw04990]
  • coefficients. Algebraic numbers represented as the roots of polynomials within an interval ... algorithms which provide the following functions: Rapidly finding the sign of a determinant of arbitrary...
  • PSLQ

  • Referenced in 4 articles [sw10414]
  • finding the polynomial that has a specific surd as one of it’s roots...
  • POLSYS_GLP

  • Referenced in 9 articles [sw07346]
  • support a general linear product (GLP) polynomial system structure. GLP structure is intermediate between ... structure as input, and although finding the optimal GLP structure is a difficult combinatorial problem ... systematically explored before committing to root finding...
  • C02AFF

  • Referenced in 1 article [sw36291]
  • Routine c02aff: c02aff finds all the roots of a complex polynomial equation, using a variant...
  • MAT Template Library

  • Referenced in 0 articles [sw05744]
  • library for various matrix operations, finding roots of polynomials, solving equations, etc. The library contains...
  • pychebfun

  • Referenced in 1 article [sw36347]
  • system incorporates the use of Chebyshev polynomial expansions, Lagrange interpolation with the barycentric formula ... perform fast functional evaluation, integration, root-finding, and other operations...
  • LPH

  • Referenced in 3 articles [sw26522]
  • special class of polynomial systems. The root number bound of this method is between ... application, the algorithm can be used to find witness points on each connected component...
  • RootsExtremaInflections

  • Referenced in 0 articles [sw19970]
  • href=”https://www.researchgate.net/publication/261562841”>https://www.researchgate.net/publication/261562841>) for finding the root, extreme or inflection point of a curve ... method uses a suitable polynomial regression in order to find the coefficients of the relevant...
  • Equation Grapher and Regression Analyzer

  • Referenced in 0 articles [sw05978]
  • plotted a function, Equation Grapher automatically finds roots, maximum/minimum, intersections etc. It can also calculate ... also supports polynomial models and multiple regressions. To find the best model for your data...
  • FactInt

  • Referenced in 0 articles [sw21199]
  • Method (ECM); Continued Fraction Algorithm (CFRAC); Multiple Polynomial Quadratic Sieve (MPQS). FactInt also makes ... Lübeck. The ECM is suited best for finding factors which are neither too small ... digits) nor too close to the square root of the number to be factored...
  • CHABIS

  • Referenced in 19 articles [sw00119]
  • Algorithm 666. CHABIS: A mathematical software package for...