An Improved Higher-Order Time Integration Algorithm for Structural Dynamics

Based on the weighted residual method, a single-step time integration algorithm with higher-order accuracy and unconditional stability has been proposed, which is superior to the second-order accurate algorithms in tracking long-term dynamics. For improving such a higher-order accurate algorithm, th...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computer modeling in engineering & sciences Ročník 126; číslo 2; s. 549 - 575
Hlavní autoři: Ji, Yi, Xing, Yufeng
Médium: Journal Article
Jazyk:angličtina
Vydáno: Henderson Tech Science Press 01.01.2021
Témata:
ISSN:1526-1492, 1526-1506, 1526-1506
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Based on the weighted residual method, a single-step time integration algorithm with higher-order accuracy and unconditional stability has been proposed, which is superior to the second-order accurate algorithms in tracking long-term dynamics. For improving such a higher-order accurate algorithm, this paper proposes a two sub-step higher-order algorithm with unconditional stability and controllable dissipation. In the proposed algorithm, a time step interval [tk, tk + h] where h stands for the size of a time step is divided into two sub-steps [tk, tk + γh] and [tk + γh, tk + h]. A non-dissipative fourth-order algorithm is used in the first sub-step to ensure low-frequency accuracy and a dissipative third-order algorithm is employed in the second sub-step to filter out the contribution of high-frequency modes. Besides, two approaches are used to design the algorithm parameter γ. The first approach determines γ by maximizing low-frequency accuracy and the other determines γ for quickly damping out high-frequency modes. The present algorithm uses ρ∞ to exactly control the degree of numerical dissipation, and it is third-order accurate when 0 ≤ ρ∞ < 1 and fourth-order accurate when ρ∞ = 1. Furthermore, the proposed algorithm is self-starting and easy to implement. Some illustrative linear and nonlinear examples are solved to check the performances of the proposed two sub-step higher-order algorithm.
Bibliografie:1526-1492(20210210)126:2L.549;1-
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1526-1492
1526-1506
1526-1506
DOI:10.32604/cmes.2021.014244