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 ...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 problem is to dynamically adjust the time-step with respect to the system’s stiffness. Therefore, small time-steps can be applied when needed, and larger time-steps can be used when allowable. This paper presents a new algorithm for adjusting the dynamic time-step based on a BDF discretization method. The parameters used to dynamically adjust the size of the time-step can be optimally specified to result in a minimum computation time and reasonable accuracy for a particular case of ODEs. The proposed algorithm was applied to solve the system of ODEs obtained from an activated sludge model (ASM) for biological wastewater treatment processes. The algorithm was tested for various solver parameters, and the optimum set of three adjustable parameters that represented minimum computation time was identified. In addition, the accuracy of the algorithm was evaluated for various sets of solver parameters.展开更多
In this paper, a new one-step explicit method of fourth order is derived. The new method is proved to be A-stable and L-stable, and it gives exact results when applied to the test equation y’=λy with Re(λ)【0, Also...In this paper, a new one-step explicit method of fourth order is derived. The new method is proved to be A-stable and L-stable, and it gives exact results when applied to the test equation y’=λy with Re(λ)【0, Also several numerical examples are included.展开更多
Presents a class of modified parallel Rosenbrock methods (MPROW) which possesses more free parameters to improve further the various properties of the methods and will be similarly written as MPROW. Information on par...Presents a class of modified parallel Rosenbrock methods (MPROW) which possesses more free parameters to improve further the various properties of the methods and will be similarly written as MPROW. Information on parallel Rosenbrock methods; Convergence and stability analysis; Discussion on two-stage third-order methods.展开更多
In this paper we propose and analyze a backward differentiation formula(BDF)type numerical scheme for the Cahn-Hilliard equation with third order temporal accuracy.The Fourier pseudo-spectral method is used to discret...In this paper we propose and analyze a backward differentiation formula(BDF)type numerical scheme for the Cahn-Hilliard equation with third order temporal accuracy.The Fourier pseudo-spectral method is used to discretize space.The surface diffusion and the nonlinear chemical potential terms are treated implicitly,while the expansive term is approximated by a third order explicit extrapolation formula for the sake of solvability.In addition,a third order accurate Douglas-Dupont regularization term,in the form of−A_(0)△t^(2)△_( N)(φ^(n+1)−φ^(n)),is added in the numerical scheme.In particular,the energy stability is carefully derived in a modified version,so that a uniform bound for the original energy functional is available,and a theoretical justification of the coefficient A becomes available.As a result of this energy stability analysis,a uniform-in-time L_(N)^(6)bound of the numerical solution is obtained.And also,the optimal rate convergence analysis and error estimate are provided,in the L_(△t)^(∞)(0,T;L_(N)^(2))∩L^(2)_(△ t)(0,T;H_(h)^(2))norm,with the help of the L_(N)^(6)bound for the numerical solution.A few numerical simulation results are presented to demonstrate the efficiency of the numerical scheme and the third order convergence.展开更多
文摘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 problem is to dynamically adjust the time-step with respect to the system’s stiffness. Therefore, small time-steps can be applied when needed, and larger time-steps can be used when allowable. This paper presents a new algorithm for adjusting the dynamic time-step based on a BDF discretization method. The parameters used to dynamically adjust the size of the time-step can be optimally specified to result in a minimum computation time and reasonable accuracy for a particular case of ODEs. The proposed algorithm was applied to solve the system of ODEs obtained from an activated sludge model (ASM) for biological wastewater treatment processes. The algorithm was tested for various solver parameters, and the optimum set of three adjustable parameters that represented minimum computation time was identified. In addition, the accuracy of the algorithm was evaluated for various sets of solver parameters.
文摘In this paper, a new one-step explicit method of fourth order is derived. The new method is proved to be A-stable and L-stable, and it gives exact results when applied to the test equation y’=λy with Re(λ)【0, Also several numerical examples are included.
文摘Presents a class of modified parallel Rosenbrock methods (MPROW) which possesses more free parameters to improve further the various properties of the methods and will be similarly written as MPROW. Information on parallel Rosenbrock methods; Convergence and stability analysis; Discussion on two-stage third-order methods.
基金supported in part by the Computational Physics Key Laboratory of IAPCAM(P.R.China)under Grant 6142A05200103(K.Cheng)the National Science Foundation(USA)under Grant NSF DMS-2012669(C.Wang)Grants NSF DMS-1719854,DMS-2012634(S.Wise).
文摘In this paper we propose and analyze a backward differentiation formula(BDF)type numerical scheme for the Cahn-Hilliard equation with third order temporal accuracy.The Fourier pseudo-spectral method is used to discretize space.The surface diffusion and the nonlinear chemical potential terms are treated implicitly,while the expansive term is approximated by a third order explicit extrapolation formula for the sake of solvability.In addition,a third order accurate Douglas-Dupont regularization term,in the form of−A_(0)△t^(2)△_( N)(φ^(n+1)−φ^(n)),is added in the numerical scheme.In particular,the energy stability is carefully derived in a modified version,so that a uniform bound for the original energy functional is available,and a theoretical justification of the coefficient A becomes available.As a result of this energy stability analysis,a uniform-in-time L_(N)^(6)bound of the numerical solution is obtained.And also,the optimal rate convergence analysis and error estimate are provided,in the L_(△t)^(∞)(0,T;L_(N)^(2))∩L^(2)_(△ t)(0,T;H_(h)^(2))norm,with the help of the L_(N)^(6)bound for the numerical solution.A few numerical simulation results are presented to demonstrate the efficiency of the numerical scheme and the third order convergence.
