Open access

Efficient Model Transition in Adaptive Multi-Resolution Modeling of Biopolymers

Written By

Mohammad Poursina, Imad M. Khan and Kurt S. Anderson

Submitted: 11 November 2011 Published: 11 July 2012

DOI: 10.5772/48196

From the Edited Volume

Linear Algebra - Theorems and Applications

Edited by Hassan Abid Yasser

Chapter metrics overview

1,620 Chapter Downloads

View Full Metrics

1. Introduction

Multibody dynamics methods are being used extensively to model biomolecular systems to study important physical phenomena occurring at different spatial and temporal scales [1], [2]. These systems may contain thousands or even millions of degrees of freedom, whereas, the size of the time step involved during the simulation is on the order of femto seconds. Examples of such problems may include proteins, DNAs, and RNAs. These highly complex physical systems are often studied at resolutions ranging from a fully atomistic model to coarse-grained molecules, up to a continuum level system [3], [4], [5]. In studying these problems, it is often desirable to change the system definition during the course of the simulation in order to achieve an optimal combination of accuracy and speed. For example, in order to study the overall conformational motion of a bimolecular system, a model based on super-atoms (beads) [6], [7] or articulated multi-rigid and/or flexible body [8], [9] can be used. Whereas, localized behavior has to be studied using fully atomistic models. In such cases, the need for the transition from a fine-scale to a coarse model and vice versa arises. Illustrations of a fully atomistic model of a molecule, and its coarse-grained model are shown in Fig. (1-a) and Fig. (1-b).

(a) Fully atomistic model (b) Mixed type multibody model
Advertisement

Figure 1.

Illustration of a biomolecular system. a) Fully atomistic model. b) Coarse grain model with different rigid and flexible sub-domains connected to each other via kinematic joints.

Given the complexity and nonlinearity of challenging bimolecular systems, it is expected that different physical parameters such as dynamic boundary conditions and applied forces will have a significant affect on the behavior of the system. It is shown in [10] that time-invariant coarse models may provide inadequate or poor results and as such, an adaptive framework to model these systems should be considered [11]. Transitions between different system models can be achieved by intelligently removing or adding certain degrees of freedom (dof). This change occurs instantaneously and as such, may be viewed as model changes as a result of impulsively applied constraints. For multi-rigid and flexible body systems, the transition from a higher fidelity (fine-scale) model to a lower fidelity model (coarse-scale) using divide-and-conquer algorithm (DCA) has been studied previously in [12], [13]. DCA efficiently provides the unique states of the system after this transition. In this chapter, we focus on the transition from a coarse model to a fine-scale model. When the system is modeled in an articulated multi-flexible-body framework, such transitions may be achieved by two different means. In the first, a fine-scale model is generated by adding flexible dof. This type of fine scaling may be necessary in order to capture higher frequency modes. For instance, when two molecules bind together, due to the impact, the higher frequency modes of the system are excited. The second type of fine scaling transition may be achieved through releasing the connecting joints in the multi-flexible-body system. In other words, certain constraints on joints are removed to introduce new dof in the model.

In contrast to those types of dynamic systems in which the model definition is persistent, and the total energy of the system is conserved, the class of problems discussed here experiences discontinuous changes in the model definition and hence, the energy of the system must also change (nominally increase) in a discontinuous fashion. During the coarse graining process, based on a predefined metric, one may conclude that naturally existing higher modes are less relevant and can be ignored. As such, the kinetic energy associated with those modes must be estimated and properly accounted for, when transitioning back to the fine-scale model. Moreover, any change in the system model definition is assumed to occur as a result of impulsively applied constraints, without the influence of external loads. As such, the generalized momentum of the system must also be conserved [14]. In other words, the momentum of each differential element projected onto the space of admissible motions permitted by the more restrictive model (whether pre- or post-transition) when integrated over the entire system must be conserved across the model transition. If the generalized momentum is not conserved during the transition, the results are non-physical, and the new initial conditions for the rest of the simulation of the system are invalid.

In the next section, a brief overview of the DCA and analytical preliminaries necessary to the algorithm development are presented. The optimization problem associated with the coarse to fine scale transitioning is discussed next. Then the impulse-momentum formulation for transitioning from coarse models to fine-scale models in the articulated flexible-body scheme is presented. Finally conclusions are made.

Advertisement

2. Theoretical background

In this section, a brief introduction of the basic divide-and-conquer algorithm is presented. The DCA scheme has been developed for the simulation of general multi-rigid and multi-flexible-body systems [15], [16], [13], and systems with discontinuous changes [17], [12]. The basic algorithm described here is independent of the type of problem and is presented so that the chapter might be more self contained. In other words, it can be used to study the behavior of any rigid- and flexible-body system, even if the system undergoes a discontinuous change. Some mathematical preliminaries are also presented in this section which are important to the development of the algorithm.

2.1. Basic divide-and-conquer algorithm

The basic DCA scheme presented in this chapter works in a similar manner described in detail in [15], [16]. Consider two representative flexible bodies k and k+1 connected to each other by a joint Jk as shown in Fig. (2-a). The two points of interest, H1k and H2k, on body k are termed handles. A handle is any selected point through which a body interacts with the environment. In this chapter, we will limit our attention to each body having two handles, and each handle coincides with the joint location on the body, i.e. joint locations Jk-1 and Jk in case of body k. Similarly, for body k+1, the points H1k+1 and H2k+1 are located at the joint locations Jk and Jk+1, respectively. Furthermore, large rotations and translations in the flexible bodies are modeled as rigid body dof. Elastic deformations in the flexible bodies are modeled through the use of modal coordinates and admissible shape functions.

DCA is implemented using two main processes, hierarchic assembly and disassembly. The goal of the assembly process is to find the equations describing the dynamics of each body in the hierarchy at its two handles. This process begins at the level of individual bodies and adjacent bodies are assembled in a binary tree configuration. Using recursive formulations, this process couples the two-handle equations of successive bodies to find the two-handle equations of the resulting assembly. For example, body k and body k+1 are coupled together to form the assembly shown in Fig. (2-b). At the end of the assembly process, the two-handle equations of the entire system are obtained.

(a) Consecutive bodies (b) Assembly k:k+1

Figure 2.

Assembling of the two bodies to form a subassembly. a) Consecutive bodies k and k+1. b) A fictitious subassembly formed by coupling bodies k and k+1.

The hierarchic disassembly process begins with the solution of the two-handle equations associated with the primary node of the binary tree. The process works from this node to the individual sub-domain nodes of the binary tree to solve for the two-handle equations of the constituent subassemblies. This process is repeated until all unknowns (e.g., spatial constraint forces, spatial constraint impulses, spatial accelerations, jumps in the spatial velocities) of the bodies at the individual sub-domain level of the binary tree are known. The assembly and disassembly processes are illustrated in Fig. (?).

Figure 3.

The hierarchic assembly-disassembly process in DCA.

2.2. Analytical preliminaries

For convenience, the superscript c shows that a quantity of interest is associated with the coarse model, while f denotes that it is associated with the fine model. For example, the column matrix v1q1c represents the velocity of handle-1 in the coarse model, and v1q1f represents the velocity of the same handle in the fine-scale model. In these matrices, v1 and q1 are the spatial velocity vector of handle-1 and the associated generalized modal speeds, respectively.

As discussed previously, the change in the system model definition may occur by changing the number of flexible modes used to describe the behavior of flexible bodies, and/or the number of dof of the connecting joints. To implement these changes in the system model mathematically, the joint free-motion map is defined as follows.

The joint free-motion map PRJk can be interpreted as the 6?k matrix of the free-modes of motion permitted by the ?k degree-of-freedom joint, Jk. In other words, PRJk maps ?k1 generalized speeds associated with relative free motion permitted by the joint into a 61 spatial relative velocity vector which may occur across the joint, Jk [15]. For instance, consider a transition in which a spherical joint in the system is altered, where only one dof is locked about the first axis. The joint free-motion maps of the fine and coarse models in this case are shown in the following:

P R J k f = 1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 , P R J k c = 0 0 1 0 0 1 0 0 0 0 0 0 uid10

We define the orthogonal complement of the joint free-motion map, DRk. As such, by definition one arises at the following

( D R k ) T P R J k = 0 uid11
Advertisement

3. Optimization problem

Any violation in the conservation of the generalized momentum of the system in the transition between different models leads to non-physical results since the instantaneous switch in the system model definition is incurred without the influence of any external load. In other words, the momentum of each differential element projected onto the space of the admissible motions permitted by the more restrictive model (whether pre- or post-transition) when integrated over the entire system must be conserved across the model transition [14]. Jumps in the system partial velocities due to the sudden change in the model resolution result in the jumps in the generalized speeds corresponding to the new set of degrees of freedom. Since the model is instantaneously swapped, the position of the system does not change. Hence, the position dependent forces acting on the system do not change, and do not affect the generalized speeds. Any change in the applied loads (e.g., damping terms) which might occur due to the change in the model definition and the associated velocity jumps do not contribute to the impulse-momentum equations which describe the model transition. This is because these changes in the applied loads are bounded, and integrated over the infinitesimally short transition time.

Consider a fine-scale model with n dof. Let the dof of the model reduce to n-m after the imposition of certain instantaneous constraints. In this case, the conservation of the generalized momentum of the system is expressed as

L c / c = L f / c uid12

In the above equation, Lc/c and Lf/c represent the momenta of the coarse and fine models, respectively, projected on to the space of partial velocity vectors of the coarse model. Equation (?) provides a set of n-m equations which are linear in the generalized speeds of the coarse model and solvable for the unique and physically meaningful states of the system after the transition to the coarser model.

Now consider the case in which, the coarse model is transitioned back to the fine-scale model. Equation (?) is still valid, and provides n-m equations with n unknown generalized speeds of the finer model. Furthermore, during the coarsening process, the level of the kinetic energy also drops because we chose to ignore certain modes of the system. However, in actual biomolecular systems such a decrease in energy does not happen. Consequently, it is important to realize the proper kinetic energy when transitioning back to the fine-scale model. Therefore, the following equation must be satisfied

K E f = 1 2 ( u f ) T ? u f uid13

In the above equation uf is the n1 column matrix containing the generalized speeds of the fine model, and ? represents the generalized inertia matrix of the fine model. It is clear that Eqs.�(?) and (?) provide n-m+1 equations with n unknowns. This indicates that the problem is under-determined when multiple dof of the system are released. We may arrive at a unique or finite number of solutions, solving the following optimization problem

Optimize J ( u f , t ) Subjected to ? i ( u f , t ) = 0 , i = 1 , ? , k uid14

In the above equation, J is the physics- or knowledge- or mathematics-based objective function to be optimized (nominally minimized) subjected to the constraint equations ?i. In [18], [19], different objective functions are proposed for coarse to fine-scale transition problems. For instance, in order to prevent the generalized speeds of the new fine-scale model from deviating greatly from those of the coarse scale model, we may minimize the L2 norm of the difference between the generalized speeds of the coarse and fine scale models as follows

J = ( u f - u c ) T ( u f - u c ) uid15

As indicated previously, (n-m) constraint equations governing the optimization problem are obtained from the conservation of the generalized momentum of the system within the transition. The rest of the constraint equations are obtained from other information about the system, such as the specific value of kinetic energy or the temperature of the system.

The generalized momenta balance equations from Eq.�(?) are expressed as

A u f = b uid16

where A and b are (n-m)n and n known matrices, respectively, and uf is an n1 column matrix of the generalized speeds of the fine-scale system model. As a part of the optimization problem, one must solve this linear system for n-m dependent generalized speeds in terms of m independent generalized speeds. Therefore, the optimization is performed on a much smaller number (m) variables, with a cost of O(m3). For a complex molecular system, n could be very large, and n>>m, hence a significant reduction is achieved in the overall cost of optimization as compared to other traditional techniques, such as Lagrange multipliers [20]. However, the computations required to find the relations between dependent and independent generalized speeds can impose a significant burden on these simulations. It is shown in [21] that if traditional methods such as Gaussian elimination or LU factorization are used to find these relations, this cost tends to be O(n(n-m)2). The DCA scheme provided here finds these relations at the end of the hierarchic disassembly process with computational complexity of almost O(n) in serial implementation. In other words, in this strategy, DCA formulates the impulse-momentum equations of the system which is followed by providing the relations between dependent and independent generalized speeds of the system in a timely manner. As such, this significantly reduces the costs associated with forming and solving the optimization problem in the transitions to the finer models.

Advertisement

4. DCA-based momenta balance for multi-flexible bodies

In this section, two-handle impulse-momentum equations of flexible bodies are derived. Mathematical modeling of the transition from a coarse model to a fine-scale model is discussed. For the fine-scale to coarse-scale model transition in multi-flexible-body system the reader is referred to [22], [23]. We will now derive the two-handle impulse-momentum equations when flexible degrees of freedom of a flexible body or the joints in the system are released. Then, the assembly of two consecutive bodies for which the connecting joint is unlocked is discussed. Finally, the hierarchic assembly-disassembly process for the multi-flexible-body system is presented.

4.1. Two-handle impulse-momentum equations in coarse to fine transitions

Now, we develop the two-handle impulse-momentum equations for consecutive flexible bodies in the transition from a coarse model to a fine-scale model. It is desired to develop the handle equations which express the spatial velocity vectors of the handles after the transition to the finer model as explicit functions of only newly introduced modal generalized speeds of the fine model. For this purpose, we start from the impulse-momentum equation of the flexible body as

? f ?? 1 f - ? c ?? 1 c = ? R ? F 1 c ? t c t f F 1 c d t + ? R ? F 2 c ? t c t f F 2 c d t uid18

where ?f and ?c are the inertia matrices associated with the fine-scale and coarse models, respectively. Also, tc and tf represent the time right before and right after the transition. The quantities ?tctfF1cdt and ?tctfF2cdt are the spatial impulsive constraint forces on handle-1 and handle-2 of the flexible body. The matrices ?R?F1c and ?R?F2c are the coefficients resulting from the generalized constraint force contribution at handle-1 and handle-2, respectively. Moreover, in Eq.�(?), the impulses due to the applied loads are not considered since they represent a bounded loads integrated over an infinitesimal time interval. For detailed derivation of these quantities the reader is referred to [13]. It is desired to develop the handle equations which provide the spatial velocity vectors of the handles right after the transition to the fine-scale model in terms of newly added modal generalized speeds. Therefore, in Eq.�(?), the inertia matrix of the flexible body is represented by its components corresponding to rigid and flexible modes, as well as the coupling terms

? R R ? R F ? F R ? F F f v 1 q f = ? R ? F 1 c ? t c t f F 1 c d t + ? R ? F 2 c ? t c t f F 2 c d t + ? R R ? R F ? F R ? F F c v 1 q c uid19

which is decomposed to the following relations

? F F f q f = ? F 1 c ? t c t f F 1 c d t + ? F 2 c ? t c t f F 2 c d t + ? F R c v 1 c + ? F F c q c - ? F R f v 1 f ? R R f v 1 f = ? R 1 c ? t c t f F 1 c d t + ? R 2 c ? t c t f F 2 c d t + ? R R c v 1 c + ? R F c q c - ? R F f q f uid20

Since the generalized momentum equations are calculated based on the projection onto the space of the coarser model, the matrix ?f is not a square matrix and thus ?FFf is not invertible. However, we can partition Eq.�(?) in terms of dependent (those associated with the coarser model) and independent (newly introduced) generalized speeds as

? F F f d ? ? F F f i q f d ? q f i = ? F 1 c ? t c t f F 1 c d t + ? F 2 c ? t c t f F 2 c d t + ? F R c v 1 c + ? F F c q c - ? F R f v 1 f uid21

Using the above relation, the expression for the dependent generalized modal speeds is written as

q f d = ( ? F F f d ) - 1 [ ? F 1 c ? t c t f F 1 c d t + ? F 2 c ? t c t f F 2 c d t + ? F R c v 1 c + ? F F c q c - ? F R f v 1 f - ? F F f i q f i ] uid22

Defining

? R F f = ? R F f d ? ? R F f i ? = [ ? R R f - ? R F f d ( ? F F f d ) - 1 ? F R f ] - 1 ? 1 = [ ? R 1 c - ? R F f d ( ? F F f d ) - 1 ? F 1 c ] ? 2 = [ ? R 2 c - ? R F f d ( ? F F f d ) - 1 ? F 2 c ] ? 3 = [ ? R R c - ? R F f d ( ? F F f d ) - 1 ? F R c ] v 1 c + [ ? R F c - ? R F f d ( ? F F f d ) - 1 ? F F c ] q c ? 4 = [ ? R F f d ( ? F F f d ) - 1 ? F F f i - ? R F f i ] ? 1 i = ? ? i , ( i = 1 , 2 , 3 , 4 ) uid23

and using Eqs.�(?) and (?), the spatial velocity vector of handle-1 can be written in terms of the independent modal speeds

v 1 f = ? 11 ? t c t f F 1 c d t + ? 12 ? t c t f F 2 c d t + ? 13 + ? 14 q f i uid24

As such, the spatial velocity vector of handle-2 becomes

v 2 f = ( S k 1 k 2 ) T v 1 f + ? 2 f q f uid25

Employing the same partitioning technique, Eqs.�(?) can be written as

v 2 f = ( S k 1 k 2 ) T v 1 f + ? 2 f d ? ? 2 f i q f d ? q f i ? v 2 f = ( S k 1 k 2 ) T v 1 f + ? 2 f d q f d + ? 2 f i q f i uid26

Using

? 21 = [ ( S k 1 k 2 ) T ? 11 + ? 2 f d ( ? F F f d ) - 1 ? F 1 c - ? 2 f d ( ? F F f d ) - 1 ? F R f ? 11 ] ? 22 = [ ( S k 1 k 2 ) T ? 12 + ? 2 f d ( ? F F f d ) - 1 ? F 2 c - ? 2 f d ( ? F F f d ) - 1 ? F R f ? 12 ] ? 23 = [ S k 1 k 2 ) T ? 13 + ? 2 f d ( ? F F f d ) - 1 ? F R c v 1 c + ? 2 f d ( ? F F f d ) - 1 ? F F c q c - ? 2 f d ( ? F F f d ) - 1 ? F R f ? 13 ] ? 24 = [ S k 1 k 2 ) T ? 14 + ? 2 f i - ? 2 f d ( ? F F f d ) - 1 ? F F f i - ? 2 f d ( ? F F f d ) - 1 ? F R f ? 14 ] uid27

and Eq.�(?), the spatial velocity vector of handle-2 can be written as

v 2 f = ? 21 ? t c t f F 1 c d t + ? 22 ? t c t f F 2 c d t + ? 23 + ? 24 q f i uid28

Equations (?) and (?) are now in two-handle impulse-momentum form and along with Eq.�(?), give the new velocities associated with each handle after the transition. These equations express the spatial velocity vectors of the handles of the body as well as the modal generalized speeds which have not changed within the transition in terms of the newly added modal generalized speeds. This important property will be used in the optimization problem to provide the states of the system after the transition to the finer models.

As such, the two-handle equations describing the impulse-momentum of two consecutive bodies, body k and body k+1 are expressed as

v 1 ( k ) f = ? 11 ( k ) ? t c t f F 1 c ( k ) d t + ? 12 ( k ) ? t c t f F 2 c ( k ) d t + ? 13 ( k ) + ? 14 ( k ) q ( k ) f i v 2 ( k ) f = ? 21 ( k ) ? t c t f F 1 c ( k ) d t + ? 22 ( k ) ? t c t f F 2 c ( k ) d t + ? 23 ( k ) + ? 24 ( k ) q ( k ) f i v 1 ( k + 1 ) f = ? 11 ( k + 1 ) ? t c t f F 1 c ( k + 1 ) d t + ? 12 ( k + 1 ) ? t c t f F 2 c ( k + 1 ) d t + ? 13 ( k + 1 ) + ? 14 ( k + 1 ) q ( k + 1 ) f i v 2 ( k + 1 ) f = ? 21 ( k + 1 ) ? t c t f F 1 c ( k + 1 ) d t + ? 22 ( k + 1 ) ? t c t f F 2 c ( k + 1 ) d t + ? 23 ( k + 1 ) + ? 24 ( k + 1 ) q ( k + 1 ) f i uid29

4.2. Assembly process and releasing the joint between two consecutive bodies

In this section, a method to combine the two-handle equations of individual flexible bodies to form the equations of the resulting assembly is presented. Herein, the assembly process of the consecutive bodies is discussed only within the transition from a coarse model to a finer model. This transition is achieved by releasing the joint between two consecutive bodies. Clearly, this would mean a change in the joint free-motion map PRJk and its orthogonal complement DRJk. It will become evident that the assembly process of the consecutive bodies for the fine to coarse transition is similar, and the associated equations can be easily derived by following the given procedure.

From the definition of joint free-motion map, the relative spatial velocity vector at the joint between two consecutive bodies is expressed by the following kinematic constraint

v 1 ( k + 1 ) f - v 2 ( k ) f = P R J k f u ( k / k + 1 ) f uid31

In the above equation, u(k/k+1)f is the relative generalized speed defined at the joint of the fine model. From Newton's third law of motion, the impulses at the intermediate joint are related by

? t c t f F 2 c ( k ) d t = - ? t c t f F 1 c ( k + 1 ) d t uid32

Substituting Eqs.�(?), (?) and (?) into Eq.�(?) results in

( ? 11 ( k + 1 ) + ? 22 ( k ) ) ? t c t f F 1 c ( k + 1 ) d t = ? 21 ( k ) ? t c t f F 1 c ( k ) d t - ? 12 ( k + 1 ) ? t c t f F 2 c ( k + 1 ) d t + ? 23 ( k ) - ? 13 ( k + 1 ) + ? 24 ( k ) q ( k ) f i - ? 14 ( k + 1 ) q ( k + 1 ) f i + P R J k f u ( k / k + 1 ) f uid33

Using the definition of the joint free-motion map, the spatial constraint impulses lie exactly in the space spanned by the orthogonal complement of joint free-motion map of the coarser model. These constraint impulses can be expressed as

? t c t f F 1 c ( k + 1 ) d t = D R J k c ? t c t f ?? 1 c ( k + 1 ) d t uid34

In the above equation, ?tctf??1c(k+1)dt is an ordered measure number of the impulsive constraint torques and forces. Pre-multiplying Eq.�(?) by (DRJkc)T, one arrives at the expression for ?tctfF1c(k+1)dt as

? t c t f F 1 c ( k + 1 ) d t = X ? 21 ( k ) ? t c t f F 1 c ( k ) d t - X ? 12 ( k + 1 ) ? t c t f F 2 c ( k + 1 ) d t + X Y + X ? 24 ( k ) q ( k ) f i - X ? 14 ( k + 1 ) q ( k + 1 ) f i + X P R J k f u ( k / k + 1 ) f uid35

where

X = D R J k c [ ( D R J k c ) T ( ? 11 ( k + 1 ) + ? 22 ( k ) ) D R J k c ] - 1 ( D R J k c ) T Y = ? 23 ( k ) - ? 13 ( k + 1 ) uid36

Using Eqs.�(?), (?), and (?), we write the two-handle equations for the assembly k:k+1

v 1 ( k : k + 1 ) f = ? 11 ( k : k + 1 ) ? t c t f F 1 c ( k ) d t + ? 12 ( k : k + 1 ) ? t c t f F 2 c ( k + 1 ) d t + ? 13 ( k : k + 1 ) + ? 14 ( k : k + 1 ) q ( k ) f i + ? 15 ( k : k + 1 ) q ( k + 1 ) f i + ? 16 ( k : k + 1 ) u ( k / k + 1 ) f v 2 ( k : k + 1 ) f = ? 21 ( k : k + 1 ) ? t c t f F 1 c ( k ) d t + ? 22 ( k : k + 1 ) ? t c t f F 2 c ( k + 1 ) d t + ? 23 ( k : k + 1 ) + ? 24 ( k : k + 1 ) q ( k ) f i + ? 25 ( k : k + 1 ) q ( k + 1 ) f i + ? 26 ( k : k + 1 ) u ( k / k + 1 ) f uid37

where:

? 11 ( k : k + 1 ) = ? 11 ( k ) - ? 12 ( k ) X ? 21 ( k ) ? 12 ( k : k + 1 ) = ? 12 ( k ) X ? 12 ( k + 1 ) ? 13 ( k : k + 1 ) = ? 13 ( k ) - ? 12 ( k ) X Y ? 14 ( k : k + 1 ) = ? 14 ( k ) - ? 12 ( k ) X ? 24 ( k ) ? 15 ( k : k + 1 ) = ? 12 ( k ) X ? 14 ( k + 1 ) ? 16 ( k : k + 1 ) = - ? 12 ( k ) X P R J k f ? 21 ( k : k + 1 ) = ? 21 ( k + 1 ) X ? 21 ( k ) ? 22 ( k : k + 1 ) = ? 22 ( k + 1 ) - ? 21 ( k + 1 ) X ? 12 ( k + 1 ) ? 23 ( k : k + 1 ) = ? 21 ( k + 1 ) X Y + ? 23 ( k + 1 ) ? 24 ( k : k + 1 ) = ? 21 ( k + 1 ) X ? 24 ( k ) ? 25 ( k : k + 1 ) = ? 24 ( k + 1 ) - ? 21 ( k + 1 ) X ? 14 ( k + 1 ) ? 26 ( k : k + 1 ) = ? 21 ( k + 1 ) X P R J k f uid38

The two-handle equations of the resultant assembly express the spatial velocity vectors of the terminal handles of the assembly in terms of the spatial constraint impulses on the same handles, as well as the newly added modal generalized speeds of each constituent flexible body, and the newly introduced dof at the connecting joint. These are the equations which address the dynamics of the assembly when both types of transitions occur simultaneously. In other words, they are applicable when new flexible modes are added to the flexible constituent subassemblies and new degrees of freedom are released at the connecting joint. If there is no change in the joint free-motion map, the spatial partial velocity vector associated with u(k/k+1)f does not appear in the handle equations of the resulting assembly.

Advertisement

5. Hierarchic assembly-disassembly

The DCA is implemented in two main passes: assembly and disassembly [13], [16]. As mentioned previously, two consecutive bodies can be combined together to recursively form the handle equations of the resulting assembly. As such, the assembly process starts at the individual sub-domain level of the binary tree to combine the adjacent bodies and form the equations of motion of the resulting assembly. This process is recursively implemented as that of the binary tree to find the impulse-momentum equations of the new assemblies. In this process, the spatial velocity vector (after transition) and impulsive load of the handles at the common joint of the consecutive bodies are eliminated. The handle equations of the resulting assembly are expressed in terms of the constraint impulses and spatial velocities of the terminal handles, as well as the newly introduce modal generalized speeds and generalized speeds associated with the newly added degrees of freedom at the connecting joints. This process stops at the top level of the binary tree in which the impulse-momentum equations of the entire system are expressed by the following two-handle equations

v 1 1 f = ? 11 ( 1 : n ) ? t c t f F 1 c 1 d t + ? 12 ( 1 : n ) ? t c t f F 2 c n d t + ? 13 ( 1 : n ) + ? 14 ( 1 : n ) q ( 1 : n ) f i + ? 15 ( 1 : n ) u ( 1 : n ) f v 2 n f = ? 21 ( 1 : n ) ? t c t f F 1 c 1 d t + ? 22 ( 1 : n ) ? t c t f F 2 c n d t + ? 23 ( 1 : n ) + ? 24 ( 1 : n ) q ( 1 : n ) f i + ? 25 ( 1 : n ) u ( 1 : n ) f uid39

Note that through the partial velocity vectors ?ij(1:n),(i=1,2andj=4,5), these equations are linear in terms of the newly added generalized modal speeds as well as the generalized speeds associated with the released dof at the joints of the system.

The two-handle equations for the assembly at the primary node is solvable by imposing appropriate boundary conditions. Solving for the unknowns of the terminal handles initiates the disassembly process [17], [18]. In this process, the known quantities of the terminal handles of each assembly are used to solve for the spatial velocities and the impulsive loads at the common joint of the constituent subassemblies using the handle equations of each individual subassembly. This process is repeated in a hierarchic disassembly of the binary tree where the known boundary conditions are used to solve the impulse-momentum equations of the subassemblies, until the spatial velocities of the fine model and impulses on all bodies in the system are determined as a known linear function of the newly introduced generalized speeds of the fine model.

Advertisement

6. Conclusion

The method presented in this chapter is able to efficiently simulate discontinuous changes in the model definitions for articulated multi-flexible-body systems. The impulse-momentum equations govern the dynamics of the transitions when the number of deformable modes changes and the joints in the system are locked or released. The method is implemented in a divide-and-conquer scheme which provides linear and logarithmic complexity when implemented in serial and parallel, respectively. Moreover, the transition from a coarse-scale to a fine-scale model is treated as an optimization problem to arrive at a finite number of solutions or even a unique one. The divide-and-conquer algorithm is able to efficiently produce equations to express the generalized speeds of the system after the transition to the finer models in terms of the newly added generalized speeds. This allows the reduction in computational expenses associated with forming and solving the optimization problem.

Advertisement

Acknowledgment

Support for this work received under National Science Foundation through award No. 0757936 is gratefully acknowledged.

References

  1. 1. Anderson, K.�S. & Poursina, M. (2009a). Energy concern in biomolecular simulations with transition from a coarse to a fine model, Proceedings of the Seventh International Conference on Multibody Systems, Nonlinear Dynamics and Control, ASME Design Engineering Technical Conference, number IDETC2009 in MSND-87297, San Diego, CA.
  2. 2. Anderson, K.�S. & Poursina, M. (2009b). Optimization problem in biomolecular simulations with DCA-based modeling of transition from a coarse to a fine fidelity, Proceedings of the Seventh International Conference on Multibody Systems, Nonlinear Dynamics and Control, ASME Design Engineering Technical Conference 2009, (IDETC09), number IDETC2009/MSND-87319, San Diego, CA.
  3. 3. Demel, J.�W. (1997). Applied Numerical Linear Algebra, SIAM, Philadelphia, PA.
  4. 4. Dill, K.�A., Ozkan, S.�B., Shell, M.�S. & Weikl, T.�R. (2008). The protein folding problem, Annual Review of Biophysics 37(1):�289�316.
  5. 5. Featherstone, R. (1999). A divide-and-conquer articulated body algorithm for parallel O(log(n)) calculation of rigid body dynamics. Part 1: Basic algorithm, International Journal of Robotics Research 18(9):�867�875.
  6. 6. Kane, T.�R. & Levinson, D.�A. (1985). Dynamics: Theory and Application, Mcgraw-Hill, NY.
  7. 7. Khan, I., Poursina, M. & Anderson, K.�S. (2011). DCA-based optimization in transitioning to finer models in articulated multi-flexible-body modeling of biopolymers, Proceedings of the ECCOMAS Thematic Conference - Multibody Systems Dynamics, Brussels, Belgium.
  8. 8. Mukherjee, R. & Anderson, K.�S. (2007a). A logarithmic complexity divide-and-conquer algorithm for multi-flexible articulated body systems, Computational and Nonlinear Dynamics 2(1):�10�21.
  9. 9. Mukherjee, R. & Anderson, K.�S. (2007b). An orthogonal complement based divide-and-conquer algorithm for constrained multibody systems, Nonlinear Dynamics 48(1-2):�199�215.
  10. 10. Mukherjee, R., Crozierb, P.�S., Plimptonb, S.�J. & Anderson, K.�S. (2008). Substructured molecular dynamics using multibody dynamics algorithms, International Journal of Non-Linear Mechanics 43:�1040�1055.
  11. 11. Mukherjee, R.�M. & Anderson, K.�S. (2007c). Efficient methodology for multibody simulations with discontinuous changes in system definition, Multibody System Dynamics 18:�145�168.
  12. 12. Mukherjee, R.�M. & Anderson, K.�S. (2008). A generalized momentum method for multi-flexible body systems for model resolution change, Proceedings of the 12th conference on nonlinear vibrations, dynamics, and multibody systems, Blacksburg, VA.
  13. 13. Norberg, J. & Nilsson, L. (2003). Advances in biomolecular simulations: methodology and recent applications, Quarterly Reviews of Biophysics 36(3):�257�306.
  14. 14. Poursina, M. (2011). Robust Framework for the Adaptive Multiscale Modeling of Biopolymers, PhD thesis, Rensselaer Polytechnic Institute, Troy.
  15. 15. Poursina, M., Bhalerao, K.�D. & Anderson, K.�S. (2009). Energy concern in biomolecular simulations with discontinuous changes in system definition, Proceedings of the ECCOMAS Thematic Conference - Multibody Systems Dynamics, Warsaw, Poland.
  16. 16. Poursina, M., Bhalerao, K.�D., Flores, S., Anderson, K.�S. & Laederach, A. (2011). Strategies for articulated multibody-based adaptive coarse grain simulation of RNA, Methods in Enzymology 487:�73�98.
  17. 17. Poursina, M., Khan, I. & Anderson, K.�S. (2011). Model transitions and optimization problem in multi-flexible-body modeling of biopolymers, Proceedings of the Eighths International Conference on Multibody Systems, Nonlinear Dynam. and Control, ASME Design Engineering Technical Conference 2011, (IDETC11), number DETC2011-48383, Washington, DC.
  18. 18. Praprotnik, M., Site, L. & Kremer, K. (2005). Adaptive resolution molecular-dynamics simulation: Changing the degrees of freedom on the fly, J. Chem. Phys. 123(22):�224106�224114.
  19. 19. Scheraga, H.�A., Khalili, M. & Liwo, A. (2007). Protein-folding dynamics: Overview of molecular simulation techniques, Annu. Rev. Phys. Chem. 58(1):�57�83.
  20. 20. Shahbazi, Z., Ilies, H. & Kazerounian, K. (2010). Hydrogen bonds and kinematic mobility of protein molecules, Journal of Mechanisms and Robotics 2(2):�021009�9.
  21. 21. Turner, J.�D., Weiner, P., Robson, B., Venugopal, R., III, H.�S. & Singh, R. (1995). Reduced variable molecular dynamics, Journal of Computational chemistry 16:�1271�1290.
  22. 22. Voltz, K., Trylska, J., Tozzini, V., Kurkal-Siebert, V., Langowski, J. & Smith, J. (2008). Coarse-grained force field for the nucleosome from self-consistent multiscaling, Journal of Computational chemistry 29(9):�1429�1439.
  23. 23. Wu, X.�W. & Sung, S.�S. (1998). Constraint dynamics algorithm for simulation of semiflexible macromolecules, Journal of Computational chemistry 19(14):�1555�1566.

Written By

Mohammad Poursina, Imad M. Khan and Kurt S. Anderson

Submitted: 11 November 2011 Published: 11 July 2012