In general, most numerical methods fall into the category of runge-kutta algorithms.
The first order runge kutta method is also known as Newtons method, and it is the simplest of all.
if you have dx/dt=f(x,t)
and have initial conditions x0,t0
then f(x0,t0)*dt=dx (note that here dt isn't actually dt, but it is a very small number called the stepsize- you probably know it as h)
the above equation can be verified using the identity (dx/dt)*dt=dx (also dx is not an actual dx, but it is the increment of x with respect to the stepsize of t)
then x0+dx=x1
and t0+dt=t1
the idea is to perform this many times setting dt as small as possible and provided the approximation is suitable it will converge to the correct answer.
There are higher order methods, The most popular(it is used by programs like mathematica by default) is the runge kutta forth order method, which is given by:
dx1 = dt*f(x0,t0)
dx2=dt*f(x0+dx1/2,t0+dt/2)
dx3=dt*f(x0+dx2/2,t0+dt/2)
dx4=dt*f(x0+dx3,t0+dt)
then
x1=x0+(dx1+2*dx2+2*dx3+dx4)/6
and
t1=t0+dt
The basic idea of this is to estimate the x stepsize with respect to a t stepsize at varrying points and average them together, putting the most weight at the middle points. The real proof of the method is far more fascinating, but this is the basic idea.
One popular method is to use estimation methods of differing orders, for example find the estimate using a third order method and another estimate using the 4th order method, and as long as the estimations are close enough to being equal, that means the estimation is converging already, while if the estimations are a way off, it indicates it isn't converging well enough, and a smaller step size is used. this is called adaptive stepsize, and can be very powerful.
Its really a pretty interesting area of study.