So I\'ve got a special case set of cubic splines, whose 2d control points will always result in a curve that will never cross itself in the x axis. That is, the cu
Often people will use a root finding technique (like Newton's Method) if an numerical approximation is good enough.
Well, you could solve your fx(t)=x for t. That would be a cubic equation; ugly but still possible to solve explicitely. If your spline is as you describe it, then two of the solutions will be conjugate complex, so the only remaining one is the one to take. Use that to compute y=fy(t). I doubt you can accompish anything easier if you want exact solutions.
You can use the general formula from Wikipedia to compute the solution of the cubic equation.
Your question states that you want evenly spaces x coordinates, and approximate solutions are all right. So I propose the following algorithm:
This will zoom in on the grid points, bisecting the parameter space in each step, and will come up with suitable parameters for all your grid points.