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

ISSN： 0747-7171

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

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

Solving Degenerate Sparse Polynomial Systems Faster

By Rojas J.M.

Journal of Symbolic Computation, Vol. 28, Iss. 1, 1999-07 ,pp. : 155-186

Academic Press

Access to resources Recommend Favorite

Homotopy Methods for Solving Variational Inequalities in Unbounded Sets

By Xu Qing Yu Bo Feng Guo-Chen

Journal of Global Optimization, Vol. 31, Iss. 1, 2005-01 ,pp. : 121-131

Springer Publishing Company

Access to resources Recommend Favorite

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

By Leykin Anton Verschelde Jan

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

Inderscience Publishers

Access to resources Recommend Favorite

On the Theories of Triangular Sets

By Aubry P. Lazard D. Maza M.M.

Journal of Symbolic Computation, Vol. 28, Iss. 1, 1999-07 ,pp. : 105-124

Academic Press

Access to resources Recommend Favorite

Complexity results for triangular sets

By Schost E.

Journal of Symbolic Computation, Vol. 36, Iss. 3, 2003-09 ,pp. : 555-594

Elsevier

Access to resources Recommend Favorite