Your system is equivalent to the following 2 equations. Note that the first one contains only y, and the second is linear in x. I found them by computing the Groebner basis.
Your system is equivalent to the following 2 equations. Note that the first one contains only y, and the second is linear in x. I found them by computing the Groebner basis.
In the plane, if a or c, g or i are non-zero, each of two equations defines one of following objects: circle, ellipse, hyperbole, one or two lines, or null set. It depends on all coefficients in the equation.
Could you tell us the values of a,b,...,k ? The solution (from 0 to 4 ordered pairs (x,y), or infinity) can be not only computed but also nicely visualized.
Could you tell us what do you mean by "solving" ? What kind of information do you expect on the solutions since this information clearly depends on some indeterminate that might be considered as parameters.
You will get quite enormous expressions ... either by hand or automatically.
Automatically, Maple will give you the answer using the command allvalues(solve({q1,q2},{x,y})).
but it is ... enormous.
If you want to check why it is so enormous, do almost the same computation as Maple by hand : compute the resultant of the two equations wrt x and then you vill get a polynomial of degree 4 in y. You can then express all its roots (which are then all the y coordinates when a and g are not null) wrt the parameters using radicals supposing that the leading coefficient is not null. It is then sufficient to plug each of them in the two initial equations in x and again solve them manually (they both are of degree 2).