PoSSo

From MaRDI portal
Revision as of 20:07, 5 March 2024 by Import240305080343 (talk | contribs) (Created automatically from import240305080343)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Software:16816



swMATH4646MaRDI QIDQ16816


No author found.





Related Items (32)

Homotopy continuation method for solving systems of nonlinear and polynomial equationsOn deflation and multiplicity structureCompact representation of polynomials for algorithms for computing Gröbner and involutive basesEfficiency estimate for distributed computation of Gröbner bases and involutive basesPHoMpara-parallel implementation of the polyhedral homotopy continuation method for polynomial systemsPolynomial equation solving by lifting procedures for ramified fibersParallelization of triangular decompositions: techniques and implementationUnmixing the mixed volume computationParallelization of modular algorithmsInvolutive bases algorithm incorporating F\(_5\) criterionAn analysis of inhomogeneous signature-based Gröbner basis computationsA survey on signature-based algorithms for computing Gröbner basesUnnamed ItemParallel algorithms for Gröbner-basis constructionComputer Algebra in Scientific ComputingMixed cell computation in HOM4psSpherical projective path tracking for homotopy continuation methodsBIBasis, a package for REDUCE and Macaulay2 computer algebra systems to compute Boolean involutive and Gröbner basesPHoM -- a polyhedral homotopy continuation method for polynomial systemsNumerical stability of path tracing in polyhedral homotopy continuation methodsOn the use of Buchberger criteria in \(\mathrm G^2\mathrm V\) algorithm for calculating Gröbner basesParallel modular computation of Gröbner and involutive basesA filled function method for nonlinear systems of equalities and inequalitiesParallel computation of Janet and Gröbner bases over rational numbersHOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation methodAlgorithm 835Incomplete Gröbner basis as a preconditioner for polynomial systemsCertifying properties of an efficient functional program for computing Gröbner basesSemantic-Aware Fingerprints of Symbolic Research DataCertifying Isolated Singular Points and their Multiplicity StructureSemidefinite characterization and computation of zero-dimensional real radical idealsAlgorithm 795


This page was built for software: PoSSo