Decomposing solution sets of polynomial systems: a new parallel monodromy breakup algorithm

ISSN： 1742-7185

Source： International Journal of Computational Science and Engineering, Vol.4, Iss.2, 2009-07, pp. : 94-101

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A new solution algorithm for solving rule‐sets based bilevel decision problems

CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE (ELECTRONIC), Vol. 27, Iss. 4, 2015-03 ,pp. : 830-854

John Wiley & Sons Inc

Access to resources Recommend Favorite

A new efficient algorithm for polynomial interpolation

By Smoktunowicz A. Wróbel I. Kosowski P.

Computing, Vol. 79, Iss. 1, 2007-02 ,pp. : 33-52

Springer Publishing Company

Access to resources Recommend Favorite

A Polynomial Algorithm for Diagnosability Analysis of Discrete Event Systems

International Journal of Adaptive, Resilient and Autonomic Systems (IJARAS), Vol. 6, Iss. 2, 2015-07 ,pp. : 1-22

IGI Global_journal

Access to resources Recommend Favorite

Modular Algorithm for Sparse Multivariate Polynomial Interpolationand its Parallel Implementation

By Murao H. Fujise T.

Journal of Symbolic Computation, Vol. 21, Iss. 4, 1996-04 ,pp. : 377-396

Academic Press

Access to resources Recommend Favorite

Triangular Sets for Solving Polynomial Systems: a Comparative Implementation of Four Methods

By Aubry P. Maza M.M.

Journal of Symbolic Computation, Vol. 28, Iss. 1, 1999-07 ,pp. : 125-154

Academic Press

Access to resources Recommend Favorite