2016
DOI: 10.4236/ajcm.2016.64031
|View full text |Cite
|
Sign up to set email alerts
|

An Adaptive Time-Step Backward Differentiation Algorithm to Solve Stiff Ordinary Differential Equations: Application to Solve Activated Sludge Models

Abstract: A backward differentiation formula (BDF) has been shown to be an effective way to solve a system of ordinary differential equations (ODEs) that have some degree of stiffness. However, sometimes, due to high-frequency variations in the external time series of boundary conditions, a small time-step is required to solve the ODE system throughout the entire simulation period, which can lead to a high computational cost, slower response, and need for more memory resources. One possible strategy to overcome this pro… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 11 publications
(4 citation statements)
references
References 27 publications
0
4
0
Order By: Relevance
“…An appropriate Δt enables a low cost iteration as well as a good convergence performance. The optimal option is to set a variable Δt which can be updated dynamically during the iteration (Alikhani et al 2016;Shepherd et al 2019). The procedure of adaptive time step control is shown in Algorithm 1.…”
Section: Multilevel Adaptive Time-stepping Strategymentioning
confidence: 99%
“…An appropriate Δt enables a low cost iteration as well as a good convergence performance. The optimal option is to set a variable Δt which can be updated dynamically during the iteration (Alikhani et al 2016;Shepherd et al 2019). The procedure of adaptive time step control is shown in Algorithm 1.…”
Section: Multilevel Adaptive Time-stepping Strategymentioning
confidence: 99%
“…Therefore, an efficient numerical algorithm [33] should be selected to reduce the overall computation time of each simulation run.…”
Section: S S H Boosari Et Almentioning
confidence: 99%
“…Since the rate of change of the T functions and even the degree of stiffness during the course of the simulation can vary, using a fixed but small time step implies a heavy computational burden. A dynamically adaptive time step algorithm can automatically adjust the time step according to the accuracy requirements and the degree of stiffness, resulting in a more optimal use of computational resources [3]. Successful adaptive methods may lead to substantial savings in computational work for a given accuracy [4].…”
Section: Introductionmentioning
confidence: 99%