The cubic is sufficiently venerable and sufficiently simple that there are numerous other ways to solve it. Here are three of the more notable; others can be found in, e.g., Galois' Theory of Algebraic Equations by J.-P. Tignol.
Tschirnhaus Substitution
The idea is to do a more sophisticated substitution for $x$ than the linear one that removes the quadratic term: we can suppose that we start in the form
$$ x^3 + px + q = 0 , $$
as it makes the calculations simpler. Since a linear substitution can be used to remove one term, one may suspect that a more general substitution can be used to remove more terms, and in particular, if we put $ y = \alpha x^2 + \beta x + \gamma $, we might hope to choose the coefficients so that both the linear term and the quadratic term vanish at the same time. This turns out to be the case, but first we must eliminate $x$ from the two equations. We have
$$ \begin{align}
(y-\gamma)^2 &= x^2 (\alpha x + \beta)^2 = (\alpha^2 x + 2\alpha\beta) x^3 + \beta^2 x^2 \\
&= -(\alpha^2 x + 2\alpha\beta) (px+q) + \beta^2 x^2 \\
&= (-p\alpha^2 + \beta^2)x^2 - \alpha(q\alpha + 2p\beta )x -2\alpha\beta q
\end{align}$$
and
$$ \begin{align}
(y-\gamma)^3 &= x^3(\alpha x+\beta)^3 \\
&= -(px+q)(\alpha^3 x^3 + 3\alpha^2 \beta x^2 + 3\alpha \beta^2 x + \beta^3 ) \\
&\vdots \\
&= ( p^2\alpha^2 - 3q\alpha\beta - 3p\beta^2 ) \alpha x^2 + ( 2pq\alpha^3+ 3p^2 \alpha^2\beta - 3q\alpha\beta^2 - p\beta^3 ) x + (q\alpha^3+3p\alpha^2 \beta - \beta^3) \end{align}$$
A straightforward calculation then shows that
$$ 0 = (y-\gamma)^3 + 2p\alpha (y-\gamma)^2 + (p^2\alpha^2+3q\alpha\beta + p\beta^2 ) + q(-q\alpha^3 + p\alpha^2\beta -\beta^3) , $$
and then we can expand the brackets to get
$$ 0 = y^3 + (2p\alpha-3\gamma) y^2 + ( p^2\alpha^2 + 3q\alpha\beta + p\beta^2 -4p\alpha\gamma+3\gamma^2 ) y + \text{const.}, $$
where the constant is both ugly and unimportant. In particular, we can force the $y^2$ term to vanish by taking $\gamma = 2p\alpha/3$. This then leaves
$$ 0 = y^3 + ( -\tfrac{1}{3} p^2\alpha^2 + 3q\alpha\beta + p\beta^2 ) y + \text{const.} $$
At this point we see that we lose nothing by taking $\alpha=1$, and thus the solution of the cubic has been reduced to the solution of the equations
$$ -\tfrac{1}{3} p^2 + 3q\beta + p\beta^2 = 0 \\
y^3 + \text{const.} = 0 \\
x^2 + \beta x + \tfrac{2}{3}p - y = 0 ,
$$
all of which are at worst quadratic or just require finding a cube root.
Bézout's Method
This method was first considered by Bézout, and in a slightly different form by Euler. The idea is that by eliminating $z$ between the equations
$$ x = a_0 + a_1 z + \dotsb + a_{n-1} z^{n-1} \\
z^n = 1 , $$
we obtain an equation of degree $n$, and the idea is to make it the right equation of degree $n$. But we know the solutions to $z^n=1$, namely the $n$th roots of unity. So eliminating $z$, the remaining equation can be written in the form
$$ \prod_{\omega} (x-(a_0+a_1 \omega + \dotsb + a_{n-1}\omega^{n-1})) = 0 . $$
It remains to choose the $a_i$ appropriately. Of course the dream is to do this for any equation, but for degree higher than $4$, the degree of the equations one needs to solve becomes higher than that of the original equation, so is a complete nonstarter. But for cubics, we can manage: if
$$ x^3 + bx^2+cx+d = 0 $$
is the equation, we have
$$ 0 = ( x - (a_0+a_1+a_2) )( x - (a_0+a_1 \omega + a_2 \omega^2) )( x - (a_0+a_1 \omega^2+a_2 \omega) ), \tag{1} $$
where $\omega$ is now a fixed primitive cube root of unity. Expanding and using that $1+\omega+\omega^2=0$, we obtain
$$ (x-a_0)^3 - 3a_1 a_2 (x-a_0) -a_1^3 -a_2^3 = 0 . $$
or
$$ x^3 - 3a_0 x^2 + 3(a_0^2 - a_1 a_2) x +(- a_0^3 - a_1^3 - a_2^3 + 3a_0 a_1 a_2) = 0 $$
We now solve the equations
$$ -3a_0 = b \\
3(a_0^2 - a_1 a_2) = c \\
- a_0^3 - a_1^3 - a_2^3 + 3a_0 a_1 a_2 = d ; $$
the first is linear and gives $a_0=b/3$, and the other two become
$$ a_1 a_2 = \frac{b^2-3c}{9} \\
a_1^3 + a_2^3 = d + \frac{2}{27} b^3 - \frac{bc}{3} ,
$$
which when one of the unknowns is eliminated becomes a bicubic equation for the other.
This is not surprising: we know that if $a_1$ is a solution, so are $\omega a_1$ and $\omega^2 a_1$, which means that $a_1^3$ has fewer possible values than $a_1$. This is key in the next method.
Lagrange Resolvents
Lagrange develops the first general ideas about how solvability by radicals should be built up, by observing how various methods, including those given above, work. Key in the theory is what happens to expressions containing the roots when the roots themselves are permuted, and it is this that eventually leads to what we now call Galois theory (in its original incarnation as the most general method for understanding the structure of solutions of equations using permutations of the roots).
For the sake of simplicity, take the same cubic equation as the previous section. Notice that if the roots are $x_1,x_2,x_3$, we can specify from $(1)$ that
$$ x_1 = a_0 + a_1 + a_2 \\
x_2 = a_0 + \omega a_1 + \omega^2 a_2 \\
x_3 = a_0 + \omega^2 a_1 + \omega a_2 , $$
and so the $a_i$ can be expressed in terms of the $x_j$, as
$$ a_i = \frac{1}{3} \sum_{j=1}^3 \omega^{-ij} x_j , $$
by taking linear combinations of the equations.
Suppose now that we relabel the roots. What happens to the $a_i$? There are $6$ possible ways to label the roots, so each $a_i$ can take at most $6$ values. But they certainly don't all take this many: we have
$$ 3a_0 = x_1 + x_2 + x_3 = -b $$
by one of Vieta's formulae. On the other hand, a straightforward calculation shows that $a_1$ does generally have $6$ different values.
Lagrange proves that if an expression has $n$ different values under all the permutations of the roots, it is the root of an equation of degree $n$, the coefficients of which are rational functions of the coefficients of the original equation. So $a_1$ is the root of an equation of degree $6$. On the other hand, $a_1^3$ takes only $2$ different values under permutations of the roots: notice that
$$ (x_1+\omega x_2+ \omega^2 x_3)^3 = (x_2+ \omega x_3 + \omega^2 x_1)^3 = ( x_3 + \omega x_1 + \omega^2 x_2 )^3 \\
(x_2+\omega x_1+ \omega^2 x_3)^3 = (x_1+ \omega x_3 + \omega^2 x_2)^3 = ( x_3 + \omega x_2 + \omega^2 x_1 )^3 , $$
using $\omega^3=1$. Therefore Lagrange tells us that $a_1^3$ is a root of a quadratic equation, namely
$$ (y-(\tfrac{1}{3}(x_1+\omega x_2+ \omega^2 x_3))^3)(y-(\tfrac{1}{3}(x_2+\omega x_1+ \omega^2 x_3))^3) = 0 , $$
which we can show is
$$ y^2 + \tfrac{1}{27}(2b^3-9bc+27d)y + \tfrac{1}{729}(b^2-3c)^3 = 0 \tag{2} $$
using the rest of Vieta's formulae for a cubic. This is the same quadratic that keeps appearing!
Finally, Lagrange proves an even stronger result: that if $V$ is an expression in the roots that does not change its value under a certain subset of the permutations of the roots, and $U$ is an expression that takes $m$ values under this subset, then $U$ is a root of an equation of degree $m$ with coefficients rational functions of $V$ and the coefficients of the equation. This is rather more than we need here, because if we take $V = (x_1+ \omega x_2 + \omega^2 x_3 )^3$, then we know that $ U = (x_1+ \omega x_2 + \omega^2 x_3)/3 $ has three different values under the permutations that fix $V$, namely $\sqrt[3]{V}, \omega \sqrt[3]{V} $ and $\omega^2 \sqrt[3]{V}$, obviously the solutions to
$$ u^3 = V . $$
But now we know that only one permutation fixes $U$, namely the identity, and Lagrange's result implies that $x_1$ is the root of an equation of degree $1$ with coefficients rational functions of $U$ and the original equation's coefficients; i.e. a rational function of $U,b,c,d$. In particular,
$$ x_1 = -\frac{b}{3} + U + \frac{b^2-3c}{9U} , $$
the other roots coming from other values of $U$.
In a certain sense this process, of finding expressions that take only a few values under certain sets of permutations, is the only way to solve equations algebraically: one can do a similar analysis of Tschirnhaus's method, although it's a lot messier. But in the case of the cubic, there is essentially only one way to do this, the way we have just given. This means that any algebraic (as opposed to transcendental, using trigonometric or hyperbolic functions) calculation of the roots will go via the quadratic $(2)$ at some point.
I presume you're treating $z^{4/3}$ as a multivalued function, and you're allowing any $z$ such that any branch of $z^{4/3}$ is $2$.
By definition, $z^{4/3} = \exp((4/3) \log(z))$ where $\log(z)$ is any branch of the logarithm of $z$. If $\text{Log}(z)$ is the principal branch (with imaginary part in $(-\pi, \pi]$), the other branches of $\log(z)$ are
$\text{Log}(z) + 2 \pi i n$ for arbitrary integers $n$,
and the corresponding branches of $z^{4/3}$ are
$\exp((4/3) \text{Log}(z) + (8 \pi i n/3))$. There are three
possibilities, corresponding to the values of $n \mod 3$.
Now this is supposed to be $-2 = 2 \exp(\pi i)$. Thus for
$n \equiv 0 \mod 3$, $$2 = \exp((4/3) \text{Log}(z) - \pi i)$$
where $\text{Im}((4/3) \text{Log}(z) - \pi i) = 0$ and $\text{Re}((4/3) \text{Log}(z) = \text{Log}(2)$. We get either $\text{Log}(z) = (3/4) \text{Log}(2) + 3 \pi i/4$, i.e. $z = 2^{3/4} e^{3 \pi i/4}$, or $\text{Log}(z) = (3/4) \text{Log}(2) - 3 \pi i/4$, i.e. $z = 2^{3/4} e^{-3\pi i/4}$.
(this $2^{3/4}$ being the real $3/4$ power).
For $n \equiv 1 \mod 3$, $$2 = \exp((4/3) \text{Log}(z) + 5 \pi i/3)= \exp((4/3) \text{Log}(z) - \pi i/3$$ where
$\text{Im}((4/3) \text{Log}(z) - \pi i/3 = 0$. We get
$\text{Log}(z) = (3/4) \text{Log}(2) + \pi i/4$, or
$z = 2^{3/4} e^{\pi i/4}$.
For $n \equiv 2 \mod 3$, $$2 = \exp((4/3) \text{Log}(z) + 13 \pi i/3) = \exp((4/3) \text{Log}(z) + \pi i/3$$ where
$\text{Im}((4/3) \text{Log}(z) + \pi i/3 = 0$. We get
$\text{Log}(z) = (3/4) \text{Log}(2) - \pi i/4$, or
$z = 2^{3/4} e^{-\pi i/4}$.
So there are indeed four solutions. However,
if you try to verify these with Mathematica or most other computer algebra systems, they won't all work, as they like to use the principal branch rather than multivalued functions.
Best Answer
The formula for $x$ and $z$ in the link is
$$ x = z - \frac{p}{3z} - \frac{b}{3a} \qquad \text{and}\qquad z = \sqrt[3]{-\frac{q}{2} \pm \sqrt{D}}, $$
where $p$, $q$, and $D$ are defined by
$$ p = -\frac{b^2}{3a^2} + \frac{c}{a}, \qquad q = \frac{2b^3}{27a^3} - \frac{bc}{3a^2} + \frac{d}{a}, \qquad\text{and}\qquad D = \frac{q^2}{4} + \frac{p^3}{27}. $$
Applying this to $-2x^3+3x^2-x+5=0$, we obtain
$$ p = -0.25, \qquad q = -2.5, \qquad D \approx 1.56192. $$
Then the six possible values of $z$, denoted by
$$ z_{k,\pm} = e^{2k\pi i/3} \sqrt[3]{-\frac{q}{2} \pm \sqrt{D}}, $$
are given by
\begin{align*} z_{0,+} &\approx 1.35717 & \Rightarrow \quad x &\approx 1.91857, \\ z_{1,+} &\approx -0.678583 + 1.17534 i & \Rightarrow \quad x &\approx -0.209285 + 1.12216 i, \\ z_{2,+} &\approx -0.678583 - 1.17534 i & \Rightarrow \quad x &\approx -0.209285 - 1.12216 i, \\ z_{0,-} &\approx 0.0614024 & \Rightarrow \quad x &\approx 1.91857, \\ z_{1,-} &\approx -0.0307012 + 0.0531761 i & \Rightarrow \quad x &\approx -0.209285 - 1.12216 i, \\ z_{2,-} &\approx -0.0307012 - 0.0531761 i & \Rightarrow \quad x &\approx -0.209285 + 1.12216 i. \\ \end{align*}
So I suspect that you made some mistakes. Note that, when computing $z_{k,-}$'s, you have to work with the expression
$$ -\frac{q}{2} - \sqrt{D} $$
where
$$-\frac{q}{2} = 1.25 \qquad\text{and}\qquad \sqrt{D} \approx 1.2497684970810779307.$$
Since these values are very close, their difference leads to the loss of several significant digits. For instance, if we use six digits, then
$$ -\frac{q}{2} - \sqrt{D} \approx (1.25) - (1.24977) = 0.00023, $$
losing four digits in the process! Now, given that you are working under only three significant digits, you will almost certainly lose all the significant digits in this process, ending up with quantities dominated by rounding errors. I strongly suspect that this is the source of your incorrect answer.