commit:2015:11_18
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
commit:2015:11_18 [2015/11/18 19:21] – [Nombre d'itérations de la procédure itérative de Newton Raphson] wautelet | commit:2015:11_18 [2016/03/30 15:23] (current) – external edit 127.0.0.1 | ||
---|---|---|---|
Line 48: | Line 48: | ||
Il est possible de faire l' | Il est possible de faire l' | ||
+ | |||
+ | Le pas de temps est mis à jour sur base d'un nombre d' | ||
+ | |||
+ | Voici une représentation schématique des deux algorithmes disponibles : | ||
+ | <WRAP group> | ||
+ | <WRAP centeralign half column> | ||
+ | 1er cas : | ||
+ | {{: | ||
+ | </ | ||
+ | <WRAP centeralign half column> | ||
+ | 2ième cas : | ||
+ | {{: | ||
+ | </ | ||
+ | </ | ||
+ | |||
+ | Voici deux exemples : | ||
+ | |||
+ | <WRAP group> | ||
+ | <WRAP centeralign half column> | ||
+ | 1er cas : | ||
+ | {{: | ||
+ | Le nombre maximum d' | ||
+ | </ | ||
+ | <WRAP centeralign half column> | ||
+ | 2ième cas : | ||
+ | {{: | ||
+ | Le nombre maximum d' | ||
+ | </ | ||
+ | </ | ||
+ | |||
On distincte les différents cas suivants : | On distincte les différents cas suivants : | ||
=== Schéma d' | === Schéma d' | ||
+ | |||
+ | Le nombre d' | ||
+ | |||
< | < | ||
- | tscm = CriticalTimeStepComputationMethod(metafor) | + | tscm = NbOfMechNRIterationsTimeStepComputationMethod(metafor) |
- | tscm.setExplicitTimeStepSecurity(_explicitTimeStepSecurity) | + | tscm.setTimeStepDivisionFactor(_timeStepDivisionFactor) |
- | tscm.setNbOfStepsForCriticalTimeStepUpdate(_nbOfStepsForCriticalTimeStepUpdate) | + | tscm.setMinimumTimeStep(_minimumTimeStep) |
+ | tscm.setMaxNbOfIteInAdaptOfTimeStep(_maxNbOfIteInAdaptOfTimeStep) | ||
+ | tscm.setNbOptiIte(_nbOptiIte) | ||
tsm.setTimeStepComputationMethod(tscm) | tsm.setTimeStepComputationMethod(tscm) | ||
</ | </ | ||
+ | |||
=== Schéma d' | === Schéma d' | ||
+ | |||
+ | Le nombre d' | ||
+ | |||
< | < | ||
- | tscm = CriticalTimeStepComputationMethod(metafor) | + | tscm = NbOfStaggeredTmNRIterationsTimeStepComputationMethod(metafor) |
- | tscm.setExplicitTimeStepSecurity(_explicitTimeStepSecurity) | + | tscm.setTimeStepDivisionFactor(_timeStepDivisionFactor) |
- | tscm.setNbOfStepsForCriticalTimeStepUpdate(_nbOfStepsForCriticalTimeStepUpdate) | + | tscm.setMinimumTimeStep(_minimumTimeStep) |
+ | tscm.setMaxNbOfIteInAdaptOfTimeStep(_maxNbOfIteInAdaptOfTimeStep) | ||
+ | tscm.setNbOptiIte(_nbOptiIte) | ||
tsm.setTimeStepComputationMethod(tscm) | tsm.setTimeStepComputationMethod(tscm) | ||
</ | </ | ||
+ | |||
=== Schéma d' | === Schéma d' | ||
+ | |||
+ | Le nombre d' | ||
+ | |||
< | < | ||
- | tscm = CriticalTimeStepComputationMethod(metafor) | + | tscm = NbOfCoupledTmNRIterationsTimeStepComputationMethod(metafor) |
- | tscm.setExplicitTimeStepSecurity(_explicitTimeStepSecurity) | + | tscm.setTimeStepDivisionFactor(_timeStepDivisionFactor) |
- | tscm.setNbOfStepsForCriticalTimeStepUpdate(_nbOfStepsForCriticalTimeStepUpdate) | + | tscm.setMinimumTimeStep(_minimumTimeStep) |
+ | tscm.setMaxNbOfIteInAdaptOfTimeStep(_maxNbOfIteInAdaptOfTimeStep) | ||
+ | tscm.setNbOptiIte(_nbOptiIte) | ||
tsm.setTimeStepComputationMethod(tscm) | tsm.setTimeStepComputationMethod(tscm) | ||
</ | </ | ||
+ | |||
=== Schéma d' | === Schéma d' | ||
+ | |||
+ | Le nombre d' | ||
+ | |||
< | < | ||
tscm = NbOfAugLagMechNRIterationsTimeStepComputationMethod(metafor) | tscm = NbOfAugLagMechNRIterationsTimeStepComputationMethod(metafor) | ||
- | tscm.setExplicitTimeStepSecurity(_explicitTimeStepSecurity) | + | tscm.setTimeStepDivisionFactor(_timeStepDivisionFactor) |
- | tscm.setNbOfStepsForCriticalTimeStepUpdate(_nbOfStepsForCriticalTimeStepUpdate) | + | tscm.setMinimumTimeStep(_minimumTimeStep) |
+ | tscm.setMaxNbOfIteInAdaptOfTimeStep(_maxNbOfIteInAdaptOfTimeStep) | ||
+ | tscm.setNbOptiIte(_nbOptiIte) | ||
tsm.setTimeStepComputationMethod(tscm) | tsm.setTimeStepComputationMethod(tscm) | ||
</ | </ |
commit/2015/11_18.1447870912.txt.gz · Last modified: (external edit)