| Directory | Changes | Lines of Code | Lines per Change |
|---|---|---|---|
| Totals | 6 (100.0%) | 1074 (100.0%) | 179.0 |
| Compiler/BackEnd/ | 4 (66.7%) | 1047 (97.5%) | 261.7 |
| Compiler/FrontEnd/ | 1 (16.7%) | 23 (2.1%) | 23.0 |
| Compiler/Util/ | 1 (16.7%) | 4 (0.4%) | 4.0 |
BackendDAEOptimize.mo: An other heuristic for the tearing is now implemented. The residual equations are solved using Newton?s method: u_{n+1} = u_n ? (f?(u_n))^{-1}*f(u_n). During each iteration, the linear system f?(u_n)*du = -f(u_n) is solved for du. Thus, the Newton step can be rewritten in the form u_{n+1} = u_m + du, where du is the solution of the linear system. The function ?tearingSystem1? now creates this linear system and solves for it using the function ?tearingSystemNew?.
Flags.mo: a new flag ?tearing_and_relaxation? is added to activate the above system in BackendDAEOptimize.mo.
BackendDump.mo: added the case for RESIDUAL_EQUATION in ?printEquation? and ?dumpEquation?
Expression.mo: added the function ?makeDifference?
1064 lines of code changed in 5 files:
- bugfix tearing
10 lines of code changed in 1 file: