Polynomial test suite. The aim of this data base is to provide a list of examples which could be used to illustrate, compare, evaluate different methods for solving polynomial systems. system. the latex source is also available, as well as a separated postscript file, which describe the system individually. These examples are coming with references, where the reader can find the origin of the problem. The equations are also accessible in a format (ie. {sc maple}) that can be used directly from the screen, so that no effort of translation should be required. This work is done under the Frisco project (LTR 21.024).

References in zbMATH (referenced in 23 articles )

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

1 2 next

  1. Gräbe, Hans-Gert: Semantic-aware fingerprints of symbolic research data (2016)
  2. Chen, Tianran; Li, Tien-Yien: Homotopy continuation method for solving systems of nonlinear and polynomial equations (2015)
  3. Yanovich, D.A.: Compact representation of polynomials for algorithms for computing Gröbner and involutive bases (2015)
  4. Eder, Christian: An analysis of inhomogeneous signature-based Gröbner basis computations (2013)
  5. Gerdt, Vladimir P.; Hashemi, Amir; M.-Alizadeh, Benyamin: Involutive bases algorithm incorporating F$_5$ criterion (2013)
  6. Chen, Tianran; Li, Tien-Yien: Spherical projective path tracking for homotopy continuation methods (2012)
  7. Wan, Zhongping; Yuan, Liuyang; Chen, Jiawei: A filled function method for nonlinear systems of equalities and inequalities (2012)
  8. Zinin, M.V.: BIBasis, a package for REDUCE and Macaulay2 computer algebra systems to compute Boolean involutive and Gröbner bases (2012)
  9. Idrees, Nazeran; Pfister, Gerhard; Steidel, Stefan: Parallelization of modular algorithms (2011)
  10. Jorge, J.Santiago; Gulias, Victor M.; Freire, Jose L.: Certifying properties of an efficient functional program for computing Gröbner bases (2009)
  11. Sun, Yang; Tao, Yu-Hui; Bai, Feng-Shan: Incomplete Gröbner basis as a preconditioner for polynomial systems (2009)
  12. Lasserre, Jean Bernard; Laurent, Monique; Rostalski, Philipp: Semidefinite characterization and computation of zero-dimensional real radical ideals (2008)
  13. Lee, T.L.; Li, T.Y.; Tsai, C.H.: HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method (2008)
  14. Mityunin, V.A.; Pankratiev, E.V.: Parallel algorithms for Gröbner-basis construction (2007)
  15. Gunji, T.; Kim, S.; Fujisawa, K.; Kojima, M.: PHoMpara-parallel implementation of the polyhedral homotopy continuation method for polynomial systems (2006)
  16. Gerdt, V.P.; Yanovich, D.A.: Parallel computation of Janet and Gröbner bases over rational numbers (2005)
  17. Gonzalez-Vega, Laureano; Traverso, Carlo; Zanoni, Alberto: Hilbert stratification and parametric Gröbner bases (2005)
  18. Bompadre, A.; Matera, G.; Wachenchauzer, R.; Waissbein, A.: Polynomial equation solving by lifting procedures for ramified fibers (2004)
  19. Gunji, Takayuki; Kim, Sunyoung; Kojima, Masakazu; Takeda, Akiko; Fujisawa, Katsuki; Mizutani, Tomohiko: PHoM -- a polyhedral homotopy continuation method for polynomial systems (2004)
  20. Kim, S.; Kojima, M.: Numerical stability of path tracing in polyhedral homotopy continuation methods (2004)

1 2 next