These pages are just a test. It describes quickly problems, algorithms, classes of polynomial systems and their connections. Of course, it is not complete and a more detailed description should be given for each algorithm. The object oriented approach is used for constructing this graph. Derivation represents connections between the algorithms. Algorithm A1 derived from A2 and A3, if the output of A2 or A3 can be used as input for A1.

General problems

Solve Solving a multivariate polynomial system

Algorithms

Bezoutian_Matrix Construction of the bezoutian
Count_the_real_solutions Count the number of real solutions
Count_the_solutions Count the number of solutions
Eigenvector Eigenvector computations
Elimination_of_variables Eliminate variables
Grobner Grobner computations
Hermite Hermite quadratic form
Mix_Volume Mix volume
Real_Solve Compute the real solutions of a multivariate polynomial system
Residue Compute the residue
Resultant_Matrix Construction of resultant matrices
RUR Rational univariate representation
Table_of_Multiplication Table of multiplications
Uni_Solve Solve a univariate polynomial
Uspensky Uspensky

Class of systems

General_System General System
Complete_Intersection Complete Intersection
Generic_Complete_Intersection Generic Complete Intersection

hierarchy of classes

generated by doc++

Table of contents

General problems

Algorithms

Class of systems