PGB

We describe a new software package, named PGB, for computing parametric polynomial systems and related objects. PGB is applicable to a wide range of expressions for many of which there has not been any software available up to now. The purpose of this paper is to illustrate how to solve using that package.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 13 articles , 2 standard articles )

Showing results 1 to 13 of 13.
Sorted by year (citations)

  1. Kredel, Heinz: Parametric solvable polynomial rings and applications (2015)
  2. Kredel, Heinz: Comprehensive Gröbner bases in a Java computer algebra system (2014)
  3. Kapur, Deepak; Sun, Yao; Wang, Dingkang: An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial system (2013)
  4. Nabeshima, Katsusuke: On the computation of parametric Gröbner bases for modules and syzygies (2010)
  5. Kredel, Heinz: Comprehensive Gröbner bases in a Java computer algebra system (2009)
  6. Nabeshima, Katsusuke: PGB: a package for computing parametric polynomial systems (2009)
  7. Nagasaka, Kosaku: A study on Gröbner basis with inexact input (2009)
  8. Sato, Yosuke; Suzuki, Akira: Computation of inverses in residue class rings of parametric polynomial ideals (2009)
  9. Nabeshima, Katsusuke: PGB: a package for computing parametric Gröbner and related objects (2007) ioport
  10. Nabeshima, Katsusuke: A speed-up of the algorithm for computing comprehensive Gröbner systems (2007)
  11. Contino, Roberto; Nomura, Yasunori; Pomarol, Alex: Higgs as a holographic pseudo-Goldstone boson (2003)
  12. Kuchment, Peter: The mathematics of photonic crystals (2001)
  13. Saber, Hussein M.; Ravindran, A.: A partitioning gradient based (PGB) algorithm for solving nonlinear goal programming problems (1996)