2014
DOI: 10.1016/j.procs.2014.05.091
|View full text |Cite
|
Sign up to set email alerts
|

Implementation of an Adaptive BDF2 Formula and Comparison with the MATLAB Ode15s

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
23
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 31 publications
(24 citation statements)
references
References 10 publications
1
23
0
Order By: Relevance
“…Within each time step a nonlinear system of equations is likely and must therefore been solved. The first order predictor of the implemented second order backward differential formulation (bdf) is a given in [2] as (3) The bdf with a linear damping matrix and a nonlinear stiffness matrix is given as (4) According to [2], the parameter is weighting the current and previous time step by .…”
Section: Methodsmentioning
confidence: 99%
See 3 more Smart Citations
“…Within each time step a nonlinear system of equations is likely and must therefore been solved. The first order predictor of the implemented second order backward differential formulation (bdf) is a given in [2] as (3) The bdf with a linear damping matrix and a nonlinear stiffness matrix is given as (4) According to [2], the parameter is weighting the current and previous time step by .…”
Section: Methodsmentioning
confidence: 99%
“…The multiplier is generated based on the number of currently available and potentially contributing software agents. If only one agent is available is chosen according to [2]. In case of more agents, larger time steps speed up the calculation.…”
Section: Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…A dynamically adaptive time-step algorithm can automatically adjust the time-step according to the degree of stiffness, resulting in a more optimal use of computational resources. For example, Celaya et al [17] proposed a method to select or reject a proposed time-step in adaptive algorithms by evaluating the local truncation error at each time-step to maintain the error below a given threshold.…”
Section: Introductionmentioning
confidence: 99%