The minimum time step is the smallest time step used during the simulation.The average time step is the mean time step used during the simulation.The maximum time step is the maximum time used during the simulation.The percent in steady state is the percent of the total simulation time spent in steady state during the simulation.The average iterations per time step is the total number of iterations during the simulation divided by the total number of time steps or step count in this table. This will range between 2 and 4 iterations as SWMM 5.0.018 has a minimum of 2 and and a maximum of 4 iterations.The Step count is the total number of time steps during the simulation.The percent of bypassed links are the link flows that are NOT computed between time step iteration 2 and 4 because both the upstream and downstream node depths are converged in the current time step.The percent of bypassed nodes are those nodes that have been converged between time step iteration 2 and 4. The node depth is still calculated, however, between iterations 2 and 4 as long as the whole time step is not considered converged.
Sunday, July 4, 2010
SWMM5 Routing Time Step Summary
This table is a summary of the iterations, times steps and amount of node and link bypasssing that occurs during a SWMM 5 simulation. It is listed in the text output file or the .rpt file of SWMM 5 which the file shown when you use the Report/Status command.
Saturday, July 3, 2010
Explicit Iteration Hydraulic Computation and Implicit Time Step Hydraulic Computations in SWMM 5
The dynamic wave solution in SWMM 5 and InfoSWMM uses an interlocking explicit iteration in an overall time step implicit calculation of the node depths and link flows. The node depths and links flows are computed based on the last iteration values for 2 to 4 iterations. It explicitly calculates the node depths and link flows at each iteration based on the last iteration value but uses an underrelaxation or Gauss-Seidel method averaging to compute the final new iteration values. The underrelaxation method averages the last iteration value and the current iteration estimate to calculate the final iteration node depth and links flow.
At each time step this is the sequence of computations:
1. The time step is based on the Courant–Friedrichs–Lewy (CFL) condition for the most restrictive link (the CFL condition is based on the link length, current depth and current velocity),
2.Link flows and node depths are calculated at the 1st iteration based on the last time steps flows and depths,
3. The new iterations link flow and node depths are calculated by averaging the node depths and link flows found in step 2 with the original iteration node depths and link flows,
4. The iteration process continues for at least 2 iterations for all nodes and links,
5. The iteration process may stop after 2 iterations for those links in which the upstream and downstream node depths have converged,
6. The upstream or downstream node is considered converged when the absolute depth difference between iterations is less than 0.005 feet,
7. The maximum number of iterations for all nodes and links is set to 4.
8. Once the number of iterations has reached 4 or all nodes and links are converged the time step calculations are considered finished and the program moves on to a new time step.
9. The image shown below shows how the node continuity equation is solved for each iteration but the link combined continuity and momentum equation is calculated for either 2, 3 or 4 iterations depending on the upstream and downstream node convergence of the link.
Culvert inlets and outlets To improve the process of defining culvert inlet and culvert outlet losses for an InfoWorks network, a new fiel...
@Innovyze User forum where you can ask questions about our Water and Wastewater Products http://t.co/dwgCOo3fSP pic.twitter.com/R0QKG2dv...
Engine Error Number Description ERROR 101: memory allocation error. ...
From CHI - International Conference on Stormwater and Urban Water Systems Modeling, Toronto Canada (February 26 and 27) - Call for papers47th Annual International Conference Toronto, Canada February 26-27, 2014 Call for papers Have you implemented a good idea recen...