## Merging solutions of non-linear algebraic systems

Please always quote using this URN: urn:nbn:de:0297-zib-11769
• In solving large polynomial algebraic systems that are too big for standard Gröbner basis techniques one way to make progress is to introduce case distinctions. This divide and conquer technique can be beneficial if the algorithms and computer programs know how to take advantage of inequalities. A further hurdle is the form of the resulting general solutions which often have unnecessarily many branches. In this paper we discuss a procedure to merge solutions by dropping inequalities which are associated with them and, if necessary, by re-parametrizing solutions. In the appendix the usefulness of the procedure is demonstrated in the classification of quadratic Hamiltonians with a Lie-Poisson bracket $e(3)$. This application required the solution of algebraic systems with over 200 unknowns, 450 equations and between 5000 and 9000 terms.