What implementation does sage use for solve?

edit

What algorithm does maxima use then? There are numerious methods to solve polynomials like Durand-Kerner...

We have to check. Note however that the Durand-Kerner algorithm is numerical, while the solve function will try to give you the solutions as symbolic expressions involving nth roots:

sage: solve(2*x^2-7==0,x)
[x == -1/2*sqrt(7)*sqrt(2), x == 1/2*sqrt(7)*sqrt(2)]

So is it safe to say that say that Sage solves polynomials analytically instead of numerically? Do you know how they implement such algorithm? You would think that a computer solves factorization nummerically since it can easilly calculate a lot of numbers with decent precision.

So is it safe to say that say that Sage solves polynomials analytically instead of numerically?

Yep, when possible. When not possible (degree >=5, and no "obvious" paths to an explicit solution, Sage can compute root values in QQbar, which can be thought of as objects representing algorithms, computable to arbitrary precision and are treated as exact numbers by "the rest of Sage".

Do you know how they implement such algorithm?

Tou are welcome to read the source ;-) (translation : I don't know, do not know enough to know where to start...).

You would think that a computer solves factorization numerically since it can easily calculate a lot of numbers with decent precision.

That's more or less what happens when an explicit solution (first intention goal) does not exist.

You could also ask on the Maxima mailing lists: https://maxima.sourceforge.io/maximal...