• 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...
  • xorgens

  • Referenced in 6 articles [sw18736]
  • that their minimal polynomials have a large number of non-zero terms and, hence...
  • Janet

  • Referenced in 33 articles [sw07776]
  • algebra representing ordinary differential operators in characteristic zero whose coefficients are rational functions, an elementary ... position over term” orderings in the polynomial case. Four involutive criteria are implemented to avoid...
  • na5

  • Referenced in 24 articles [sw11489]
  • orthogonal polynomial which is computed recursively. The conjugate gradient squared algorithm (CGS) consists in takingr ... scalar product in a denominator is zero, then a breakdown occurs in the algorithm. When...
  • R-MAX

  • Referenced in 32 articles [sw02539]
  • attain near-optimal average reward in polynomial time. In R-MAX, the agent always maintains ... Singh’s E^3 algorithm, covering zero-sum stochastic games. (2) It has a built...
  • InvariantRing

  • Referenced in 1 article [sw12134]
  • finite group actions on polynomial rings in characteristic zero. We outline methods for computing primary...
  • GAUSSH

  • Referenced in 1 article [sw11851]
  • abscissae are given by the zeros of the Laguerre polynomials, which are found...
  • NumericSolutions

  • Referenced in 1 article [sw31511]
  • package for solving systems of polynomial equalities. It is used to compute the points ... affine variety V(I) of a zero dimensional ideal I. Note that this package ... compute the solution to a system of polynomial equalities having a finite number of solutions ... used only if the ideal I is zero dimensional...
  • absfact.lib

  • Referenced in 2 articles [sw33621]
  • multivariate polynomials f with coefficients in a field K of characteristic zero. Using Trager ... Bertone, Cheze and Galligo for bivariate polynomials and similar ideas as above to reduce...
  • Bertini.m2

  • Referenced in 8 articles [sw08784]
  • variety of algorithms based on polynomial homotopy continuation. The Macaulay2 package Bertini.m2 provides an interface ... modes, users can find approximate solutions to zero-dimensional systems and positive-dimensional systems, test...
  • cubic.lib

  • Referenced in 1 article [sw16959]
  • given as the zero set of a degree 3 polynomial in 3 variables. A class...
  • Madsen

  • Referenced in 0 articles [sw05302]
  • find all zeroes of a real polynomial, C++ version...
  • Chordal

  • Referenced in 4 articles [sw27125]
  • polynomial ideals. The sparsity structure of a polynomial set can be described with a graph ... compute elimination ideals, count the number of zeros, determine the dimension, decompose the variety...
  • Algorithm 767

  • Referenced in 2 articles [sw04678]
  • subroutine is described that takes a polynomial matrix P as input and yields on output ... actually PU-R is near zero. The subroutine is based on an algorithm, described...
  • AXIOM

  • Referenced in 169 articles [sw00063]
  • Axiom is a general purpose Computer Algebra system...
  • BARON

  • Referenced in 305 articles [sw00066]
  • BARON is a computational system for solving nonconvex...
  • CASA

  • Referenced in 88 articles [sw00108]
  • CASA is a special-purpose system for computational...
  • cdd

  • Referenced in 109 articles [sw00114]
  • The program cdd+ (cdd, respectively) is a C...
  • CGAL

  • Referenced in 335 articles [sw00118]
  • The goal of the CGAL Open Source Project...