The simplest way to approach this problem is to use the "rational root theorem".
If r is a rational number satisfying a_nx^n+ a_{n-1}x^{n-1}+ \cdot\cdot\cdot+ a_1x+ a_0= 0 where the coefficients are all integers, then r= p/q where p is an integer evenly dividing a_0 and q is an integer evenly dividing a_n.
Of course, it is not necessary than such an equation have
any rational roots but it is worth trying. Here, the leading coefficient, a_n, is 9, which has factors \pm 1, \pm 3, \pm 9 and the constant term, a_0 is 1, which has factors \pm 1 so the only possible rational roots are \pm 1, \pm 1/3, \pm 1/9.
Putting those into the equation, we see that if
9(1)^4+ 9(1)^3- 4(1)^2- 3(1)+ 1= 19- 7= 12\ne 0
9(-1)^4+ 9(-1)^3- 4(-1)^2- 3(-1)+ 1= -9+ 9- 4+ 3+ 1= -1+1= 0
9(1/3)^4+ 9(1/3)^3- 4(1/3)^2- 3(1/3)+ 1= 1/9+ 1/3- 4/9- 1+ 1= 1/3- 1/3- 1+ 1= 0
We can stop here. Seeing that x= -1 and x= 1/3 are roots, we can divide by x+ 1 and x- 1/3 (
not "0.3333") to get a quadratic equation that we can solve using the quadratic formula.
(There
is a "quartic formula",
http://www.sosmath.com/algebra/factor/fac12/fac12.html, but it is extermely complicated.)