Root #1: x=O( 1 )

Iterations:

> G := x -> sort( expand( (-epsilon*x^2-1)/3 ) );

Initial approximation:

> x0 := -1/3;

Successive approximations: note that each iteration doubles the number of terms in the approximation but only one additional term converges to its final value.

> for k from 0 to 5 do

> x.(k+1) := G(x.k);

> od;

>