2021
DOI: 10.1007/s00021-021-00593-z
|View full text |Cite
|
Sign up to set email alerts
|

Refactorization of Cauchy’s Method: A Second-Order Partitioned Method for Fluid–Thick Structure Interaction Problems

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2021
2021
2025
2025

Publication Types

Select...
5
1

Relationship

2
4

Authors

Journals

citations
Cited by 13 publications
(11 citation statements)
references
References 40 publications
0
11
0
Order By: Relevance
“…The (DLN) methods are indexed by the free parameter δ ∈ [0, 1]. When δ = 1, the (DLN) method becomes the (implicit) midpoint rule [7,8]…”
Section: The Dln Methods and Its Refactorizationmentioning
confidence: 99%
See 1 more Smart Citation
“…The (DLN) methods are indexed by the free parameter δ ∈ [0, 1]. When δ = 1, the (DLN) method becomes the (implicit) midpoint rule [7,8]…”
Section: The Dln Methods and Its Refactorizationmentioning
confidence: 99%
“…The refactorization of an algorithm to reduce its cognitive complexity has been used in [7] to rearrange a family of one-leg one-step methods into a backward Euler code followed by post-processing, and further applied for partitioning multi-physics problems [17,18,8,19]. In [20], the authors describe the implementation of the (DLN) formulas in a Nordsieck formulation [21,22] essentially identical to that of the backward differentiation formulas, facilitating to adapt Nordsieck formulation codes like DIFSUB [23,24] to the (DLN) formulas.…”
Section: Related Workmentioning
confidence: 99%
“…The one-leg 2-step (DLN) methods (8) satisfy unconditionally the following long-time energy bounds: for any integer M > 1, (8). Using the skew-symmetry property of b and the Cauchy-Schwarz inequality we obtain…”
Section: Theoremmentioning
confidence: 99%
“…Theorem 2 Let (u(t), p(t)) be a sufficiently smooth, strong solution of the (NSE). Under the time step condition (11), there exists a constant C > 0 such that the solution to the DLN algorithm (8) satisfies the following error estimates…”
Section: Lemma 2 Let U(t) Be Any Continuous Function Onmentioning
confidence: 99%
See 1 more Smart Citation