High-order accurate multi-sub-step implicit integration algorithms with dissipation control for hyperbolic problems

This paper proposes an implicit family of sub-step integration algorithms grounded in the explicit singly diagonally implicit Runge–Kutta (ESDIRK) method. The proposed methods achieve third-order consistency per sub-step, and thus, the trapezoidal rule is always employed in the first sub-step. This...

Full description

Saved in:
Bibliographic Details
Published in:Archive of applied mechanics (1991) Vol. 94; no. 8; pp. 2285 - 2334
Main Authors: Li, Jinze, Li, Hua, Yu, Kaiping, Zhao, Rui
Format: Journal Article
Language:English
Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.08.2024
Springer Nature B.V
Subjects:
ISSN:0939-1533, 1432-0681
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper proposes an implicit family of sub-step integration algorithms grounded in the explicit singly diagonally implicit Runge–Kutta (ESDIRK) method. The proposed methods achieve third-order consistency per sub-step, and thus, the trapezoidal rule is always employed in the first sub-step. This paper demonstrates for the first time that the proposed s -sub-step implicit method with s ≤ 6 can reach s th-order accuracy when achieving dissipation control and unconditional stability simultaneously. Hence, this paper develops, analyzes, and compares four cost-optimal high-order implicit algorithms within the present s -sub-step method using three, four, five, and six sub-steps. Each high-order implicit algorithm shares identical effective stiffness matrices to achieve optimal spectral properties. Unlike the published algorithms, the proposed high-order methods do not suffer from the order reduction for solving forced vibrations. Moreover, the novel methods overcome the defect that the authors’ previous algorithms require an additional solution to obtain accurate accelerations. Linear and nonlinear examples are solved to confirm the numerical performance and superiority of four novel high-order algorithms.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0939-1533
1432-0681
DOI:10.1007/s00419-024-02637-y