I reduced a (special case) of my problem to the following code. Even though in this special case all related functions are analytical, DSolve is not the tool for this, though I am indeed looking for a continuous function as a solution.
I am OK with looping over guesses for the function, though as a newbie, I can only give you some pseudocode. Your help would be greatly appreciated.
- Guess a g1, say a constant function.
- Take a list of points, and solve the given equation for g2[z] for each z in the list, with g2[z] being the value between z and next value in the list, while g1[z] above.
- Interpolate over the g2[z]-s to get a new g1, and iterate until g2[z] is close to g1[z] for each z.
Or is this a stupid algorithm?
H = ParetoDistribution[1.18709*10^6, 0.938482]
Hstar = H
k = 10/3
T[z_] = 2/3*z
DSolve[T'[z]/(1 - T'[z]) ==
k/(z PDF[Hstar, z]) Integrate[(1 - g[zz]) Exp[zz - z] PDF[H,
zz], {zz, z, \[Infinity]}], g, z]
Or if I shall proceed another way, what pattern should I exploit? What pattern could Mathematica exploit? And in what construct?

DSolve, notRSolve. – Heike May 20 '12 at 19:04RSolveis for recursive relations. – Sjoerd C. de Vries May 20 '12 at 19:06RSolvewhen you neededDSolve). People here are willing to help, but no one likes to run in circles... – rm -rf♦ May 20 '12 at 20:19