How to solve decics like $x^{10}+100x^2+160x+64=0$ having Galois group 10T33? Using the approach described in Smart way to solve octics like $x^8+5992704x-304129728=0$ (the method DecomPoly available in GAP) the decic quadrinomial from this question can be decomposed into two quintics:
$$x^{10}+100x^2+160x+64=(x^5+10ix+8i)(x^5-10ix-8i)$$
where $i$ is the imaginary unit. But here I got stuck. How to get explicit formula for roots of those solvable quintic trinomials?
I have tried to use the RadiRoot's method RootsOfPolynomialAsRadicals but without success. It seems Galois group 10T33 of the original quadrinomial is too big, and the method does not accept (quintic) polynomials with complex coefficients.

I am afraid the answer will be too complicated for me, but still have hope there is some tool / built-in method that can run calculations without too deep digging into Galois theory...
 A: A big difference to Smart way to solve octics like $x^8+5992704x-304129728=0$
is that in the prior example the field $E$ defined by the polynomial $f$ (of degree 8) had a subfield $S$ (of degree 4) over which it is quadratic. Thus finding the subfield reduced everyting to the degree $\le 4$ formulas.
Here you have two difficulties. The first is that -- while there still is a subfield -- the degree over this subfield is 5. So you cannot use a generic formula, but would need to go into the generic Galois theory machinery with resolvent, roots of unity etc. for degree $\ge 5$.
The second difficulty is that the $E$ as extension of $S$ will have Galois group not cyclic, but of order $20$. You thus will have to do three steps, corresponding to the composition series of the Frobenius group of order $20$.
This can be done (even without need to go to hypergeometric series, as Mathematica seems to do), but the resulting expression in radicals will, in all likeness, be a nightmare, and if you are just looking for the result "out of curiosity" most likely not be worth the effort.
A: Since both quintic factors are in Bring–Jerrard normal form, Malfatti's method (described here) may be applied. Consider the following mpmath program (so all roots are principal unless otherwise stated):
#!/usr/bin/env python3
from mpmath import *

i = root(-1, 2, s)
a = sqrt(1+2*i)
l1 = [1, 4*(-2 + i + a - i*a)/5, 4*(-7*a + i*a)/3125]
z1 = root(polyroots(l1)[0], 5, n1)
z2 = root(polyroots(l1)[1], 5, n2)
l2 = [1, 4*(-2 + i - a + i*a)/5, 4*(+7*a - i*a)/3125]
z3 = root(polyroots(l2)[0], 5, n3)
z4 = root(polyroots(l2)[1], 5, n4)
r = z1 + z2 + z3 + z4
print(polyval([1, 0, 0, 0, 10*i, 8*i], r))

Then for $s=0,1$ the $n_i$ must be set to these values so that $r$ will end up being a root of the quintic beneath it:
$$s=0:\begin{array}{cccc}
n_1&n_2&n_3&n_4\\
0&4&1&0\\
1&3&4&2\\
2&2&2&4\\
3&1&0&1\\
4&0&3&3\end{array}\qquad s=1:\begin{array}{cccc}n_1&n_2&n_3&n_4\\
0&1&4&0\\
1&0&2&2\\
2&4&0&4\\
3&3&3&1\\
4&2&1&3\end{array}$$
Since it is easy to solve a quadratic, this leads to explicit reproducible formulas for all the initial decic's roots.
