Skip to main content

differential equations - Return partial result when MemoryConstrained aborts NDSolve


I use NDSolve to solve a large set (~400) of coupled ODEs. Sometimes, the memory (~4GB) gets filled up, and my computer becomes impossible to work with, because it spends too much time writing to swap and the process can only be killed violently by the OS.



I circumvent this by using MemoryConstrained, but when the solver reaches the memory limit it is simply aborted and does not return the solution it obtained so far. Is there a way to obtain this solution (much like what happens when the solver encounters a singularity or reaches MaxSteps)?


Note: using a hack of the form


 StepMonitor :> If[MemoryInUse[]>...,...]

results in serious computational overhead.



Answer



Borrowing from an example of WhenEvent from the documentation in which a Button is used to stop the integration, I came up with this.


ClearAll[ndsolveMemConstrained];
SetAttributes[ndsolveMemConstrained, HoldFirst];
ndsolveMemConstrained::mlim = "Memory used `` exceeded limit ``.";

ndsolveMemConstrained[(nd_: NDSolve | NDSolveValue)[eqns_, rest___], bytes_] :=
Module[{sol, stop, task, mstart},
mstart = MemoryInUse[];
stop = False;
task = RunScheduledTask[
stop = (ndsolve`mem = MemoryInUse[] - mstart) > bytes,
0.2];
sol = nd[Append[eqns,
WhenEvent[stop,
Message[ndsolveMemConstrained::mlim, ndsolve`mem, bytes];

"StopIntegration"]],
rest];
RemoveScheduledTask[task];
sol]

As a baseline, here is an example DE from the documentation:


NDSolveValue[{D[u[t, x], t, t] == D[u[t, x], x, x], 
u[0, x] == Exp[-10 x^2], Derivative[1, 0][u][0, x] == 0,
u[t, -10] == u[t, 10]}, u, {t, 0, 100}, {x, -10, 10},
Method -> "StiffnessSwitching"] // AbsoluteTiming


(* {10.969550,InterpolatingFunction[{{0.,100.},{\[Ellipsis],-10.,10.,\[Ellipsis]}},<>]} *)

When the memory is not exceeded, it takes about the same amount of time:


ndsolveMemConstrained[
NDSolveValue[{
D[u[t, x], t, t] == D[u[t, x], x, x], u[0, x] == Exp[-10 x^2],
Derivative[1, 0][u][0, x] == 0, u[t, -10] == u[t, 10]},
u, {t, 0, 100}, {x, -10, 10}, Method -> "StiffnessSwitching"],
8000000] // AbsoluteTiming

ndsolve`mem

(* {10.962278, InterpolatingFunction[{{0., 100.}, {..., -10., 10.,...}}, <>]} *)
(* 6992160 *)

When the memory limit is exceeded, there is frequently an extra warning message generated. I assume it has to do with where the solver is when stop is checked. (It's odd that it doesn't always produce the convergence warning.)


ndsolveMemConstrained[
NDSolveValue[{
D[u[t, x], t, t] == D[u[t, x], x, x], u[0, x] == Exp[-10 x^2],
Derivative[1, 0][u][0, x] == 0, u[t, -10] == u[t, 10]},

u, {t, 0, 100}, {x, -10, 10}, Method -> "StiffnessSwitching"],
4000000] // AbsoluteTiming
ndsolve`mem


NDSolveValue::evcvmit: Event location failed to converge to the requested accuracy or precision within 100 iterations between t = 56.32617731294334and t = 56.50060870314276. >>


ndsolveMemConstrained::mlim: Memory used 4158544 exceeded limit 4000000.



(* {5.595887, InterpolatingFunction[{{0., 56.3262}, {..., -10., 10.,...}}, <>]} *)
(* 4047584 *)


You can also monitor memory usage if the following is executed before ndsolveMemConstrained.


Dynamic @ ndsolve`mem

(* 6992160 *)

Comments

Popular posts from this blog

plotting - How to draw lines between specified dots on ListPlot?

I would like to create a plot where I have unconnected dots and some connected. So far, I have figured out how to draw the dots. My code is the following: ListPlot[{{1, 1}, {2, 2}, {3, 3}, {4, 4}, {1, 4}, {2, 5}, {3, 6}, {4, 7}, {1, 7}, {2, 8}, {3, 9}, {4, 10}, {1, 10}, {2, 11}, {3, 12}, {4,13}, {2.5, 7}}, Ticks -> {{1, 2, 3, 4}, None}, AxesStyle -> Thin, TicksStyle -> Directive[Black, Bold, 12], Mesh -> Full] I have thought using ListLinePlot command, but I don't know how to specify to the command to draw only selected lines between the dots. Do have any suggestions/hints on how to do that? Thank you. Answer One possibility would be to use Epilog with Line : ListPlot[ {{1, 1}, {2, 2}, {3, 3}, {4, 4}, {1, 4}, {2, 5}, {3, 6}, {4, 7}, {1, 7}, {2, 8}, {3, 9}, {4, 10}, {1, 10}, {2, 11}, {3, 12}, {4, 13}, {2.5, 7}}, Ticks -> {{1, 2, 3, 4}, None}, AxesStyle -> Thin, TicksStyle -> Directive[Black, Bold, 12], Mesh -> Full, Epilog -> { Line[ ...

calculus and analysis - Integral of the Sinc product

Let us consider the following integral $$ B_n = \int_0^\infty \prod_{k=1,3,5,\dots}^n\frac{\sin (x/k)}{x/k}dx $$ By definition, Sinc[x] == Sin[x]/x , therefore B[n_?OddQ] := Integrate[Product[Sinc[x/k], {k, 1, n, 2}], {x, 0, Infinity}] B /@ Range[1, 13, 2] {Pi/2, Pi/2, Pi/2, Pi/2, Pi/2, Pi/2, Pi/2} OK, everything is fine. But... B[15] 467807924713440738696537864469 Pi/935615849440640907310521750000 What's going on? Answer As Eckhard wrote in comments B[n] is the n-th Borwein integral . (The letter B was not accidental :) ) This funny properties of Borwein integrals is related to the Fourier transform of Sinc function FourierTransform[Sinc[x], x, k] 1/2 Sqrt[Pi/2] (Sign[1 - k] + Sign[1 + k]) Plot[%, {k, -2, 2}, Filling -> 0] which is the box function. The result is $\pi/2$ while the sum $$ 1/3+1/5+\dots+1/n $$ B_n = \frac{\pi}{2} - \pi \bigg(\sum_{k=3,5,\ldots}^n\frac{1}{k} -1\biggr)^\frac{n-1}{2}\prod_{k=3,5,\dots}^n\frac{k}{k-1}. $$ For $n=15$ it is equal to $$ \frac{46780...

list manipulation - Selecting multiple columns from a matrix?

Sample data: data = { {{2013, 1, 1}, 24.13, 167.67, 231.82}, {{2013, 1, 2}, 32.15, 170.92, 225.99}, {{2013, 1, 3}, 35.43, 172.68, 221.67}, {{2013, 1, 4}, 36.73, 173.05, 218.32}, {{2013, 1, 5}, 58.19, 165.96, 197.05}, {{2013, 1, 6}, 69.99, 163.50, 187.52}, {{2013, 1, 7}, 71.37, 154.21, 175.58}, {{2013, 1, 8}, 72.51, 149.66, 163.25}}; I want a DateListPlot with three graphs, so for a matrix formed by columns 1 and 2, one for columns 1 and 3, and 1 for columns 1 and 4. At the moment I'm using this code: data2 = Transpose[{data[[All, 1]], data[[All, 2]]}]; data3 = Transpose[{data[[All, 1]], data[[All, 3]]}]; data4 = Transpose[{data[[All, 1]], data[[All, 4]]}]; DateListPlot[{data2, data3, data4}, Joined -> True, Filling -> {3 -> {1}}] but I have a hunch that this can be done more efficiently. I don't like the Transpose s in particular. Any ideas? edit (for extra credit) What if I need to multiply the second column by 2, which in my solution is simp...