- Source: Dynamic substructuring
Dynamic Substructuring (DS) is an engineering tool used to model and analyse the dynamics of mechanical systems by means of its components or substructures. Using the dynamic substructuring approach one is able to analyse the dynamic behaviour of substructures separately and to later on calculate the assembled dynamics using coupling procedures. Dynamic substructuring has several advantages over the analysis of the fully assembled system:
Substructures can be modelled in the domain that is most appropriate, e.g. experimentally obtained substructures can be combined with numerical models.
Large and/or complex systems can be optimized on substructure level.
Numerical computation load can be reduced as solving several substructures is computationally less demanding than solving one large system.
Substructure models of different development groups can be shared and combined without exposing the modelling details.
Dynamic substructuring is particularly tailored to simulation of mechanical vibrations, which has implications for many product aspects such as sound / acoustics, fatigue / durability, comfort and safety. Also, dynamic substructuring is applicable to any scale of size and frequency. It is therefore a widely used paradigm in industrial applications ranging from automotive and aerospace engineering to design of wind turbines and high-tech precision machinery.
History
The roots of dynamic substructuring can be found in the field of domain decomposition. In 1890 the mathematician Hermann Schwarz came up with an iterative procedure for domain decomposition which allows to solve for continuous coupled subdomains. However, many of the analytical models of coupled continuous subdomains do not have closed-form solutions, which led to discretization and approximation techniques such as the Ritz method (which is sometimes called the Rayleigh-Ritz method due to the similarity between Ritz's formulation and the Rayleigh ratio) the boundary element method (BEM) and the finite element method (FEM). These methods can be considered as "first level" domain decomposition techniques.
The finite element method proved to be the most efficient method and the invention of the microprocessor made it possible to easily solve a large variety of physical problems. In order to analyse even larger and more complex problems, methods were invented to optimize the efficiency of the discretized calculations. The first step was replacing the direct solvers by iterative solvers such as the conjugate gradient method. The lack of robustness and slow convergence of these solvers did not make them an interesting alternative in the beginning. The rise of parallel computing in the 1980s however sparked their popularity. Complex problems could now be solved by dividing the problem into subdomains, each processed by a separate processor, and solving for the interface coupling iteratively. This can be seen as a second level domain decomposition as is visualized in the figure.
The efficiency of dynamic modelling could be increased even further by reducing the complexity of the individual subdomains. This reduction of the subdomains (or substructures in the context of structural dynamics) is realized by representing substructures by means of their general responses. Expressing the separate substructures by means of their general response instead of their detailed discretization led to the so-called dynamic substructuring method. This reduction step also allowed for replacing the mathematical description of the domains by experimentally obtained information. This reduction step is also visualized by the reduction arrow in the figure.
The first dynamic substructuring methods were developed in the 1960s and were more commonly known under the name component mode synthesis (CMS). The benefits of dynamic substructuring were quickly discovered by the scientific and engineering communities and it became an important research topic in the field of structural dynamics and vibrations. Major developments followed, resulting in e.g. the classic Craig-Bampton method. The Craig-Bampton method employs static condensation (Guyan reduction) and modal truncation techniques to effectively reduce the degrees of freedom in a system.
Due to improvements in sensor and signal processing technology in the 1980s, substructuring techniques also became attractive for the experimental community. Methods dealing with structural dynamic modification were created in which coupling techniques were directly applied to measured frequency response functions (FRFs). Broad popularity of the method was gained when Jetmundsen et al. formulated the classical frequency-based substructuring (FBS) method, which laid the ground work for frequency-based dynamic substructuring. In 2006 a systematic notation was introduced by De Klerk et al. in order to simplify the difficult and elaborate notation that had been used prior. The simplification was done by means of two Boolean matrices that handle all the "bookkeeping" involved in the assembly of substructures
Domains
Dynamic substructuring can best be seen as a domain-independent toolset for assembly of component models, rather than a modelling method of its own. Generally, dynamic substructuring can be used for all domains that are well suited to simulate multiple input/multiple output behaviour. Five domains that are well suited for substructuring are:
Physical domain
Modal domain
Frequency domain
Time domain
State-space domain
The physical domain concerns methods that are based on (linearised) mass, damping and stiffness matrices, typically obtained from numerical FEM modelling. Popular solutions to solve the associated system of second order differential equations are the time integration schemes of Newmark and the Hilbert-Hughes-Taylor scheme. The modal domain concerns component mode synthesis (CMS) techniques such as the Craig-Bampton, Rubin and McNeal method. These methods provide efficient modal reduction bases and assembly techniques for numerical models in the physical domain. The frequency domain is more popularly known as Frequency Based Substructuring (FBS). Based on the classic formulation of Jetmundsen et al. and the reformulation of De Klerk et al., it has become the most commonly used domain for substructuring, because of the ease of expressing the differential equations of a dynamical system (by means of Frequency Response Functions, FRFs) and the convenience of implementing experimentally obtained models. The time domain refers to the recently proposed concept of Impulse Based Substructuring (IBS), which expresses the behaviour of a dynamic system using a set of Impulse Response Functions (IRFs). The state-space domain, finally, refers to methods proposed by Sjövall et al. that employ system identification techniques common to control theory.
An overview of the governing equations of the five herementioned domains is presented in the table below.
As dynamic substructuring is a domain-independent toolset, it is applicable to the dynamic equations of all domains. In order to establish substructure assembly in a particular domain, two interface conditions need to be implemented. This is explained next, followed by a few common substructuring techniques.
Interface Conditions
To establish substructuring coupling / decoupling in each of the above-mentioned domains, two conditions should be met:
Coordinate compatibility, i.e. the connecting nodes of two substructures should have equal interface displacement.
Force equilibrium, i.e. the interface forces between connecting nodes have equal magnitude and opposing sign.
These are the two essential conditions that keep substructures together, hence allow to construct an assembly of multiple components. Note that the conditions are comparable with Kirchhoff's laws for electric circuits, in which case similar conditions apply to currents and voltages though/over electric components in a network; see also Mechanical–electrical analogies.
= Substructure connectivity
=Consider two substructures A and B as depicted in the figure. The two substructures comprise a total of six nodes; the displacements of the nodes are described by a set of Degrees of Freedom (DoFs). The DoFs of the six nodes are partitioned as follows:
DoFs of the internal nodes of substructure A;
DoFs of the coupling nodes of substructures A and B, i.e. interface DoFs;
DoFs of the internal nodes of substructure B.
Note that the denotation 1, 2 and 3 indicates the function of the nodes/DoFs rather than the total amount. Let us define the sets of DoFs for the two substructures A and B in concatenated form. The displacements and applied forces are represented by the sets
u
{\displaystyle \mathbf {u} }
and
f
{\displaystyle \mathbf {f} }
. For the purpose of substructuring, a set of interface forces
g
{\displaystyle \mathbf {g} }
is introduced which only contains non-zero entries on the interface DoFs:
u
≜
[
u
1
A
u
2
A
u
2
B
u
3
B
]
f
≜
[
f
1
A
f
2
A
f
2
B
f
3
B
]
g
≜
[
0
g
2
A
g
2
B
0
]
u
,
f
,
g
∈
R
n
{\displaystyle \mathbf {u} \triangleq {\begin{bmatrix}\mathbf {u} _{1}^{A}\\\mathbf {u} _{2}^{A}\\\mathbf {u} _{2}^{B}\\\mathbf {u} _{3}^{B}\\\end{bmatrix}}\quad \mathbf {f} \triangleq {\begin{bmatrix}\mathbf {f} _{1}^{A}\\\mathbf {f} _{2}^{A}\\\mathbf {f} _{2}^{B}\\\mathbf {f} _{3}^{B}\\\end{bmatrix}}\quad \mathbf {g} \triangleq {\begin{bmatrix}\mathbf {0} \\\mathbf {g} _{2}^{A}\\\mathbf {g} _{2}^{B}\\\mathbf {0} \\\end{bmatrix}}\quad \mathbf {u} ,\mathbf {f} ,\mathbf {g} \in \mathbb {R} ^{n}}
The relation between dynamic displacements
u
{\displaystyle \mathbf {u} }
and applied forces
f
{\displaystyle \mathbf {f} }
of the uncoupled problem is governed by a particular dynamic equation, such as presented in the table above. The uncoupled equations of motion are augmented by extra terms/equations for compatibility and equilibrium, as discussed next.
= Compatibility
=The compatibility condition requires that the interface DoFs have the same sign and value at both sides of the interface:
u
2
A
=
u
2
B
{\displaystyle \mathbf {u} _{2}^{A}=\mathbf {u} _{2}^{B}}
. This condition can be expressed using a so-called signed Boolean matrix, denoted by
B
{\displaystyle \mathbf {B} }
. For the given example this can be expressed as:
B
u
=
0
⇒
u
2
B
−
u
2
A
=
0
⇒
B
≜
[
0
−
I
I
0
]
{\displaystyle \mathbf {B} \mathbf {u} =\mathbf {0} \quad \Rightarrow \quad \mathbf {u} _{2}^{B}-\mathbf {u} _{2}^{A}=\mathbf {0} \quad \Rightarrow \quad \mathbf {B} \triangleq {\begin{bmatrix}\mathbf {0} &-\mathbf {I} &\mathbf {I} &\mathbf {0} \end{bmatrix}}}
In some cases the interface nodes of the substructures are non-conforming, e.g. when two substructures are meshed separately. In such cases a non-Boolean matrix
B
{\displaystyle \mathbf {B} }
has to be used in order to enforce a weak interface compatibility.
A second form in which the compatibility condition can be expressed is by means of coordinate substitution by a set of generalised coordinates
q
{\displaystyle \mathbf {q} }
. The set
q
{\displaystyle \mathbf {q} }
contains the unique coordinates that remain after assembly of the substructures. Every matching pair of interface DoFs is described by a single generalised coordinate, which means that the compatibility condition is automatically enforced. Expressing
u
{\displaystyle \mathbf {u} }
using
q
{\displaystyle \mathbf {q} }
gives:
u
=
L
q
⇒
{
u
1
A
=
q
1
u
2
A
=
q
2
u
2
B
=
q
2
u
3
B
=
q
3
⇒
L
≜
[
I
0
0
0
I
0
0
I
0
0
0
I
]
{\displaystyle \mathbf {u} =\mathbf {L} \mathbf {q} \quad \Rightarrow \quad {\begin{cases}\mathbf {u} _{1}^{A}=\mathbf {q} _{1}\\\mathbf {u} _{2}^{A}=\mathbf {q} _{2}\\\mathbf {u} _{2}^{B}=\mathbf {q} _{2}\\\mathbf {u} _{3}^{B}=\mathbf {q} _{3}\\\end{cases}}\quad \Rightarrow \quad \mathbf {L} \triangleq {\begin{bmatrix}\mathbf {I} &\mathbf {0} &\mathbf {0} \\\mathbf {0} &\mathbf {I} &\mathbf {0} \\\mathbf {0} &\mathbf {I} &\mathbf {0} \\\mathbf {0} &\mathbf {0} &\mathbf {I} \\\end{bmatrix}}}
Matrix
L
{\displaystyle \mathbf {L} }
is referred to as the Boolean localisation matrix. A useful relation between matrix
B
{\displaystyle \mathbf {B} }
and
L
{\displaystyle \mathbf {L} }
can be exposed by noting that compatibility should hold for any set of physical coordinates
u
{\displaystyle \mathbf {u} }
expressed by
q
{\displaystyle \mathbf {q} }
. Indeed, substituting
u
=
L
q
{\displaystyle \mathbf {u} =\mathbf {Lq} }
in the equation
B
u
=
0
{\displaystyle \mathbf {Bu} =\mathbf {0} }
:
B
u
=
B
L
q
=
0
∀
q
{\displaystyle \mathbf {Bu} =\mathbf {B} \mathbf {L} \mathbf {q} =\mathbf {0} \quad \forall \mathbf {q} }
Hence
L
{\displaystyle \mathbf {L} }
represents the nullspace of
B
{\displaystyle \mathbf {B} }
:
{
L
=
null
(
B
)
B
T
=
null
(
L
T
)
{\displaystyle {\begin{cases}\mathbf {L} ={\text{null}}(\mathbf {B} )\\\mathbf {B} ^{T}={\text{null}}(\mathbf {L} ^{T})\end{cases}}}
This means in practice that one only needs to define
B
{\displaystyle \mathbf {B} }
or
L
{\displaystyle \mathbf {L} }
; the other Boolean matrix is calculated using the nullspace property.
= Equilibrium
=The second condition that has to be satisfied for substructure assembly is the force equilibrium for matching interface forces
g
{\displaystyle \mathbf {g} }
. For the current example, this condition can be written as
g
2
A
=
−
g
2
B
{\displaystyle \mathbf {g} _{2}^{A}=-\mathbf {g} _{2}^{B}}
. Similar to the compatibility equation, the force equilibrium condition can be expressed using a Boolean matrix. Use is made of the transpose of the Boolean localisation matrix
L
{\displaystyle \mathbf {L} }
that was introduced to write compatibility:
L
T
g
=
0
⇒
{
g
1
A
=
0
g
2
A
+
g
2
B
=
0
g
3
B
=
0
{\displaystyle \mathbf {L} ^{T}\mathbf {g} =\mathbf {0} \quad \Rightarrow \quad {\begin{cases}\mathbf {g} _{1}^{A}=\mathbf {0} \\\mathbf {g} _{2}^{A}+\mathbf {g} _{2}^{B}=\mathbf {0} \\\mathbf {g} _{3}^{B}=\mathbf {0} \end{cases}}}
The equations for
g
1
{\displaystyle \mathbf {g} _{1}}
and
g
3
{\displaystyle \mathbf {g} _{3}}
state that the interface forces on internal nodes are zero, hence not present. The equation for
g
2
{\displaystyle \mathbf {g} _{2}}
correctly establishes the force equilibrium between a matching pair of interface DoFs according to Newton's third law.
A second notation in which the equilibrium condition can be expressed is by introducing a set of Lagrange multipliers
λ
{\displaystyle {\boldsymbol {\lambda }}}
. The substitution of these Lagrange multipliers is possible as
g
2
A
{\displaystyle \mathbf {g} _{2}^{A}}
and
g
2
B
{\displaystyle \mathbf {g} _{2}^{B}}
differ only in sign, not in value. Using again the signed Boolean matrix
B
{\displaystyle \mathbf {B} }
:
g
=
−
B
T
λ
⇒
{
g
1
A
=
0
g
2
A
=
λ
g
2
B
=
−
λ
g
3
B
=
0
{\displaystyle \mathbf {g} =-\mathbf {B} ^{T}{\boldsymbol {\lambda }}\quad \Rightarrow \quad {\begin{cases}\mathbf {g} _{1}^{A}=\mathbf {0} \\\mathbf {g} _{2}^{A}={\boldsymbol {\lambda }}\\\mathbf {g} _{2}^{B}=-{\boldsymbol {\lambda }}\\\mathbf {g} _{3}^{B}=\mathbf {0} \\\end{cases}}}
The set
λ
{\displaystyle {\boldsymbol {\lambda }}}
defines the intensity of the interface forces
g
2
{\displaystyle \mathbf {g} _{2}}
. Each Lagrange multiplier represents the magnitude of two matching interface forces in the assembly. By defining the interface forces
g
{\displaystyle \mathbf {g} }
using Lagrange multipliers
λ
{\displaystyle {\boldsymbol {\lambda }}}
, force equilibrium is automatically satisfied. This can be seen by substituting
g
=
−
B
T
λ
{\displaystyle \mathbf {g} =-\mathbf {B^{T}} {\boldsymbol {\lambda }}}
into the first equilibrium equation:
L
T
g
=
−
L
T
B
T
λ
=
0
∀
g
{\displaystyle \mathbf {L} ^{T}\mathbf {g} =-\mathbf {L} ^{T}\mathbf {B} ^{T}{\boldsymbol {\lambda }}=\mathbf {0} \quad \forall \mathbf {\mathbf {g} } }
Again, the nullspace property of the Boolean matrices is used here, namely:
L
T
B
T
=
0
{\displaystyle \mathbf {L^{T}} \mathbf {B^{T}} =\mathbf {0} }
.
The two conditions as presented above can be applied to establish coupling / decoupling in a myriad of domains and are thus independent of variables such as time, frequency, mode, etc. Some implementations of the interface conditions for the most common domains of substructuring are presented below.
Substructuring in the physical domain
The physical domain is the domain that has the most straightforward physical interpretation. For each discrete linearised dynamic system one is able to write an equilibrium between the externally applied forces and the internal forces originating from intrinsic inertia, viscous damping and elasticity. This relation is governed by one of the most elementary formulas in structural vibrations:
M
u
¨
(
t
)
+
C
u
˙
(
t
)
+
K
u
(
t
)
=
f
(
t
)
{\displaystyle \mathbf {M} \mathbf {\ddot {u}} (t)+\mathbf {C} \mathbf {\dot {u}} (t)+\mathbf {K} \mathbf {u} (t)=\mathbf {f} (t)}
M
,
C
,
K
{\displaystyle \mathbf {M} ,\mathbf {C} ,\mathbf {K} }
represent the mass, damping and stiffness matrix of the system. These matrices are often obtained from finite element modelling (FEM), and are referred to as the numerical model of the structure. Furthermore,
u
{\displaystyle \mathbf {u} }
represents the DoFs and
f
{\displaystyle \mathbf {f} }
the force vector which are dependent on time
(
t
)
{\displaystyle (t)}
. This dependency is omitted in the following equations in order to improve readability.
= Coupling in the physical domain
=Coupling of
n
{\displaystyle n}
substructures in the physical domain first requires writing the uncoupled equations of motion of the
n
{\displaystyle n}
substructures in block diagonal form:
M
≜
diag
(
M
(
1
)
,
…
,
M
(
n
)
)
=
[
M
(
1
)
.
.
.
⋱
.
.
.
M
(
n
)
]
{\displaystyle \mathbf {M} \triangleq {\text{diag}}(\mathbf {M} ^{(1)},\dots ,\mathbf {M} ^{(n)})={\begin{bmatrix}\mathbf {M} ^{(1)}&.&.\\.&\ddots &.\\.&.&\mathbf {M} ^{(n)}\\\end{bmatrix}}}
C
≜
diag
(
C
(
1
)
,
…
,
C
(
n
)
)
K
≜
diag
(
K
(
1
)
,
…
,
K
(
n
)
)
{\displaystyle \mathbf {C} \triangleq {\text{diag}}(\mathbf {C} ^{(1)},\dots ,\mathbf {C} ^{(n)})\quad \mathbf {K} \triangleq {\text{diag}}(\mathbf {K} ^{(1)},\dots ,\mathbf {K} ^{(n)})}
u
≜
[
u
(
1
)
⋮
u
(
n
)
]
,
f
≜
[
f
(
1
)
⋮
f
(
n
)
]
,
g
≜
[
g
(
1
)
⋮
g
(
n
)
]
{\displaystyle \mathbf {u} \triangleq {\begin{bmatrix}\mathbf {u} ^{(1)}\\\vdots \\\mathbf {u} ^{(n)}\end{bmatrix}},\quad \mathbf {f} \triangleq {\begin{bmatrix}\mathbf {f} ^{(1)}\\\vdots \\\mathbf {f} ^{(n)}\end{bmatrix}},\quad \mathbf {g} \triangleq {\begin{bmatrix}\mathbf {g} ^{(1)}\\\vdots \\\mathbf {g} ^{(n)}\end{bmatrix}}}
Next, two assembly approaches can be distinguished: primal and dual assembly.
Primal assembly
For primal assembly, a unique set of degrees of freedom
q
{\displaystyle \mathbf {q} }
is defined in order to satisfy compatibility,
u
=
L
q
{\displaystyle \mathbf {u} =\mathbf {Lq} }
. Furthermore, a second equation is added to enforce interface force equilibrium. This results in the following coupled dynamic equilibrium equations:
{
M
L
q
¨
+
C
L
q
˙
+
K
L
q
=
f
+
g
L
T
g
=
0
{\displaystyle {\begin{cases}\mathbf {ML{\ddot {q}}+CL{\dot {q}}+KLq=f+g} \\\mathbf {L^{T}g=0} \end{cases}}}
Pre-multiplying the first equation by
L
T
{\displaystyle \mathbf {L} ^{T}}
and noting that
L
T
g
=
0
{\displaystyle \mathbf {L^{T}g} =\mathbf {0} }
, the primal assembly reduces to:
M
~
q
¨
+
C
~
q
˙
+
K
~
q
=
L
T
f
{
M
~
=
L
T
M
L
C
~
=
L
T
C
L
K
~
=
L
T
K
L
{\displaystyle \mathbf {{\tilde {M}}{\ddot {q}}+{\tilde {C}}{\dot {q}}+{\tilde {K}}q=L^{T}f} \quad {\begin{cases}\mathbf {{\tilde {M}}=L^{T}ML} \\\mathbf {{\tilde {C}}=L^{T}CL} \\\mathbf {{\tilde {K}}=L^{T}KL} \end{cases}}}
The primally assembled system matrices can be used for a transient simulation by any standard time stepping algorithm. Note that the primal assembly technique is analogue to assembly of super-elements in finite element methods.
Dual assembly
In the dual assembly formulation the global set of DoFs is retained and an assembly is made by a priori satisfying the equilibrium condition
g
=
−
B
T
λ
{\displaystyle \mathbf {g=-B^{T}{\boldsymbol {\lambda }}} }
. Again, the Lagrange multipliers represent the interface forces connecting the DoFs at the interface. As these are unknowns, they are moved to the left-hand side of the equation. In order to satisfy compatibility, a second equation is added to the system, now operating on the displacements:
{
M
u
¨
+
C
u
˙
+
K
u
+
B
T
λ
=
f
B
u
=
0
{\displaystyle {\begin{cases}\mathbf {M{\ddot {u}}+C{\dot {u}}+Ku+B^{T}{\boldsymbol {\lambda }}=f} \\\mathbf {Bu=0} \end{cases}}}
The dually assembled system can be written in matrix form as:
[
M
0
0
0
]
[
u
¨
λ
]
+
[
C
0
0
0
]
[
u
˙
λ
]
+
[
K
B
T
B
0
]
[
u
λ
]
=
[
f
0
]
{\displaystyle \mathbf {\begin{bmatrix}\mathbf {M} &\mathbf {0} \\\mathbf {0} &\mathbf {0} \end{bmatrix}} {\begin{bmatrix}\mathbf {\ddot {u}} \\{\boldsymbol {\lambda }}\end{bmatrix}}+{\begin{bmatrix}\mathbf {C} &\mathbf {0} \\\mathbf {0} &\mathbf {0} \end{bmatrix}}{\begin{bmatrix}\mathbf {\dot {u}} \\{\boldsymbol {\lambda }}\end{bmatrix}}+{\begin{bmatrix}\mathbf {K} &\mathbf {B} ^{T}\\\mathbf {B} &\mathbf {0} \end{bmatrix}}{\begin{bmatrix}\mathbf {u} \\{\boldsymbol {\lambda }}\end{bmatrix}}={\begin{bmatrix}\mathbf {f} \\\mathbf {0} \end{bmatrix}}}
This dually assembled system can also be used in a transient simulation by means of a standard time stepping algorithm.
Substructuring in the frequency domain
In order to write out the equations for frequency based substructuring (FBS), the dynamic equilibrium first has to be put in the frequency domain. Starting with the dynamic equilibrium in the physical domain:
M
u
¨
(
t
)
+
C
u
˙
(
t
)
+
K
u
(
t
)
=
f
(
t
)
{\displaystyle \mathbf {M} \mathbf {\ddot {u}} (t)+\mathbf {C} \mathbf {\dot {u}} (t)+\mathbf {K} \mathbf {u} (t)=\mathbf {f} (t)}
Taking the Fourier transform of this equation gives the dynamic equilibrium in the frequency domain:
Z
(
ω
)
u
(
ω
)
=
f
(
ω
)
with
Z
(
ω
)
=
[
−
ω
2
M
+
j
ω
C
+
K
]
{\displaystyle \mathbf {Z} (\omega )\mathbf {u} (\omega )=\mathbf {f} (\omega )\quad {\text{with}}\quad \mathbf {Z} (\omega )={\bigr [}-\omega ^{2}\mathbf {M} +j\omega \mathbf {C} +\mathbf {K} {\bigr ]}}
Matrix
Z
(
ω
)
{\displaystyle \mathbf {Z} (\omega )}
is referred to as the dynamic stiffness matrix. This matrix consists of the complex-valued frequency-dependent functions that describe the force required to generate a unit harmonic displacement at a certain DoF. The inverse of the matrix
Z
(
ω
)
{\displaystyle \mathbf {Z} (\omega )}
is defined as
Y
(
ω
)
≜
(
Z
(
ω
)
)
−
1
{\displaystyle \mathbf {Y} (\omega )\triangleq (\mathbf {Z} (\omega ))^{-1}}
and yields the more intuitive admittance notation:
u
(
ω
)
=
Y
(
ω
)
f
(
ω
)
{\displaystyle \mathbf {u} (\omega )=\mathbf {Y} (\omega )\mathbf {f} (\omega )}
The receptance matrix
Y
(
ω
)
{\displaystyle \mathbf {Y} (\omega )}
contains the frequency response functions (FRFs) of the structure which describe the displacement response to a unit input force. Other variants of the receptance matrix are the mobility and accelerance matrix, which respectively describe the velocity and acceleration response. The elements of the dynamic stiffness (or impedance in general) and receptance (or admittance in general) matrix are defined as follows:
Impedance:
Z
i
j
(
ω
)
=
f
i
(
ω
)
u
j
(
ω
)
u
k
≠
j
=
0
Admittance:
Y
i
j
(
ω
)
=
u
i
(
ω
)
f
j
(
ω
)
f
k
≠
j
=
0
{\displaystyle {\begin{aligned}{\text{Impedance:}}\quad Z_{ij}(\omega )={\frac {f_{i}(\omega )}{u_{j}(\omega )}}\quad u_{k\neq j}=0\\{\text{Admittance:}}\quad Y_{ij}(\omega )={\frac {u_{i}(\omega )}{f_{j}(\omega )}}\quad f_{k\neq j}=0\end{aligned}}}
= Coupling in the frequency domain
=In order to couple two substructures in the frequency domain, use is made of the admittance and impedance matrices of both substructures. Using the definition of substructures A and B as introduced previously, the following impedance and admittance matrices are defined (note that the frequency dependency
(
ω
)
{\displaystyle (\omega )}
is omitted from the terms to improve readability):
Z
A
≜
[
Z
11
A
Z
12
A
Z
21
A
Z
22
A
]
Z
B
≜
[
Z
22
B
Z
23
B
Z
32
B
Z
33
B
]
Y
A
≜
[
Y
11
A
Y
12
A
Y
21
A
Y
22
A
]
Y
B
≜
[
Y
22
B
Y
23
B
Y
32
B
Y
33
B
]
{\displaystyle {\begin{array}{ll}\mathbf {Z} ^{A}\triangleq {\begin{bmatrix}\mathbf {Z} _{11}^{A}&\mathbf {Z} _{12}^{A}\\\mathbf {Z} _{21}^{A}&\mathbf {Z} _{22}^{A}\\\end{bmatrix}}&\mathbf {Z} ^{B}\triangleq {\begin{bmatrix}\mathbf {Z} _{22}^{B}&\mathbf {Z} _{23}^{B}\\\mathbf {Z} _{32}^{B}&\mathbf {Z} _{33}^{B}\\\end{bmatrix}}\\[18pt]\mathbf {Y} ^{A}\triangleq {\begin{bmatrix}\mathbf {Y} _{11}^{A}&\mathbf {Y} _{12}^{A}\\\mathbf {Y} _{21}^{A}&\mathbf {Y} _{22}^{A}\\\end{bmatrix}}&\mathbf {Y} ^{B}\triangleq {\begin{bmatrix}\mathbf {Y} _{22}^{B}&\mathbf {Y} _{23}^{B}\\\mathbf {Y} _{32}^{B}&\mathbf {Y} _{33}^{B}\\\end{bmatrix}}\end{array}}}
The two admittance and impedance matrices can be put in block diagonal form in order to align with the global set of DoFs
u
{\displaystyle \mathbf {u} }
:
Z
≜
[
Z
A
0
0
Z
B
]
≜
[
Z
11
A
Z
12
A
0
0
Z
21
A
Z
22
A
0
0
0
0
Z
22
B
Z
23
B
0
0
Z
32
B
Z
33
B
]
Y
≜
[
Y
A
0
0
Y
B
]
≜
[
Y
11
A
Y
12
A
0
0
Y
21
A
Y
22
A
0
0
0
0
Y
22
B
Y
23
B
0
0
Y
32
B
Y
33
B
]
{\displaystyle {\begin{aligned}\mathbf {Z} \triangleq &{\begin{bmatrix}\mathbf {Z} ^{A}&\mathbf {0} \\\mathbf {0} &\mathbf {Z} ^{B}\end{bmatrix}}\triangleq {\begin{bmatrix}\mathbf {Z} _{11}^{A}&\mathbf {Z} _{12}^{A}&\mathbf {0} &\mathbf {0} \\\mathbf {Z} _{21}^{A}&\mathbf {Z} _{22}^{A}&\mathbf {0} &\mathbf {0} \\\mathbf {0} &\mathbf {0} &\mathbf {Z} _{22}^{B}&\mathbf {Z} _{23}^{B}\\\mathbf {0} &\mathbf {0} &\mathbf {Z} _{32}^{B}&\mathbf {Z} _{33}^{B}\\\end{bmatrix}}\\[6pt]\mathbf {Y} \triangleq &{\begin{bmatrix}\mathbf {Y} ^{A}&\mathbf {0} \\\mathbf {0} &\mathbf {Y} ^{B}\end{bmatrix}}\triangleq {\begin{bmatrix}\mathbf {Y} _{11}^{A}&\mathbf {Y} _{12}^{A}&\mathbf {0} &\mathbf {0} \\\mathbf {Y} _{21}^{A}&\mathbf {Y} _{22}^{A}&\mathbf {0} &\mathbf {0} \\\mathbf {0} &\mathbf {0} &\mathbf {Y} _{22}^{B}&\mathbf {Y} _{23}^{B}\\\mathbf {0} &\mathbf {0} &\mathbf {Y} _{32}^{B}&\mathbf {Y} _{33}^{B}\\\end{bmatrix}}\end{aligned}}}
The off-diagonal zero terms show that at this point no coupling is present between the two substructures. In order to create this coupling, use can be made of the primal or dual assembly method. Both assembly methods make use of the dynamic equations as was defined before:
Z
u
=
f
+
g
u
=
Y
(
f
+
g
)
{\displaystyle {\begin{aligned}\mathbf {Z} \mathbf {u} &=\mathbf {f} +\mathbf {g} \\\mathbf {u} &=\mathbf {Y} (\mathbf {f} +\mathbf {g} )\\\end{aligned}}}
In these equations
g
{\displaystyle \mathbf {g} }
is again used to define the set of interface forces, which are yet unknown.
Primal assembly
In order to obtain the primal system of equations, a unique set of coordinates
q
{\displaystyle \mathbf {q} }
is defined:
u
=
L
q
{\displaystyle \mathbf {u} =\mathbf {Lq} }
. By definition of an appropriate Boolean localisation matrix
L
{\displaystyle \mathbf {L} }
, a unique set of DoFs remains for which the compatibility condition is satisfied a priori (compatibility condition). In order to satisfy the equilibrium condition a second equation is added to the equations of motion:
{
Z
L
q
=
f
+
g
L
T
g
=
0
{\displaystyle {\begin{cases}\mathbf {Z} \mathbf {L} \mathbf {q} =\mathbf {f} +\mathbf {g} \\\mathbf {L} ^{T}\mathbf {g} =\mathbf {0} \end{cases}}}
Pre-multiplying the first equation with
L
T
{\displaystyle \mathbf {L} ^{T}}
yields the notation of the assembled equations of motion for the generalised coordinates
q
{\displaystyle \mathbf {q} }
:
Z
~
q
=
f
~
with
{
Z
~
=
L
T
Z
L
f
~
=
L
T
f
{\displaystyle \mathbf {\tilde {Z}} \mathbf {q} =\mathbf {\tilde {f}} \quad {\text{with}}\quad {\begin{cases}\mathbf {\tilde {Z}} =\mathbf {L} ^{T}\mathbf {Z} \mathbf {L} \\\mathbf {\tilde {f}} =\mathbf {L} ^{T}\mathbf {f} \end{cases}}}
This result can be rewritten in admittance form as:
q
=
Y
~
f
~
with
Y
~
=
(
Z
~
)
−
1
{\displaystyle \mathbf {q} =\mathbf {\tilde {Y}} \mathbf {\tilde {f}} \quad {\text{with}}\quad \mathbf {\tilde {Y}} \ =(\mathbf {\tilde {Z}} )^{-1}}
This last result gives access to the generalised responses as a result of the generalised applied forces
f
~
{\displaystyle \mathbf {\tilde {f}} }
, namely by inverting the primally assembled impedance matrix.
The primal assembly procedure is mainly of interest when one has access to the dynamics in impedance form, e.g. from finite element modelling. When one only has access to the dynamics in admittance notation, the dual formulation is a more suitable approach.
Dual assembly
A dually assembled system starts with the system written in the admittance notation. For a dually assembled system the force equilibrium condition is satisfied a priori by substituting Lagrange multipliers
λ
{\displaystyle {\boldsymbol {\lambda }}}
for the interface forces:
g
=
−
B
T
λ
{\displaystyle \mathbf {g} =-\mathbf {B} ^{T}{\boldsymbol {\lambda }}}
. The compatibility condition is enforced by adding an additional equation:
{
u
=
Y
(
f
−
B
T
λ
)
B
u
=
0
{\displaystyle {\begin{cases}\mathbf {u} =\mathbf {Y} (\mathbf {f} -\mathbf {B} ^{T}{\boldsymbol {\lambda }})\\\mathbf {B} \mathbf {u} =\mathbf {0} \end{cases}}}
Substituting the first line in the second and solving for
λ
{\displaystyle {\boldsymbol {\lambda }}}
gives:
λ
=
(
B
Y
B
T
)
−
1
B
Y
f
{\displaystyle {\boldsymbol {\lambda }}=(\mathbf {B} \mathbf {Y} \mathbf {B} ^{T})^{-1}\mathbf {B} \mathbf {Y} \mathbf {f} }
The term
B
Y
f
{\displaystyle \mathbf {B} \mathbf {Y} \mathbf {f} }
represents the incompatibility caused by the uncoupled responses of the substructures to the applied forces
f
{\displaystyle \mathbf {f} }
. By multiplying the incompatibility with the combined interface stiffness, i.e.
(
B
Y
B
T
)
−
1
{\displaystyle (\mathbf {B} \mathbf {Y} \mathbf {B} ^{T})^{-1}}
, the forces
λ
{\displaystyle {\boldsymbol {\lambda }}}
that keep the substructures together are determined. The coupled response is obtained by substituting the calculated
λ
{\displaystyle {\boldsymbol {\lambda }}}
back into the original equation:
u
=
Y
f
−
Y
B
T
(
B
Y
B
T
)
−
1
B
Y
f
u
=
Y
~
f
with:
Y
~
=
(
I
−
Y
B
T
(
B
Y
B
T
)
−
1
B
)
Y
{\displaystyle {\begin{aligned}&\mathbf {u} =\mathbf {Y} \mathbf {f} -\mathbf {Y} \mathbf {B} ^{T}(\mathbf {BYB^{T}} )^{-1}\mathbf {BYf} \\[3pt]&\mathbf {u} =\mathbf {\tilde {Y}} \mathbf {f} \quad {\text{with:}}\quad \mathbf {\tilde {Y}} ={\big (}\mathbf {I} -\mathbf {Y} \mathbf {B} ^{T}(\mathbf {BYB^{T}} )^{-1}\mathbf {B} {\big )}\mathbf {Y} \end{aligned}}}
This coupling method is referred to as the Lagrange-multiplier frequency-based substructuring (LM-FBS) method. The LM-FBS method allows for quick and easy assembling of an arbitrary number of substructures in a systematic fashion. Note that the result
Y
~
{\displaystyle \mathbf {\tilde {Y}} }
is theoretically the same as was obtained above by application of primal assembly.
= Decoupling in the frequency domain
=In addition to coupling of substructures, one is also able to decouple substructures from assemblies. Using the plus sign as a substructure coupling operator, the coupling procedure could simply be described as AB = A + B. Using a similar notation, decoupling could be formulated as AB - B = A. Decoupling procedures are often required to remove substructures that were added for measurement purposes, e.g. to fix the structure. Similar to coupling, a primal and dual formulation exists for decoupling procedures.
Primal disassembly
As a result of the primal coupling, the impedance matrix of the assembled system can be written as follows:
Z
A
B
=
[
Z
11
A
B
Z
12
A
B
Z
13
A
B
Z
21
A
B
Z
22
A
B
Z
23
A
B
Z
31
A
B
Z
32
A
B
Z
33
A
B
]
=
[
Z
11
A
Z
12
A
0
Z
21
A
Z
22
A
+
Z
22
B
Z
23
B
0
Z
32
B
Z
33
B
]
{\displaystyle \mathbf {Z} ^{AB}={\begin{bmatrix}\mathbf {Z} _{11}^{AB}&\mathbf {Z} _{12}^{AB}&\mathbf {Z} _{13}^{AB}\\\mathbf {Z} _{21}^{AB}&\mathbf {Z} _{22}^{AB}&\mathbf {Z} _{23}^{AB}\\\mathbf {Z} _{31}^{AB}&\mathbf {Z} _{32}^{AB}&\mathbf {Z} _{33}^{AB}\end{bmatrix}}={\begin{bmatrix}\mathbf {Z} _{11}^{A}&\mathbf {Z} _{12}^{A}&\mathbf {0} \\\mathbf {Z} _{21}^{A}&\mathbf {Z} _{22}^{A}+\mathbf {Z} _{22}^{B}&\mathbf {Z} _{23}^{B}\\\mathbf {0} &\mathbf {Z} _{32}^{B}&\mathbf {Z} _{33}^{B}\end{bmatrix}}}
Using this relation, the following trivial subtraction operation would suffice for the decoupling of the substructure B from assembly AB:
[
Z
11
A
Z
12
A
0
Z
21
A
Z
22
A
+
Z
22
B
Z
23
B
0
Z
32
B
Z
33
B
]
−
[
0
0
0
0
Z
22
B
Z
23
B
0
Z
32
B
Z
33
B
]
=
[
Z
11
A
Z
12
A
0
Z
21
A
Z
22
A
0
0
0
0
]
{\displaystyle {\begin{bmatrix}\mathbf {Z} _{11}^{A}&\mathbf {Z} _{12}^{A}&\mathbf {0} \\\mathbf {Z} _{21}^{A}&\mathbf {Z} _{22}^{A}+\mathbf {Z} _{22}^{B}&\mathbf {Z} _{23}^{B}\\\mathbf {0} &\mathbf {Z} _{32}^{B}&\mathbf {Z} _{33}^{B}\end{bmatrix}}-{\begin{bmatrix}\mathbf {0} &\mathbf {0} &\mathbf {0} \\\mathbf {0} &\mathbf {Z} _{22}^{B}&\mathbf {Z} _{23}^{B}\\\mathbf {0} &\mathbf {Z} _{32}^{B}&\mathbf {Z} _{33}^{B}\end{bmatrix}}={\begin{bmatrix}\mathbf {Z} _{11}^{A}&\mathbf {Z} _{12}^{A}&\mathbf {0} \\\mathbf {Z} _{21}^{A}&\mathbf {Z} _{22}^{A}&\mathbf {0} \\\mathbf {0} &\mathbf {0} &\mathbf {0} \end{bmatrix}}}
By placing the impedance of AB and B in block-diagonal form, with a minus sign for the impedance of B to account for the subtraction operation, the same equation that was used for primal coupling can now be used to perform the primal decoupling procedures.
Z
≜
[
Z
A
B
0
0
−
Z
B
]
⇒
Z
~
=
L
T
Z
L
{\displaystyle \mathbf {Z} \triangleq {\begin{bmatrix}\mathbf {Z} ^{AB}&\mathbf {0} \\\mathbf {0} &-\mathbf {Z} ^{B}\end{bmatrix}}\quad \Rightarrow \quad \mathbf {\tilde {Z}} =\mathbf {L} ^{T}\mathbf {Z} \mathbf {L} }
with:
L
=
[
I
0
0
0
I
0
0
0
I
0
I
0
0
0
I
]
{\displaystyle \mathbf {L} ={\begin{bmatrix}\mathbf {I} &\mathbf {0} &\mathbf {0} \\\mathbf {0} &\mathbf {I} &\mathbf {0} \\\mathbf {0} &\mathbf {0} &\mathbf {I} \\\mathbf {0} &\mathbf {I} &\mathbf {0} \\\mathbf {0} &\mathbf {0} &\mathbf {I} \end{bmatrix}}}
The primal disassembly can thus be understood as the assembly of structure AB with the negative impedance of substructure B. A limitation of the primal disassembly is that all DoF of the substructure that is to be decoupled have to be exactly represented in the assembled situation. For numerical decoupling situations this should not pose any problems, however for experimental cases this can be troublesome. A solution to this problem can be found in the dual disassembly.
Dual disassembly
Similar to the dual assembly, the dual disassembly approaches the decoupling problem using the admittance matrices. Decoupling in the dual domain means finding a force that ensures compatibility, yet acts in the opposite direction. This newly found force would then counteract the force that is applied to the assembly due to the dynamics of substructure B. Writing this out in equations of motion:
{
u
A
B
=
Y
A
B
f
+
Y
A
B
g
u
B
=
−
Y
B
g
{\displaystyle {\begin{cases}\mathbf {u} ^{AB}=\mathbf {Y} ^{AB}\mathbf {f} +\mathbf {Y} ^{AB}\mathbf {g} \\\mathbf {u} ^{B}=-\mathbf {Y} ^{B}\mathbf {g} \end{cases}}}
In order to write the dynamics of both systems in one equation, using the LM-FBS assembly notation, the following matrices are defined:
Y
≜
[
Y
A
B
0
0
−
Y
B
]
u
=
[
u
1
A
B
u
2
A
B
u
3
A
B
u
2
B
u
3
B
]
;
f
≜
[
f
1
A
B
f
2
A
B
0
0
0
]
;
g
≜
[
0
g
2
A
B
0
g
2
B
0
]
{\displaystyle {\begin{aligned}\mathbf {Y} \triangleq &{\begin{bmatrix}\mathbf {Y} ^{AB}&\mathbf {0} \\\mathbf {0} &-\mathbf {Y} ^{B}\end{bmatrix}}\\[3pt]\mathbf {u} =&{\begin{bmatrix}\mathbf {u} _{1}^{AB}\\\mathbf {u} _{2}^{AB}\\\mathbf {u} _{3}^{AB}\\\mathbf {u} _{2}^{B}\\\mathbf {u} _{3}^{B}\end{bmatrix}};\quad \mathbf {f} \triangleq {\begin{bmatrix}\mathbf {f} _{1}^{AB}\\\mathbf {f} _{2}^{AB}\\\mathbf {0} \\\mathbf {0} \\\mathbf {0} \end{bmatrix}};\quad \mathbf {g} \triangleq {\begin{bmatrix}\mathbf {0} \\\mathbf {g} _{2}^{AB}\\\mathbf {0} \\\mathbf {g} _{2}^{B}\\\mathbf {0} \end{bmatrix}}\end{aligned}}}
In order to enforce compatibility, a similar approach is used as for the assembly task. Defining a
B
{\displaystyle \mathbf {B} }
-matrix to enforce compatibility:
B
=
[
0
−
I
0
I
0
]
{\displaystyle \mathbf {B} ={\begin{bmatrix}\mathbf {0} &-\mathbf {I} &\mathbf {0} &\mathbf {I} &\mathbf {0} \end{bmatrix}}}
Using this notation, the disassembly procedure can be performed using exactly the same equation as was used for the dual assembly:
{
u
=
Y
(
f
−
B
T
λ
)
B
u
=
0
{\displaystyle {\begin{cases}\mathbf {u} =\mathbf {Y} (\mathbf {f} -\mathbf {B} ^{T}{\boldsymbol {\lambda }})\\\mathbf {B} \mathbf {u} =\mathbf {0} \end{cases}}}
This means that coupling and decoupling procedures using LM-FBS require identical steps, the only difference being the manner in which the global admittance matrix is defined. Indeed, the substructures to couple appear with a plus sign, whereas decoupled structures carry a minus sign:
coupling
Y
≜
[
Y
A
0
0
Y
B
]
decoupling
Y
≜
[
Y
A
B
0
0
−
Y
B
]
{\displaystyle {\begin{aligned}{\text{coupling}}\quad \mathbf {Y} &\triangleq {\begin{bmatrix}\mathbf {Y} _{A}&\mathbf {0} \\\mathbf {0} &\mathbf {Y} _{B}\end{bmatrix}}\\{\text{decoupling}}\quad \mathbf {Y} &\triangleq {\begin{bmatrix}\mathbf {Y} _{AB}&\mathbf {0} \\\mathbf {0} &-\mathbf {Y} _{B}\end{bmatrix}}\end{aligned}}}
More advanced decoupling techniques use the fact that internal points of substructure B appear in both the admittances of AB and B, hence can be used to enhance the decoupling process. Such techniques are described in.
See also
References
Kata Kunci Pencarian:
- Dynamic substructuring
- Optimal substructure
- Dynamic programming
- Guyan reduction
- Substructural type system
- John Hogan (mathematician)
- Nastran
- Type system
- Milky Way
- Bellman equation
