• DDE-BIFTOOL

  • Referenced in 326 articles [sw02396]
  • their Floquet multipliers and connecting orbits are computed using piecewise polynomial collocation on adaptively refined...
  • RAGlib

  • Referenced in 64 articles [sw00774]
  • study of real solutions of polynomial systems of equations and inequalities such as testing ... emptiness or computing sampling points in each connected component of their real solution set. RAGlib ... RAGlib Maple package allows to solve polynomial systems of equations/inequalities over the reals. Provided functionalities ... compute sample points in each connected component of the real solution...
  • Invar

  • Referenced in 34 articles [sw00446]
  • dimensional metric-compatible connection. The package can maximally simplify any polynomial containing tensor products...
  • Adinkras

  • Referenced in 26 articles [sw09383]
  • dimension, and a connection between rankings and the chromatic polynomial for certain graphs...
  • PolyLib

  • Referenced in 47 articles [sw09923]
  • Wilde at IRISA, in Rennes, France, in connection with the ALPHA project. This first version ... included parameterized vertices computation. PolyLib3.14 includes Ehrhart polynomials computation, which permits to count the number...
  • Bertini_real

  • Referenced in 13 articles [sw09933]
  • homotopy continuation to solve a series of polynomial systems via regeneration from a witness ... real vertices is computed, along with connection information and associated homotopy functions. The challenge...
  • SOSOPT

  • Referenced in 12 articles [sw13407]
  • formulating and solving Sum-of-Squares (SOS) polynomial optimizations. This document briefly describes ... options. Finally, Section 3 briefly reviews the connections between SOS optimizations and semide?nite programs...
  • CCOP

  • Referenced in 1 article [sw27846]
  • CCOP Connection coefficients for orthogonal polynomials (NETLIB library Numeralgo (http://www.netlib.org/numeralgo/) as na34 package...
  • TSSOS

  • Referenced in 8 articles [sw36859]
  • term (or monomial) sparsity of the input polynomials to obtain a new converging hierarchy ... iterative procedure performing completion of the connected components of certain adjacency graphs. The graphs ... then applied to compute lower bounds for polynomial optimization problems either randomly generated or coming...
  • TorchLight

  • Referenced in 4 articles [sw13534]
  • connections between causal graph structure and $h+$ topology. This results in low-order polynomial time...
  • HOSIM

  • Referenced in 7 articles [sw38402]
  • based upon new high-order spatial connectivity measures, termed high-order spatial cumulants. The HOSIM ... distributions are generated using weighted orthonormal Legendre polynomials, which in turn define the so-called...
  • PDDE-BIFTOOL

  • Referenced in 1 article [sw19540]
  • their Floquet multipliers and connecting orbits are computed using piecewise polynomial collocation on adaptively refined...
  • LLL Factorization

  • Referenced in 2 articles [sw28660]
  • that we are looking for an irreducible polynomial means that we must look ... algorithm. In this development we formalize this connection and thereby one main application ... algorithm to factor square-free integer polynomials which runs in polynomial time. The work...
  • LPH

  • Referenced in 3 articles [sw26522]
  • isolated solutions to a special class of polynomial systems. The root number bound of this ... used to find witness points on each connected component of a real variety...
  • MPP

  • Referenced in 2 articles [sw13381]
  • framework for distributed polynomial computations. There are obvious advantages to providing communication links between independent ... computational resources. The challenge of providing connectivity is to produce homogeneity in a heterogeneous environment ... context of applications specially designed for polynomial computations. Our solution uses the Multi Protocol...
  • THEOPOGLES

  • Referenced in 2 articles [sw10105]
  • Bendix completion procedure working on First-Order Polynomials. The method does not need special ... which is used for example in the Connection Graph Procedure...
  • Perron Frobenius

  • Referenced in 2 articles [sw28597]
  • applying Sturm’s method can decide the polynomial growth of An. We formalize the Perron ... form (JNF) library, we further develop a connection which allows us to easily transfer theorems ... between HMA and JNF. With this connection we derive the combined result ... strictly larger than one, then An is polynomially bounded...
  • borderbasix

  • Referenced in 1 article [sw16958]
  • provides a versatile family of tools for polynomial computation with modular arithmetic, floating point arithmetic ... these various types of coefficients. A connection with SDP solvers has been integrated ... border basis computation. Extensive benchmarks on typical polynomial systems are reported, which show the very...
  • RGCNN

  • Referenced in 1 article [sw36662]
  • polynomial approximation. In particular, we update the graph Laplacian matrix that describes the connectivity...
  • CayleyNets

  • Referenced in 4 articles [sw38090]
  • class of parametric rational complex functions (Cayley polynomials) allowing to efficiently compute spectral filters ... size of the input data for sparsely-connected graphs, and can handle different constructions...