• OPQ

  • Referenced in 423 articles [sw11881]
  • Orthogonal polynomials. Computation and approximation. Orthogonal polynomials are a widely used class of mathematical functions...
  • PHCpack

  • Referenced in 236 articles [sw00705]
  • solver for polynomial systems by homotopy continuation. Polynomial systems occur in a wide variety ... reliable and powerful methods to compute numerically approximations to all isolated complex solutions. During ... been accomplished on exploiting structure in a polynomial system, in particular its sparsity. In this...
  • DDE-BIFTOOL

  • Referenced in 333 articles [sw02396]
  • steady state solutions is achieved through computing approximations and corrections to the rightmost characteristic roots ... connecting orbits are computed using piecewise polynomial collocation on adaptively refined meshes...
  • CompEcon

  • Referenced in 50 articles [sw04789]
  • integrated set of routines for function approximation using polynomial, splines and other functional families...
  • ApaTools

  • Referenced in 17 articles [sw01344]
  • ApaTools: a software toolbox for approximate polynomial algebra Approximate polynomial algebra becomes an emerging area ... present a software toolbox ApaTools for approximate polynomial algebra. This package includes Maple and Matlab...
  • na10

  • Referenced in 50 articles [sw11511]
  • computing polynomial zeros, based on Aberth’s method, is presented. The starting approximations are chosen ... zeros of the polynomial contained in each annulusA i. As starting approximations we choosek ... that the computed approximations are the exact zeros of a “nearby” polynomial. This implies ... tests performed with more than 1000 polynomials having degrees from...
  • SparsePOP

  • Referenced in 66 articles [sw04331]
  • SparsePOP: a sparse semidefinite programming relaxation of polynomial optimization problems. SparsePOP is a Matlab implementation ... relaxation method for approximating a global optimal solution of a polynomial optimization problem (POP) proposed ... relaxation exploits a sparse structure of polynomials in POPs when applying “a hierarchy ... Lasserre [2006]. The efficiency of SparsePOP to approximate optimal solutions of POPs is thus increased...
  • Eigensolve

  • Referenced in 25 articles [sw11986]
  • iterated eigenvalue algorithm for approximating roots of univariate polynomials. The author studies an iterative algorithm ... that approximates all roots of a univariate polynomial. The iteration is based on floating-point...
  • Chebpack

  • Referenced in 15 articles [sw09244]
  • method is applied to find Chebyshev polynomial approximations for the solutions of pantograph differential equations...
  • VFGEN

  • Referenced in 14 articles [sw00995]
  • generating C code to compute Taylor polynomial approximations (of any given order) to the solution...
  • sobol.cc

  • Referenced in 65 articles [sw36024]
  • algorithm to generate Sobol’ sequences to approximate integrals in up to 40 dimensions has been ... polynomials and “direction numbers” so as to allow the generation of Sobol’ sequences to approximate...
  • GPGCD

  • Referenced in 9 articles [sw06224]
  • GPGCD: an approximate polynomial GCD library We present an extension of our GPGCD method ... method for calculating approximate greatest common divisor (GCD) of univariate polynomials, to multiple polynomial inputs ... degree, our algorithm finds a pair of polynomials which has a GCD of the given ... GPGCD method, the problem of approximate GCD is transferred to a constrained minimization problem, then...
  • GloptiPoly

  • Referenced in 322 articles [sw04343]
  • intended to solve, or at least approximate, the Generalized Problem of Moments (GPM), an infinite ... GloptiPoly 3 can handle moment problems with polynomial data. Many important applications in e.g. optimization...
  • SDPpack

  • Referenced in 51 articles [sw04333]
  • computing provably good approximations to NP-hard graph problems in polynomial time. Semidefinite programs...
  • ORBIT

  • Referenced in 38 articles [sw20552]
  • function evaluations than the polynomial models considered by present techniques. Approximation guarantees are obtained...
  • Tyrolean

  • Referenced in 89 articles [sw07830]
  • Current (non-)termination techniques include: approximated dependency graph, argument filtering, bounds, dependency pair method, Knuth ... lexicographic path order, loop detection, matrix interpretation, polynomial interpretation, predictive labeling, recursive SCC, root-labeling...
  • Hyper2d

  • Referenced in 8 articles [sw01972]
  • measure provides a simple and powerful polynomial approximation method on rectangles. Here, we present...
  • SLRA

  • Referenced in 24 articles [sw11262]
  • software for the approximate GCD problem of multiple univariate polynomials in the weighted 2-norm...
  • NACLab

  • Referenced in 17 articles [sw14672]
  • hypersensitive algebraic problems from approximate data. Intuitive polynomial computation interface in Matlab. Soving linear equation...
  • ParetoImageSDP

  • Referenced in 13 articles [sw28194]
  • Magron, Didier Henrion and Jean-Bernard Lasserre ”Approximating Pareto curves using semidefinite relaxations ... arxiv). 2) Images of semialgebraic sets under polynomial applications implementing the two methods described ... Jean-Bernard Lasserre ”Semidefinite approximations of projections and polynomial images of semialgebraic sets” (on Optimization...