Longest path search

A global Picard iteration

Lutz Lehmann has a lovely trick for making Picard iterations converge globally. (That is, without needing to "stitch together" solutions for different small intervals of time.)

Specifically, we wish to solve the ODE y(t)=f(t,y(t))from 0tT, where f(t,·) is Lipschitz with constant L for all t and y𝐑n, say. Then, pick your favorite norm · over 𝐑n and you can easily show that the Picard operator Φ, defined

Φ(y)(t)=0tf(t,y(t))dt

is contractive with respect to the (complete, of course) norm ·L defined

yL=sup0tTeLty(t).

By Banach, this converges globally, and we're done. The link has it only for the linear case, but the extension is fairly obvious.

The inspiration here seems to come from Gronwall's inequality when f is uniformly Lipschitz in its second argument. This bounds the growth of y (if a solution y to the ODE exists) as roughly exp(Lt) when f(t,0) is not too large over t.

It reminds me a lot of the Chernoff bound trick which is used to "strengthen" Markov's inequality to a much stronger one when the function is relatively nice. (Here, we are "strengthening" Banach by picking an appropriate norm over which the operation is contractive, since Banach works over any complete norm.)