| 259 | } |
| 260 | |
| 261 | int |
| 262 | DirectIntegrationAnalysis::analyzeSubLevel(int level, double dT) { |
| 263 | int result = 0; |
| 264 | if (numSubSteps == 0) |
| 265 | return -1; |
| 266 | |
| 267 | double stepDT = dT/(numSubSteps*1.); |
| 268 | |
| 269 | for (int i=0; i<numSubSteps; i++) { |
| 270 | result = this->analyzeStep(stepDT); |
| 271 | if (result < 0) { |
| 272 | if (level == numSubLevels) { |
| 273 | return result; |
| 274 | } else { |
| 275 | result = this->analyzeSubLevel(level+1, stepDT); |
| 276 | if (result < 0) |
| 277 | return result; |
| 278 | } |
| 279 | } |
| 280 | } |
| 281 | return result; |
| 282 | } |
| 283 | |
| 284 | int |
| 285 | DirectIntegrationAnalysis::eigen(int numMode, bool generalized, bool findSmallest) |