• OPQ

  • Referenced in 384 articles [sw11881]
  • Orthogonal polynomials. Computation and approximation. Orthogonal polynomials are a widely used class of mathematical functions ... computer programs in Matlab downloadable from the Internet, to generate orthogonal polynomials of a great ... MATLAB SUITE OF PROGRAMS FOR GENERATING ORTHOGONAL POLYNOMIALS AND RELATED QUADRATURE RULES...
  • REDUCE

  • Referenced in 740 articles [sw00789]
  • capabilities include: expansion and ordering of polynomials and rational functions; substitutions and pattern matching ... functions and extending program syntax; analytic differentiation and integration; factorization of polynomials; facilities ... formats; facilities for generating optimized numerical programs from symbolic input; calculations with a wide variety...
  • SINGULAR

  • Referenced in 1408 articles [sw00866]
  • Tangent Cone algorithm. Furthermore, it provides polynomial factorizations, resultant, characteristic set and gcd computations, syzygy ... interactive shell and a C-like programming language, SINGULAR’s internal functionality is augmented...
  • FGb

  • Referenced in 242 articles [sw00286]
  • efficient program written in C for solving polynomial systems. The purpose of the FGb library...
  • Sostools

  • Referenced in 273 articles [sw00891]
  • optimization programs. SOSTOOLS can be used to specify and solve sum of squares polynomial problems ... intuitive high-level notation. Currently, the SOS programs are solved using SeDuMi or SDPT3, both...
  • CoCoA

  • Referenced in 631 articles [sw00143]
  • Poincare’ series and Hilbert functions, factorization of polynomials, toric ideals. The capabilities of CoCoA ... further enhanced by the dedicated high-level programming language. For convenience, the system offers...
  • SparsePOP

  • Referenced in 65 articles [sw04331]
  • SparsePOP: a sparse semidefinite programming relaxation of polynomial optimization problems. SparsePOP is a Matlab implementation ... semidefinite programming (SDP) relaxation method for approximating a global optimal solution of a polynomial optimization...
  • SDPpack

  • Referenced in 51 articles [sw04333]
  • semidefinite programs, which are generalizations of linear programs to the space of block diagonal, symmetric ... hard graph problems in polynomial time. Semidefinite programs are best solved by interior-point methods...
  • alphaCertified

  • Referenced in 45 articles [sw07351]
  • solutions to a square polynomial system. The program alphaCertified implements algorithms based on α-theory...
  • GloptiPoly

  • Referenced in 301 articles [sw04343]
  • after some transformation) of the GPM with polynomial data.The approach is similar to that used ... build up a hierarchy of semidefinite programming (SDP), or linear matrix inequality (LMI) relaxations...
  • SMRSOFT

  • Referenced in 36 articles [sw12217]
  • optimization over polynomials and dynamical systems study via SOS programming. SMRSOFT is a Matlab toolbox ... optimization problems over polynomials and studying dynamical systems via SOS programming. The main functions currently...
  • PHCpack

  • Referenced in 216 articles [sw00705]
  • been accomplished on exploiting structure in a polynomial system, in particular its sparsity. In this ... software package PHC is described. The main program operates in several modes, is menu-driven...
  • NCSOStools

  • Referenced in 17 articles [sw06920]
  • Hermitian squares (with commutators) programs for polynomials in NC variables. It can be used...
  • CRACK

  • Referenced in 57 articles [sw07754]
  • systems are obtained by using a computer program. A method to reduce the length ... bilinear algebraic systems is presented. The integrable polynomial vector evolution equations, quadratic Hamiltonians with ... studied. An overview of the computer algebra program CRACK used in this paper is given ... length-reduce differential equations is presented. The program CRACK is a computer algebra package written...
  • DISCOVERER

  • Referenced in 55 articles [sw07719]
  • Verification by Using DISCOVERER. Recent advances in program verification indicate that various verification problems ... short) solving. An SAS consists of polynomial equations and polynomial inequalities. Algorithms for quantifier elimination ... specific problems. To overcome the bottleneck of program verification with a symbolic approach ... work of complete discrimination systems of polynomials [33,31],, we invented new theories and algorithms...
  • CPOLY

  • Referenced in 15 articles [sw05303]
  • complex polynomial [C2] The subroutine CPOLY is a Fortran program to find all the zeros ... Traub [4]. (An algorithm for real polynomials is given in [5].) The algorithm is similar ... algorithms studied by Traub [1, 2]. The program finds the zeros one at a time ... deflates the polynomial to one of lower degree. The program is extremely fast...
  • INTBIS

  • Referenced in 31 articles [sw00442]
  • does not require programming if the equations are polynomials; it is structured for further algorithmic...
  • SecDec

  • Referenced in 31 articles [sw06834]
  • present a program for the numerical evaluation of multi-dimensional polynomial parameter integrals. Singularities regulated ... extracted using iterated sector decomposition. The program evaluates the coefficients of a Laurent series...
  • Gfan

  • Referenced in 113 articles [sw04698]
  • Gröbner basis. The tropical variety of a polynomial ideal is a certain subcomplex ... competitive in speed compared to programs such as CoCoA, Singular and Macaulay2...
  • Coxeter

  • Referenced in 22 articles [sw07827]
  • Coxeter is a computer program for the study of combinatorial aspects of Coxeter group theory ... Bruhat ordering and Kazhdan-Lusztig polynomials. It is written in C++, and should ... beta testing. The main capabilities of the program are the following : Reduced expression and normal ... form computations; Bruhat ordering; Ordinary Kazhdan-Lusztig polynomials; Kazhdan-Lusztig polynomials with unequal parameters; Inverse...