#include <AdaptiveSubstepper.h>
|
typedef Eigen::Matrix< double, materialTangentSize, materialTangentSize > | TangentSizedMatrix |
| Matrix for describing the nonlinear equation system of the return mapping algorithm. More...
|
|
typedef Eigen::Matrix< double, nIntegrationDependentStateVars, 1 > | IntegrationStateVector |
| Vector to carry the internal state of a material. More...
|
|
|
| AdaptiveSubstepper (double initialStepSize, double minimumStepSize, double maxScaleUpFactor, double scaleDownFactor, double integrationErrorTolerance, int nPassesToIncrease, const Matrix6d &Cel) |
|
void | setConvergedProgress (const Marmot::Vector6d &stressOld, const IntegrationStateVector &stateVarsOld) |
| Set the current converged state. More...
|
|
bool | isFinished () |
| Check if the subincrementation is finished. More...
|
|
double | getNextSubstep () |
| get the next subincrement size More...
|
|
int | getNumberOfSubsteps () |
| get the finished number of subincrements More...
|
|
bool | finishSubstep (const Marmot::Vector6d &resultStress, const TangentSizedMatrix &dXdY, const IntegrationStateVector &stateVars) |
| finish a subincrement with plasticity More...
|
|
void | finishElasticSubstep (const Marmot::Vector6d &resultStress) |
| finish a subincrement with elasticity only More...
|
|
bool | discardSubstep () |
| discard the current subincrement More...
|
|
bool | repeatSubstep (double decrementationFactor) |
| repeat the current subincrement with a smaller step More...
|
|
void | getConvergedProgress (Marmot::Vector6d &stress, IntegrationStateVector &stateVars) |
| get the last converged state More...
|
|
Matrix6d | getCurrentTangentOperator () |
| get the algorithmic tangent for the current state More...
|
|
void | getResults (Marmot::Vector6d &stress, Matrix6d &consistentTangent, IntegrationStateVector &stateVars) |
| Write the current results. More...
|
|
◆ TangentSizedMatrix
template<size_t materialTangentSize, size_t nIntegrationDependentStateVars>
Matrix for describing the nonlinear equation system of the return mapping algorithm.
Adaptive Substepper, employing an error estimation and Richardson Extrapolation for an Implicit Return Mapping algorithm
Matthias Neuner (2016), developed within the DK-CIM collaboration
◆ IntegrationStateVector
template<size_t materialTangentSize, size_t nIntegrationDependentStateVars>
Vector to carry the internal state of a material.
◆ SubsteppingState
template<size_t materialTangentSize, size_t nIntegrationDependentStateVars>
Enumerator |
---|
FullStep | |
FirstHalfStep | |
SecondHalfStep | |
◆ AdaptiveSubstepper()
template<size_t n, size_t nState>
◆ setConvergedProgress()
template<size_t n, size_t nState>
Set the current converged state.
◆ isFinished()
template<size_t n, size_t nState>
Check if the subincrementation is finished.
◆ getNextSubstep()
template<size_t n, size_t nState>
get the next subincrement size
◆ getNumberOfSubsteps()
template<size_t n, size_t nState>
get the finished number of subincrements
◆ finishSubstep()
template<size_t n, size_t nState>
finish a subincrement with plasticity
◆ finishElasticSubstep()
template<size_t n, size_t nState>
finish a subincrement with elasticity only
◆ discardSubstep()
template<size_t n, size_t nState>
discard the current subincrement
◆ repeatSubstep()
template<size_t n, size_t nState>
repeat the current subincrement with a smaller step
◆ getConvergedProgress()
template<size_t n, size_t nState>
get the last converged state
◆ getCurrentTangentOperator()
template<size_t materialTangentSize, size_t nIntegrationDependentStateVars>
get the algorithmic tangent for the current state
◆ getResults()
template<size_t n, size_t nState>
Write the current results.
◆ acceptSubstepWithFullStepOnly()
template<size_t n, size_t nState>
◆ splitCurrentSubstep()
template<size_t n, size_t nState>
◆ initialStepSize
template<size_t materialTangentSize, size_t nIntegrationDependentStateVars>
◆ minimumStepSize
template<size_t materialTangentSize, size_t nIntegrationDependentStateVars>
◆ maxScaleUpFactor
template<size_t materialTangentSize, size_t nIntegrationDependentStateVars>
◆ scaleDownFactor
template<size_t materialTangentSize, size_t nIntegrationDependentStateVars>
◆ integrationErrorTolerance
template<size_t materialTangentSize, size_t nIntegrationDependentStateVars>
◆ nPassesToIncrease
template<size_t materialTangentSize, size_t nIntegrationDependentStateVars>
◆ ignoreErrorToleranceOnMinimumStepSize
template<size_t materialTangentSize, size_t nIntegrationDependentStateVars>
◆ currentProgress
template<size_t materialTangentSize, size_t nIntegrationDependentStateVars>
◆ currentSubstepSize
template<size_t materialTangentSize, size_t nIntegrationDependentStateVars>
◆ passedSubsteps
template<size_t materialTangentSize, size_t nIntegrationDependentStateVars>
◆ substepIndex
template<size_t materialTangentSize, size_t nIntegrationDependentStateVars>
◆ stressProgress
template<size_t materialTangentSize, size_t nIntegrationDependentStateVars>
internal storages for the progress of the total increment
◆ stateProgress
template<size_t materialTangentSize, size_t nIntegrationDependentStateVars>
◆ consistentTangentProgress
template<size_t materialTangentSize, size_t nIntegrationDependentStateVars>
◆ stressProgressHalfTemp
template<size_t materialTangentSize, size_t nIntegrationDependentStateVars>
◆ stressProgressFullTemp
template<size_t materialTangentSize, size_t nIntegrationDependentStateVars>
◆ stateProgressHalfTemp
template<size_t materialTangentSize, size_t nIntegrationDependentStateVars>
◆ stateProgressFullTemp
template<size_t materialTangentSize, size_t nIntegrationDependentStateVars>
◆ consistentTangentProgressHalfTemp
template<size_t materialTangentSize, size_t nIntegrationDependentStateVars>
◆ consistentTangentProgressFullTemp
template<size_t materialTangentSize, size_t nIntegrationDependentStateVars>
◆ elasticTangent
template<size_t materialTangentSize, size_t nIntegrationDependentStateVars>
◆ currentState
template<size_t materialTangentSize, size_t nIntegrationDependentStateVars>
The documentation for this class was generated from the following file: