3 | | Under Windows, the size of memory allocated by the back-end grows approximately as O(N^2^), N being the size of the algebraic system: |
| 3 | I have used these settings, which include some that are essential for the efficient handling of the large algebraic system: |
| 4 | |
| 5 | {{{ |
| 6 | setCommandLineOptions("--preOptModules-=clockPartitioning |
| 7 | --postOptModules-=detectJacobianSparsePattern --postOptModules+=wrapFunctionCalls |
| 8 | --disableLinearTearing --removeSimpleEquations=new |
| 9 | --indexReductionMethod=uode --tearingMethod=omcTearing |
| 10 | -d=dumpSimCode,gcProfiling,execstat,nogen,initialization,backenddaeinfo,discreteinfo,stateselection"); |
| 11 | |
| 12 | simulate(LargeAlgebraic.M_2000, method = "rungekutta", stopTime = 1, |
| 13 | numberOfIntervals = 10, simflags = "-lv LOG_STATS,LOG_LS -ls=klu"); |
| 14 | }}} |
| 15 | |
| 16 | |
| 17 | Under Windows, the size of memory allocated by the back-end and code generation phases grows approximately as O(N^2^), N being the size of the algebraic system: |