White box / Algorithms and implementation / Nonlinear solution and state

Accepted and trial material state

Algorithm / execution · assumptions, essential equations, full derivation, algorithm, code and verification references.

Browse another sheet Algorithms and implementation / Nonlinear solution and state
Algorithms and implementationNonlinear solution and stateSheet 2 / 3
Algorithm / executionIMPLEMENTED ON DECLARED ROUTES · restart route-dependent

Constitutive history is isolated from tentative Newton iterations so a rejected increment cannot become the accepted history.

01 Model and scope

Path-dependent material history is evaluated from the last committed state while Newton tests temporary trial states. Commit occurs only after the increment converges; rollback restores the accepted history after rejection so a failed trial cannot contaminate a retry.

Route assumptions and calculation checks

  1. Schema-v2 checkpoints and deterministic digests exist only for selected routes.
  2. Do not infer contact, distributed, or nonlinear-transient restart support from shared transaction primitives.
  3. Keep solver status and maturity verdict separate in every result.

02 Essential equations and symbols

Sn∗=U(Sn,Δε∗)\mathbf S_n^*=\mathcal U(\mathbf S_n,\Delta\boldsymbol\varepsilon^*)Sn+1={Sn∗,Cn+1=1Sn,Cn+1=0\mathbf S_{n+1}=\begin{cases}\mathbf S_n^*,&\mathcal C_{n+1}=1\\\mathbf S_n,&\mathcal C_{n+1}=0\end{cases}Sn∗←∅,Cn+1=0\mathbf S_n^*\leftarrow\varnothing,\qquad\mathcal C_{n+1}=0

Definitions and conventions

Sₙ
Accepted history at the beginning of the increment.
S*
Temporary trial history.
Δε∗\Delta{}\varepsilon{}*
Trial strain increment.
commit⁡,rollback⁡\operatorname{commit},\operatorname{rollback}
Accept converged history or discard rejected trial changes.
Committed historySₙConstitutive trialS* = U(Sₙ, Δε*)Global acceptanceSₙ₊₁ = S*Rejected trial → restore Sₙ
Trial history and acceptanceEvery trial starts from the same committed history. Acceptance promotes the converged trial. Rejection discards it before retrying.
4 detailed steps

03 Step by step derivation

Follow the assumptions, equations and discrete operations in order. The full explanation stays visible.

1 · Freeze the committed state at increment start

A path-dependent law carries plastic strain, hardening variables, or other history from the last converged increment. Every Newton trial in the current increment starts from that same accepted state; trial-to-trial accumulation would make the result depend on the number of iterations.

Sn\mathbf S_n

2 · Evaluate a temporary constitutive trial

Given a trial strain increment, compute candidate stress, tangent, and state without mutating the committed record. Global equilibrium may request many such evaluations while testing corrections and line-search scales.

(σ∗,C∗,S∗)=C(Δε∗,Sn)(\boldsymbol\sigma^*,\mathbf C^*,\mathbf S^*)=\mathcal C(\Delta\boldsymbol\varepsilon^*,\mathbf S_n)

3 · Commit only after global convergence

When the full nonlinear increment satisfies its equilibrium and step criteria, promote the converged trial state to the next accepted history. Persist the resulting state and deterministic digest only through the supported checkpoint route.

Sn+1={S∗,Cn+1=1Sn,Cn+1=0S_{n+1}=\begin{cases}S^*,&\mathcal C_{n+1}=1\\S_n,&\mathcal C_{n+1}=0\end{cases}

4 · Roll back a rejected trial

If line search or cutback rejects the increment, discard every trial history and restore S_n before retrying. Checkpoint schema, digest determinism, and material-state transport are route-specific; shared transaction machinery does not establish restart for all contact, MPI, or transient combinations.

S∗←∅,quadC=0S^*\leftarrow\varnothing,quad\mathcal C=0Sn+1=Sn,quadC=0S_{n+1}=S_n,quad\mathcal C=0

04 Algorithm and implementation

Read the linked versioned source for the actual assembly and solver behavior. The derivation above explains the mathematics and is not a verbatim source excerpt.

05 Verification and limitations

IMPLEMENTED ON DECLARED ROUTES · restart route-dependent

The formulation and its explanatory checks do not by themselves establish a qualified application domain. Consult the capability matrix and the applicable recorded case.

06 Sources and related sheets

Continue the reasoning

Back to sheet contents ↑