2012
DOI: 10.1061/(asce)cp.1943-5487.0000169
|View full text |Cite
|
Sign up to set email alerts
|

Optimization-Based Strong Coupling Procedure for Partitioned Analysis

Abstract: The concept of partitioning a complex engineering problem into smaller, manageable components and investigating each individual component autonomously has been in use for many decades. Such partitioning approaches, however, rely on strong and occasional unwarranted assumptions regarding the interactions among different engineering components. Fluid and structure interaction, soil and structure interaction, and human and structure interaction are but a few of the many such partitioned analyses commonly needed i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
13
0

Year Published

2012
2012
2015
2015

Publication Types

Select...
4
4

Relationship

2
6

Authors

Journals

citations
Cited by 13 publications
(13 citation statements)
references
References 37 publications
0
13
0
Order By: Relevance
“…Similarly, the torque and force in (1b) and (1c) depend on the (unknown) positions and velocities. When a strong coupling between the equations is required [10], [11], iterative procedures based on Gauss-Seidel or to Newton-Raphson schemes are usually adopted. They rely on the efficient evaluation (also approximated) of a number of derivatives [11], [12].…”
Section: C(t) = (X(t) Y(t) Z(t) φ(T) θ (T) ψ(T))mentioning
confidence: 99%
See 1 more Smart Citation
“…Similarly, the torque and force in (1b) and (1c) depend on the (unknown) positions and velocities. When a strong coupling between the equations is required [10], [11], iterative procedures based on Gauss-Seidel or to Newton-Raphson schemes are usually adopted. They rely on the efficient evaluation (also approximated) of a number of derivatives [11], [12].…”
Section: C(t) = (X(t) Y(t) Z(t) φ(T) θ (T) ψ(T))mentioning
confidence: 99%
“…When a strong coupling between the equations is required [10], [11], iterative procedures based on Gauss-Seidel or to Newton-Raphson schemes are usually adopted. They rely on the efficient evaluation (also approximated) of a number of derivatives [11], [12]. These schemes when applied to the problem at hand may require very long computations [10].…”
Section: C(t) = (X(t) Y(t) Z(t) φ(T) θ (T) ψ(T))mentioning
confidence: 99%
“…Finding the correct values for these dependent variables is the main question to be solved in strong coupling problems. Various strong coupling algorithms are proposed in the literature (Figures 2a-d): the Block-Jacobi method (Matthies et al, 2006;Fernandez and Moubachir, 2005), the Block Gauss-Siedel method (Joosten et al, 2009;Matthies et al, 2006), gradient-based Newton-like methods (Heil, 2004;Matthies and Steindorf, 2002b;Matthies and Steindorf, 2003;Fernandez and Moubachir, 2005), and optimization-based methods (Farajpour and Atamturktur, 2012). Note that in partitioned analysis, quantification, propagation, and mitigation of uncertainties in input parameters play an important role for the complete validation of coupled models (Avramova and Ivanov, 2010), which is currently an active research area.…”
Section: Partitioned Analysis Proceduresmentioning
confidence: 99%
“…Y dep in these equations then represents the combined set of values transferred from one constituent to another. Several methods have been proposed to solve for the coupling conditions (Matthies et al, 2006); for instance, Newton-like coupling methods Steindorf, 2002a, b, 2003;Fernandez and Moubachir, 2005), Block-Jacobi and Block-Gauss-Seidel methods ( Joosten et al, 2009), and optimization-based coupling (OBC) method (Farajpour and Atamturktur, 2012). The OBC method overcomes the divergence problems that classical coupling techniques, such as Block-Gauss-Seidel, may face.…”
mentioning
confidence: 99%
“…The OBC method overcomes the divergence problems that classical coupling techniques, such as Block-Gauss-Seidel, may face. Furthermore, the simultaneous execution of constituent models makes OBC suitable for parallel computing (Farajpour and Atamturktur, 2012). Therefore, the OBC is preferable for this work.…”
mentioning
confidence: 99%