Database of Polynomial Systems

swMATH38682MaRDI QIDQ54382FDOQ54382

Author name not available (Why is that?)

Cited In (9)

• PHoMpara-parallel implementation of the polyhedral homotopy continuation method for polynomial systems
• An efficient algorithm for range computation of polynomials using the Bernstein form
• A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations
• Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach
• A dynamic F4 algorithm to compute Gröbner bases
• Formalization of Bernstein polynomials and applications to global optimization
• BIBasis, a package for REDUCE and Macaulay2 computer algebra systems to compute Boolean involutive and Gröbner bases
• Computing all nonsingular solutions of cyclic-\(n\) polynomial using polyhedral homotopy continuation methods
• Parallelization of triangular decompositions: techniques and implementation

This page was built for software: Database of Polynomial Systems