Subroutine calculates the final update step of the Runge-Kutta method. It is performing levelwise.
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
type(atl_statedata_type), | intent(inout) | :: | statedata_list | List of states you want to calc the rhs for. For each level we have one. |
||
type(atl_scheme_type), | intent(inout) | :: | scheme_list | List of schemes, for each level. |
||
type(atl_timestep_type), | intent(inout) | :: | timestep_list | List of levelwise timestepping algorihtms |
Type | Visibility | Attributes | Name | Initial | |||
---|---|---|---|---|---|---|---|
integer, | private | :: | nTotal | ||||
integer, | private | :: | nDofs | ||||
integer, | private | :: | nScalars |
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer, | intent(in) | :: | nTotal | |||
integer, | intent(in) | :: | nDofs | |||
integer, | intent(in) | :: | nScalars | |||
real(kind=rk), | intent(inout) | :: | state(nTotal,nDofs,nScalars) | |||
real(kind=rk), | intent(in) | :: | state2(nTotal,nDofs,nScalars) | |||
real(kind=rk), | intent(in) | :: | state3(nTotal,nDofs,nScalars) | |||
real(kind=rk), | intent(in) | :: | state4(nTotal,nDofs,nScalars) | |||
real(kind=rk), | intent(in) | :: | state1_implicit(nTotal,nDofs,nScalars) | |||
real(kind=rk), | intent(in) | :: | state2_implicit(nTotal,nDofs,nScalars) | |||
real(kind=rk), | intent(in) | :: | state3_implicit(nTotal,nDofs,nScalars) | |||
real(kind=rk) | :: | dt |