EFFICIENT METHODS FOR MULTIBODY SIMULATIONS CROSS-REFERENCES TO RELATED APPLICATIONS This application is entitled to the benefit of the priority filing date of Provisional Patent Application No. 60/477,237, by Dan Rosenthal, filed 9 June 2003; and Provisional Patent Application No. 60/552, 222, by Dan Rosenthal, filed 10 March 2004; both of which are hereby incorporated by reference in their entirety.

BACKGROUND OF THE INVENTION The present invention is related to the field of numerical methods and, more particularly, to numerical methods used in connection with solving equations of motion for mechanical systems, e. g. , multibody mechanical system, particularly mechanical systems used in molecular modeling applications. All of the references cited herein are incorporated by reference for all purposes.

Molecular modeling includes a number of techniques which can be used to simulate various aspects of molecules, including their conformations, dynamic behavior and the like.

Typical molecular modeling applications have included enzyme-ligand docking, molecular diffusion, reaction pathways, phase transitions, and protein folding studies. Researchers in the biological sciences and the pharmaceutical, polymer, and chemical industries are starting to use such techniques to understand the nature of chemical processes in complex molecules and to design new drugs and materials accordingly. Naturally, the acceptance of these tools is based on several factors, including the accuracy of the results in representing reality, the size and complexity of the molecular systems that can be modeled, and the speed by which the solutions are obtained.

Molecular or other mechanical system simulations are generally conducted using numerical methods to solve sets of differential equations. The speed of such simulations is therefore limited in part by the speed of the numerical methods employed, and the speed of the calculations and algorithms solved using the numerical methods. The computational speed of a mechanical (e. g. , molecular) simulation may be characterized in terms of the order of dependence on the number of degrees of freedom ("DOF") in the system, where the number of DOF is generally proportional to the number of bodies (e. g. , atoms) in the system.

For example, the computation time of an"order (N)"algorithm scales linearly with the number of DOF in the system, whereas that of an"order (N squared) " (order (N2)) algorithm

has a quadratic dependence (i. e. , it increases proportionally to the square of the number of DOF), an"order (N3)"algorithm has a cubic dependence, and so-on. As the size of the system (and therefore the number of DOF) grows, algorithms with higher order (N) dependencies can rapidly become prohibitive in terms of computational cost. Accordingly, it is highly desirable to develop algorithms that have the lowest possible order (N) dependence.

Molecular simulations have generally been carried out using either Cartesian coordinates (x, y, z coordinates for each atom or body in the system, each expressed relative to an absolute reference frame) or internal coordinates (typically dihedral or torsion angle coordinates). An advantage of using internal coordinates is that the number of DOF in the system is substantially reduced (e. g. , to between about 1/6 and 1/8 of that for Cartesian coordinates), at the cost of increased complexity in at least some of the algorithms used (see, e. g., Rosenthal, W002/061662, August 8,2002,"Method for Analytical Jacobian Computation in Molecular Modeling" ; or Rosenthal, US 2003/0018455 Al, January 23, 2003, "Method for Analytical Jacobian Computation in Molecular Modeling") Two exemplary types of molecular modeling techniques are molecular dynamics ("MD") approaches, which simulate the motion of a molecular system through time, and Monte Carlo methods, which generate different states of a molecule or molecular system by making random changes to the atoms or bodies which make up the system, and evaluate the energy of each successive state (see, e. g. , Leach, A. R., Molecular Modeling-Principles and Applicatiohs 2'Zd Ed., 2001, Dorset Press, Dorchester, Dorset).

These, as well as other molecular and mechanical modeling techniques, are often formulated so as to make use of the first (gradient, or Jacobian) and/or second (Hessian) derivative matrixes of the conformational energy functions (potential and/or kinetic energy).

These derivatives can be readily computed in Cartesian coordinates, but are very difficult to calculate from first principles in internal coordinates. Accordingly, if one wishes to find the Jacobian or Hessian of the energy (E) or force (F) functions in internal coordinates, one generally needs to convert the Cartesian Jacobian or Hessian into the corresponding internal coordinate (e. g. , torsion angle coordinate) Jacobian or Hessian.

Although the computational cost of a Cartesian Jacobian is as low as order (N2), generally-applicable prior art methods for converting a Cartesian Jacobian to an internal coordinate Jacobian have a cubic dependence on N (i. e. , order (N3)). The conversion calculation can thus become a bottleneck when working with large systems. Several methods for speeding up Jacobian computation in the context of molecular modeling (to as low as order N2) have been described (e. g. , Gibrat, 1997, "Fast Calculation of first and second

derivatives of conformational energy of oligomeric proteins with respect to a set of variables mixing dihedral angles andrigidbodyvariables", J. C} em Phys 94: 1234-1256; Noguti & Go, 1983, J Phys. Soc. Jap. 52: 3685), but they suffer from certain limitations as detailed below.

Many techniques for calculating the force or energy Jacobian employ the chain rule; for example, the force Jacobian can be expressed in internal coordinates as #f/#q=#F/#r#r/#q, where Cartesian coordinates are represented as r and internal coordinates are represented as q. #F/#r is typically the Cartesian Hessian whenever F itself is obtained as the gradient of a potential energy; otherwise #F/#r is referred to as the Cartesian Force Jacobian. #r/#q is referred to as the torsion displacement gradient. In the "explicit matrix multiplication method" (see, e. g. , Rosenthal, W002/061662, August 8,2002,"Method for Analytical Jacobian Computation in Molecular Modeling" ; or Rosenthal, US 2003/0018455 Al, January 23, 2003, "Method for Analytical Jacobian Computation in Molecular Modeling", both incorporated herein by reference for all purposes), both the Cartesian Jacobian and the displacement gradient are formed and an explicit matrix multiplication is performed.

Because of the inordinate memory requirement to store the Cartesian Jacobian for large molecular systems, some special provision is generally made to partially form the Jacobian in blocks. The cost of the matrix multiplication is cubic (order (N3)) in the number of atoms.

Depending on the force field used, the cost of forming the Cartesian Jacobian can be quadratic (order (N2)). The cost of forming the displacement gradient is also quadratic, so this method is eventually dominated by the cubic cost of the matrix multiply.

Methods based on numerical perturbation (see, e. g. , Lyness & Moler, 1967, "Numerical differentiation of analytic functions", SIAM J Numer. Anal. 4: 202-210) have also been described. If the simulation engine employed is able to compute atomic forces, the atomic forces can be viewed as implicit functions of the generalized coordinates: F = f(r(q)). Therefore, #F/#q can be formed numrically, using, for instance, finite differences. The overall cost of this scheme is cubic, since each columm of the Jacobian requires at least one force evaluation. The accuracy of the numerical scheme may also suffer due to round off and truncation artifacts. Complexification techniques (see, e. g. , Martins, et al. , 2000, "An automated method for sensitivity analysis using complex variables", AIAA 2000-0689) can be used to restore accuracy of the obtained results, but this requires rewriting

the entire force field to use complex arithmetic, an impractical requirement for many applications.

Also described in the prior art are methods based on forward mode differentiation (see, e. g. , Bischof, et al. , 1992, "ADIFOR : Generating Derivative Codes from Fortran Programs", Scientific Programming 1 : 11-29), which arise from application of program augmentation techniques. The application of these methods can be done either with a code generation program such as Adifor (Argonne National Laboratory and Rice University), or manually. Application of such a method results in a program that can compute the matrix vector product #F/#r z, for a passed-in data vector z. A good use of such a program is to form the displacement gradient and pass it into the forward mode derivative routine. This still results in cubic overall cost, but is about three times faster than a numerical finite difference method, and obtains full accuracy.

In the method of Gibrat (Gibrat, 1997, "Fast Calculation of first and second derivatives of conformational energy of oligomeric proteins with respect to a set of variables mixing dihedral angles and rigid body variables", J. Chem Phys 94 : 1234-1256), adapted from Noguti & Go, 1983, (J. Phys. Soc. Jap. 52: 3685), the Jacobian or Torsion Hessian is generated in quadratic cost, but is restricted to energy functions expressible as pair potentials.

Thus, it is not applicable to simple energy functions such as the 1-4 torsion potential (because the torsion potential is expressed as an additive sum of 4-atom terms), the 1-3 bond angle pair, and other energy functions which are not expressible exclusively as pair potentials. It is also not applicable to a number of other tools used in molecular modeling not expressible exclusively as pair potentials, such as the Generalized Born Solvent Accessibility ("GBSA") solvent model, which is expressed as a true many-body potential, and is often used in molecular simulations utilizing an implicit solvent model.

The present invention overcomes the aforementioned and other limitations in the prior art, and provides a fast and generally-applicable method to calculate an internal coordinate (e. g. , torsion angle) Jacobian at quadratic (order (N2)) cost, which can, among other applications, be used to dramatically speed up molecular modeling methods.

SUMMARY OF THE INVENTION In one embodiment, the present invention provides methods and algorithms useful for converting a Cartesian Hessian into a Torsion Jacobian without limitation to pair-potential

energy terms, and for performing such calculation with highly-efficient usage of computer memory. Such methods and algorithms can do the conversion in computation time quadratic in the number of internal coordinates used to model any multibody system, e. g. , a molecular system. In a related embodiment, the present invention provides methods and algorithms useful for computing the stiffness matrix without limitation to pair-potential energy terms, and for performing such calculation with highly-efficient usage of computer memory.

BRIEF DESCRIPTION OF THE DRAWINGS Fig. 1 illustrates the tree structure of a multibody system.

Fig. 2 is the matrix co for the multibody system shown in Fig. 1.

Fig. 3A shows symbolically the interaction between two frozen bodies.

Figs. 3B-3F illustrate steps in the calculation of interactions between the two frozen bodies of Fig. 3A.

Fig. 4 is diagram of a computer system useful for executing methods of the present invention.

DETAILED DESCRIPTION I. DEFINITIONS Unless indicated otherwise, "about"means the stated value i 30%.

Unless indicated otherwise, a"body", in the context of a component of a representation of a molecule, is defined as a unit of the representation which is treated as a single mass or geometric structure for purposes of modeling the molecule. Accordingly, a body can be a representation of an individual atom of the molecule, a collection of atoms, or other abstract system of masses. A"rigid body"is a body that is modeled as rigid (i. e. , it does not deform in response to forces exerted on it).

Unless indicated otherwise, a"fast operator implementation"means a method of evaluating matrix multiplication in which elements of the product matrix are computed, used and released"on-the-fly", without the necessity of computing and storing the entire product matrix. A fast order implementation can thus be substantially more efficient (as high as order (N2)) than standard matrix multiplication (order (N3)), both in terms of execution speed and memory storage requirements.

Unless indicated otherwise, a"joint"is a connection between two bodies. Common joint types include pin joints, slider joints, and ball joints, but many other joint types are

possible, including, but not limited to, free joints, U-joints, cylindrical joints, bearing joints, and combinations of any of the foregoing. For instance, a free joint consists of three orthogonal slider joints combined with a ball joint, and has the full 6 degrees of freedom. A more detailed discussions of joint types and their uses can be found, e. g. , in Rosenthal, supra.

Unless indicated otherwise, a"frozen body"at a particular joint or pivot consists of all bodies outboard of the pivot, where the bodies move together as a rigid body.

Unless indicated otherwise, a"computationally-feasible order"refers to any order in which a particular sequence of tasks can be executed without altering the ultimate result.

This concept is invoked, because in some methods, the order of certain steps is not important, so long as the steps are executed and the result is substantially the same as if they were executed in the order originally presented.

Unless indicated otherwise, the term"in silico"refers to any method or process performed using a computer.

Unless indicated otherwise, a"molecule"is any microscopic structure formed of two or more atoms that are connected by chemical bonds. Non-limiting examples of molecules include proteins (e. g., antibodies, receptors, etc), peptides, lipids, nucleic acids (e. g. natural or synthetic DNA, RNA, gDNA, cDNA, mRNA, tRNA, etc. ), lectins, sugars (e. g. forming a lectin/sugar complex), glycoproteins, small molecules, organic compounds, monatomic or polyatomic structures such as salts, metals, etc.

Unless indicated otherwise, a"representation", when applied to a molecule or molecular structure, refers to an abstract description of the molecule or molecular structure for use by a machine, e. g. , in a computer simulation. For example, one representation of a molecule is a set of coordinates which collectively defines the positions of atoms or bodies, or some abstract proxy thereof, constituting the molecule. Non-limiting examples of representations of a molecule include X-ray coordinates, "pdb" (Protein Data Bank) files, and the like.

Unless indicated otherwise, the tenn"significant", when used with reference to "significantly different", "significantly inhibits"or"significantly stimulates", refers to a difference in a quantifiable parameter between the two groups being compared that is statistically-significant using standard statistical tests.

Unless indicated otherwise, a"solvent"refers to any medium which can contain a solute molecule. Non-limiting examples of a solvent include water & other aqueous solvents, as well as organic solvents (e. g. , DMSO, lipids, alcohol, etc. ). The solvent may be uniform or non-uniform, and may be in solid, liquid or gaseous form.

Unless indicated otherwise, a"target molecule"is the primary molecule that is the subject of a molecular simulation. A simulation may have more than one target molecule, e. g. , in simulations of 2 or more proteins interacting with one another.

Unless indicated otherwise, a"universally-applicable method"is any method suitable for use with a molecular simulation that is not limited to use with pair potentials.

II. MULTI-BODY SYSTEMS In one embodiment, methods of the present invention are used in connection with a multibody system (MBS) implementation of a mechanical system (e. g. , an MBS molecular simulation; see, e. g., Rosenthal, supra). The basic abstraction of MBS is that of a collection of joint-connected rigid bodies. One of the bodies, called the base, has special status in that its kinematics is referenced directly to ground. The system graph may contain loops. A loop- breaking algorithm reduces a cyclic graph to a tree, plus a set of cuts. The cuts can occur at joints or bodies. This places all joints in the tree system. A body that was cut by the loop breaking algorithm is recovered by imposing a weld joint. This joint is itself decomposed into a set of six distance constraints. The weld joint reassembles the two pieces of the original body.

An important property of a tree is that the path from any body to any other body is unique. The bodies in the tree are ra in number, with the base body typically assigned the label 1. This means that the body labels do not decrease on any path from the base body to any leaf body. A leaf body is one that is connected to a single body. A regular labeling can be achieved by assigning the label n to one of the leaf bodies (there must be at least one). If this body is removed from the graph, there remains a tree with n-1 bodies. Assign the label n-1 to one of its leaf bodies, and repeat the process until all the bodies have been labeled.

The details of MBS implementations of general mechanical systems have been described previously (see, e. g. , Rodriguez and Kreutz in Recursive Mass Matrix Factorization and Inversion, JPL Publication 88-11, 1988). The details of MBS implementations of a molecular system, as well as relevant notation, have also been described (see, e. g. , Rosenthal, supra).

III. COMPUTATION OF THE RESIDUAL In an exemplary embodiment, methods of the invention are applied to a simulation of a system (e. g. , a molecular system) represented as a multi-body system having equations of motion in the form Mu = p. The right hand side of this equation is p, the residual, and

contains contributions from inertial forces, and active forces from the force field. The <BR> <BR> <BR> <BR> Jacobian of the residual is-'. Methods of the invention are applicable to calculating<BR> <BR> <BR> <BR> <BR> <BR> q contributions to the residual from the force field representing the active force component. A multibody system embodies a collection of data processing methods that can trigger computation of atomic forces and gather them into elements of the residual vector. These data processing steps can have a high level representation in terms of certain matrix operations, but in fact the actual implementation of these operations is typically in terms of algorithms whose run time scales linearly with problem size. These are the so-called O (n) methods, and are taught in the prior art (see, e. g. , Rosenthal, supra). According to one aspect of the present invention, however, these O (n) methods can be applied to the Jacobian formation step: For example, the residual is formed from the operator equation p=HOPF (l) F is typically a 3na by 1 vector. Each entry preferably consists of the global Cartesian components of the total atomic force exerted on a given atom. Matrix operators H, C, and P are described by Rodriguez and Kreutz in Recursive Mass Matrix Factorization and Inversion, JPL Publication 88-11, 1988. The force distribution matrix P generates multibody spatial loads acting at the pivots of the multibody system from atomic forces. Thus, one can write: T=PF (2) where T is typically a 6nb by 1 vector. A given force acting upon a particular atom is mapped to a force and torque acting on the pivot point of the body upon which the atom resides.

Thus, a given row of the matrix P corresponds to the spatial load acting on a particular body.

The given row has nonzero blocks only for entries corresponding to atoms residing on the particular body. In many multibody formulations of molecular systems, each body typically contains or represents about three atoms. Accordingly, the matrix P is large and sparse, and it does not need to be explicitly formed (see, e. g. , Rosenthal, supra). Rather, an algorithm that computes the matrix vector product PF may be used. The runtime of such a computation is linear in the number of atoms (Rosenthal, supra).

It is common in multibody dynamics that the transpose of an operator is also a useful quantity. In this case the operator pT propagates spatial velocity (linear and angular) from

each body pivot to the atom stations located on the body. An exemplary use of this matrix is for the purpose of computing differential spatial displacements of the atoms in a molecular system.

The matrix 0 is known as the multibody transition operator. This matrix, acting upon a data vector, has the effect of shifting and accumulating the elements of the data vector from the leaf bodies of the tree down to the base body. For instance, the product Or generates R, a 6nb by 1 vector of reaction loads. For a given body, the reaction load element represents the resultant force and torque about the body inboard pivot of those forces acting on bodies kinematically affected by motion of the body in question about its joint. The evaluation of OT is linear in the number of bodies.

To understand C, it is useful to first introduce the matrix ##. This (block) matrix is sparse and super-diagonal. In the ith row, it is filled in only in those columns corresponding to children of body i. For the body diagram shown in Fig. 1, the matrix co is shown in Fig. 2.

Each non-zero element of ## is a 6x6 matrix. The elements' shift spatial loads from the pivot of a child to the pivot of its parent. The transposed elements shift spatial velocity from a parent pivot to the child pivot.

Now, the relationship between # and £ can be stated: (D = (I-so)-l (3) The meaning of this equation may be better appreciated upon reference to the following illustration, which describes the computation of the spatial reaction load at each pivot, given the spatial load applied to each pivot, with reference to the system shown in Fig.

1. The reaction loads can be computed by the following O (n) sweep (code sequence):

R (12) = T (12) R (11) = T (11) R (10) = i#k(11) R(11) + T(10) R (9) = T (9) R (8) = i#k(10) R (10) + ik (9) R (9) + T(8) R (7) = ik (8) R (8) + i#k(12) R (12) +T (7) R (6) = i#k (7) R (7) +T (6) R (5) = i#k (6) R (6) + T (5) R (4) = T (4) R (3) = T (3) R (2) = iXk (3) R (3) + i#k (4) R (4) + T (3) R (1) = ik (2) R (2) + i#k (5) R (5) + T (1) R (0) = si (1) R (l) + T(0) These equations accumulate the reaction at each pivot. The sweep starts at the leaf bodies and traverses the tree to the base body. Each body shifts its reaction to its parent body, where it is added to the contribution from its brothers. Notice that the equations make backwards references to previously computed quantities. For instance, R (6) refers to R (7), which refers to R (8) and R (12), etc. However, if the algorithm is arranged as presented, no unsatisfied references are encountered. The correspondence between the operator equation R = OF and the above sequence can be illustrated as follows--the sequence shows the equation = = ##R + T, from which (I-£) R = T, or R = (I - ##)-1T = #T. To go the other direction (from equation to code sequence), the steps can simply be reversed: R =q) T = (I - ##)-1T, or (I-£) R = T, from which (4) R = ##R + T If one wishes to expose the elements of C, one can, for example, eliminate the backwards references in the computation of R by performing repeated substitutions, and then identify the matrix elements of0. Alternatively, one may employ an algorithmic alternative.

Since (I-s,) C = I, we have # = ### + I, and this equation has the same structure as R = £, fiR + T. The same algorithm can be applied to the columns of (D. starting from the last column and working backwards to the first. However, as will be evident, there is typically no circumstance in which the elements of 0 are needed, since only the action of the

operator is needed. Therefore, all algorithms which indicate multiplication by 0 (a dense upper triangular matrix) may proceed in terms off,, a sparse super-diagonal matrix.

To finish the residual computation, the matrix vector product HR projects the elements of the vector R onto the joint freedoms. The matrix H is a block diagonal. Each block is filled with the joint map for a particular joint. The map for a pin joint is a lx6 vector [R 0], where the unit vector A specifies the pin geometry. The matrix vector product HR is easily computed in linear cost, since it represents a sequence of non-recursive dot-products. The operator H has the following shape, where n is the number of bodies and nu is the number of generalized speeds:

There is a corresponding operator FI which has the following shape, where M is the number of generalized coordinates:

In view of the foregoing, it can be appreciated that the computation of the residual can be seen as a sequence of O (n) methods applied to the elements of the atomic forces computed by the force field. These include, for example, vacuum terms, solvent terms (polar and non-polar), and velocity related terms. Several of these items require quadratic compute time. For example, in many implementations, electrostatics and the GBSA solvent model generally consume the majority of the computational time for force evaluation. Thus, the residual cost is quadratic in the number of atoms. This means that the Jacobian of the residual is of quadratic cost at best, and possibly worse.

Given that # = H#PF, ##/#q can be expressed as:

The atomic force vector F appears in both the first and second terms. However, the second term only requires the numeric values of the force vector, not knowledge of its analytic form. Thus, this term represents the derivative of a term whose original cost is O (n), because no new force evaluations are needed during evaluation of this term. One can thus demonstrate that this term can only give rise to quadratic cost in the Jacobian. This can be appreciated by noting that that the residual computation can be differentiated using forward mode differentiation, treating the force vector as a known constant, thereby resulting in a program whose cost is bounded by a constant times the original program cost (per call), as described in, e. g., Bichof, et al. , 1994, ("Automatic differentiation: obtaining fast and reliable derivatives-fast"Proc. SIAM Symposium on Control Problems in Industry Argonne, Preprint MCS-P484-1194). The constant depends on the nature of the intrinsic functions appearing in the program. The multibody system contains only trigonometric, single argument functions, in addition to arithmetic operations. Thus, in general, the constant is typically on the order 1-2 times the original program cost or less, and the second term may be easily computed in at most quadratic cost for the whole Jacobian. Computation of the first term in the Jacobian (which involves #F/#q) is described below.

IV. COMPUTATION OF #F/ aq According to an aspect of the present invention, the displacement gradient may be <BR> <BR> <BR> <BR> expressed in terms of O(n) multibody operators P,#,H:<BR> <BR> <BR> <BR> <BR> <BR> <BR> #r/=PT#T#T (6)<BR> <BR> au In one embodiment, particularly applicable to multibody system implementations, these operators are used to form the displacement gradient in quadratic cost. Without the use of these operators, the cost would be cubic. This approach makes use of the fact that the displacement gradient is not needed explicitly; only the matrix product with the Cartesian Jacobian is needed. The product can be formed in terms of O (n) operators since This is the same operator discussed above in connection with computation of the residual. Thus, this method yields the internal coordinate (e. g. , torsion) Jacobian in linear

cost per column, or quadratic cost overall, provided the Cartesian Jacobian is computable in quadratic cost.

The above relations may be combined to yield H#P#F/PT#T#T = ar H#W#T#T = HO (DW) T where the matrix In cases where matrix W is formed in a multibody system, Wij, a generic element of the matrix, reflects the disposition of the bodies of the multibody system in space. The element is used to compute the derivative of spatial load acting on body i due to a spatial displacement of the pivot of body j. The computation of the elements of W is where the connection to the Cartesian Hessian is made, and we have the equation: Some features of this approach bear pointing out: (i) this equation uses Hessian elements. It is guided by the atom list of body i against the atom list of body j ; (ii) since each body typically consists of roughly three atoms, this is a simple computation; (iii) since each atom belongs to only one body, each element of the Cartesian Hessian will contribute to only one element Wv ; and unlike prior art methods (e. g. , Gibrat, J. F. (1997) "Fast calculation of the first and second derivatives of the conformational energy of oligomeric proteins with respect to a set of variables mixing dihedral angles and rigid-body variables", J Chem Plays 94,1234-1256), the method described above uses Hessian elements directly. Therefore, there is no restriction to pair potentials. The corresponding quantity Lij in the paper by Gibrat (supra) is built directly from the atoms of body i against the atoms of body j, but in general, Lu $ Wfj. The use of Hessian elements as described herein leads to a simpler recursion sequence.

In a fast operator implementation, the overall computation represents two composed down-loops. The term H42W is computed by the following recursive algorithm. First, let Y = (DW, Z = HY. This yields <BR> <BR> <BR> <BR> (I-c,) Y = W, or<BR> <BR> po)<BR> <BR> <BR> Y=EOY+W As described above, the matrix s, is subdiagonal and is populated with the elements iok (k). One may then find the'stacked'equations Yl = W, <BR> <BR> <BR> y = 1#2Y1 + W2<BR> @2 # @1 2 (11)<BR> <BR> <BR> <BR> Y3 = 2#3Y2 + W3<BR> ...

In these equations W1 represents the first (logical) row and Wn represents the last (logical) row of W. This is a 6 by 6rab block. Each row of W is computed in terms of prior rows. The computation Z = HY is trivial, since H has a block-diagonal structure.

The second recursion can now be expressed as follows: <BR> <BR> <BR> <BR> aP = H#ZT (12)<BR> <BR> <BR> <BR> aq The operator H4 can be seen to be operating on the rows of Z. This dovetails nicely with the first recursion, which generated Z in row order. The second recursion only needs to compute elements in a given column up to the diagonal, since the destination matrix is symmetric.

In view of the foregoing, it can be appreciated that the atomic force Jacobian can be contracted to form W. The overall algorithm only requires row (or column access) to the Force Jacobian, and it is not necessary to access the entire matrix at once. It will also be appreciated that the first and second recursions can be interspersed if desired. In this way an element of Y or Z can be released as soon as it has been computed. It is thus not necessary to form all of Y or Z in one step.

V. MEMORY-EFFICIENT C OMPUTATION The above-described method may be implemented in a manner that minimizes the amount of memory necessary to perform the calculations, by more fully exploiting the symmetry of W. One approach to decreasing memory requirements is to use a'slicing'

technique that produces the Cartesian Hessian in large blocks, and then processing each block. Such a method would be viable, in the sense that it would decrease memory usage, but execution time might suffer. Methods described hereunder were designed to provide a processing scheme that could substantially reduce memory requirements without sacrificing execution speed.

In one embodiment, the method is based on expressing the Torsion Jacobian as UNFIT The new matrix Q bears the same relationship to W that the reaction R bears to the applied load T. The matrix W is a spatial Hessian for the bodies of a multibody system. It is the Hessian that would be relevant for the bodies floating in space, but not connected by joints. Elements of the matrix Q couple'nests'of frozen bodies. At each pivot, the frozen body is composed of all bodies outboard of the pivot, the bodies moving together as a rigid body.

A differential spatial displacement at the pivot of each frozen body causes a differential spatial load at the pivot of all the other frozen bodies. Considering a displaced body as the'source'body, and a body experiencing the load as the'receiver', it can be appreciated that each source body interacts with each receiver body. However, the spatial moves in a source body originate from the pivot of the frozen body and propagate out through the action of OT to the other bodies in the source system. Each source body produces a differential spatial load on each body of the receiver system through the coupling matrix W.

The spatial loads are given by W (D T. The spatial loads of the receiver system are aggregated to the receiver pivot through the action of the operator 0 acting on (w4) T).

In a fast operator implementation, Q can be efficiently computed as follows: <BR> <BR> <BR> # = #W#T, or<BR> <BR> <BR> <BR> <BR> <BR> (I - ##)#(I - ##T) - W, from which (14)<BR> <BR> <BR> <BR> <BR> <BR> <BR> # = ### + ###T - #####T + W

The final equation provides a basis for computing Q. Since so is super diagonal (nonzero only above the main diagonal), the term cQ couples low numbered rows of Q to higher numbered rows, but not vice versa. That is, in a given column elements move up the column when Q is pre-multiplied by ##. Similarly, the term QsT only couples low numbered columns to higher numbered columns. Elements move left across a given row.

The third term couples both early rows and early columns to higher rows and higher columns, but coupling does not occur in the other direction. Elements move either up, left, or up and to the left. The net result is that Q can always be evaluated in reverse column order, as long as the tree system is regularly labeled.

A desirable labeling is one that minimizes the bandwidth of ##. The bandwidth of £ limits the'reach'of the matrix and determines how far'back'the backwards references can extend during the computation of Q.

By way of example, the above algorithm can be applied to a subset of the system shown in Fig. 1 by evaluating the following equations: Q (12,12) = W (12,12) Q (12, 11) = W (12, 1 1) Q (12,10) = W (12,10) +Q (12, 11)i#k*(11) Q (12,9) = W (12, 9) (15) Q (12, 8) = W(12, 8) + #(12,9)i#k* (9) + S2 (12, 10) k* (10) Q (12,7) = W (12, 7) +Q (12, 8) iok* (8) +Q (12, 12)i#k* (12) The first two equations pick up only the direct contribution of the bodies through the coupling matrix W. The (12,10) element computes the spatial load on frozen body 12 due to spatial displacement of frozen body 10. Frozen body 10 consists of actual bodies 10 and 11.

The displacement at the pivot of 10 propagates to 11 through'* (11). This displacement produces a spatial load on 12 through the coupling element Q (12,11). The (12,7) element is slightly more complicated. Frozen body 7 consists of body 7, plus frozen bodies 8 and 12.

These are frozen bodies corresponding to the children of body 7. A displacement at the pivot of body 7 propagates out to its children, couples to the already computed elements of Q, and generates a load on the pivot of body 12.

Without recursion, it would be necessary to compute over the nest of bodies comprising the frozen bodies of the children. This would become an ever growing list as the computation progressed. With recursion, it is necessary to only visit frozen bodies of children. Also, since each body actually has a small number of children (usually 2 or 3, but in some cases more) the cost per element is relatively small.

The approach described below and illustrated in Figs. 3A-3F shows a calculation of the interactions between two frozen bodies. The operations described are in fact performed "automatically", in the course of the computing the equations described above, and are shown to allow better appreciation and implementation of the methods. To facilitate keeping track of bodies under consideration and their children, a table, such as Tablel below, may be constructed.

Table 1 Body a Body b k E children (a) re children (b) Turning now to Fig 3A, the drawing shows an interaction 310 between frozen body 312 and frozen body 314. In this example, a 2b ; frozen body 312 (the"receiving body") contains body a, its children k, and one grandchild of a; and frozen body 314 (the"sourcing body") contains body b, its children r, and two grandchildren of b. Interaction 310 may be determined by decomposition via the steps shown in Figs. 3B-3D, performed in any computationally-feasible order: For example, first, direct term 316 between the two individual bodies a and b as shown in Fig. 3B is determined. Term 318 (obtained from QX), produced by frozen body a 320 interacting with the frozen children of b 322 as shown in Fig. 3C, is then added. The final interaction needed (324) is that between body b 326 against k (328), the frozen children of a, as shown in Fig. 3D. This term is preferably computed indirectly, because body b by itself is not a frozen body. In one embodiment, the interaction of body b against the frozen children of a is computed by subtraction : first, as illustrated in Fig. 3E, the interaction 330 between frozen body b 314 against the frozen children of a 328 is computed, giving rise to terms obtained from fiQ. Then, as shown in Fig. 3F, interaction 332 between frozen children of a against frozen children of b (term sçsQgç5) is subtracted. This leaves the interaction b against the frozen children of a as shown in Fig. 3D.

By way of example, the above-described operations may be applied to the analysis of a portion of the multi-body system shown in Fig. 1. First, any element in which both bodies have children will be a generic case. An example of such an element is Q (8,6) : 8 6 910 7 0 (8, 6) = W (8,6) + Q (8, 7)'O'* (7) + lok (9) Q (9, 6) + i#k(10)# (10,6) (16) iXk (9) Q (9, 7)i#k*(7)-i#k(10)# (10, 7)'Ok* (7) Diagonal elements are treated by the same method as non-diagonal elements. An example is given for Q (5,5) : 5 5 6 6 Q (5,5) = W (5,5) + Q (5, 6) iok* (6) + i#k (6) Q (6,5) (17) -i3k(6)#(6,6)i#k*(6) Of course, it should be recognized that Q (5,6) = Q (6,5) T due to symmetry of the matrix. To summarize, each element is computed using the formula Guided by the tabular construction, the matrix can be computed in reverse order.

At each step, a particular element of W is accessed. This is the only point at which access to that element of W will be needed. Therefore, W is preferably computed by a method that provides element-by-element access. It is not necessary to store any elements of W. Similar considerations apply to the Cartesian Hessian, since W is built from the Cartesian Hessian.

The situation is a bit different for the matrix Q. As soon as an element #b(i),b(j) has been computed one can generate the (i,j) element of the torsion Jacobian:

(5pi =-T<BR> <BR> <BR> <BR> <BR> <BR> <BR> qui Note that the storage used for this element of Q is preferably not automatically released until it is known that there will not be any backwards references to it later in the algorithm. This can be determined from the known bandwidth of s,, which bounds the maximum reference possible. For instance, in the multibody system of Fig. 1, body 7 is the parent for body 12. This means that storing 5 columns of 0 will be enough. Similarly, the (7, 2) element references elements (7,3), (7,4), (8,2), (12,2), (8,3), (8, 4), (12,3), and (12,4).

These elements all lie within a band five columns away from (7,2). In practice, storing a small number of columns is generally sufficient to avoid re-computation.

VII. COMPUTER SYSTEM To carry out the calculations described above, a computer system may be used with at least one processor and associated memory subsystem for holding the computer code to instruct the processor to perform the operations described above. Fig. 4 illustrates the basic architecture of such a computer system having a processor 401, a memory subsystem 402, peripherals 403 such as input/output devices (keyboard, mouse, display, etc. ), perhaps a co- processor 404 to aid in the computations, and network interface devices 405, all interconnected by a bus 400. The memory subsystem optimally includes, in increasing order of access latency, cache memory, main memory and permanent storage memory, such as hard disk drives. Given the amount of intensity of computation, it should be understood that the computer system could include multiple processors with multiple associated memory subsystems to perform the computations in parallel; or, rather than having the various computer elements connected by a bus in conventional computer architecture as illustrated by Fig. 4, the computer system might formed by multiple processors and multiple memory subsystems interconnected by a network.

The following examples illustrate but in no way are intended to limit the present invention.

EXAMPLE 1 COMPUTATIONAL SPEED COMPARISON OF PREVIOUS METHODS AND METHODS OF THE PRESENT INVENTION The dynamic residual ? is computed from the atomic forces F as follows : Pu = H # P F (20) The derivatives of pu can be obtained using previous methods by using: which employs #/#q F, the a mixed Cartesian-Torsion Derivative Matrix.

Using methods of the present invention, however, the dynamic residual derivative can now be computed as: Methods detailed herein were combined with previous approaches as follows: For convenience, the atomic forces were split up into two components: F = F1 + F2 (23) in such a way that their derivatives are computed in two separate terms #/#r F1 and #/#q F2.

Then, the derivatives of #u were written as: where the first is the Cartesian Hessian according to an embodiment of the present invention and the second is a mixed Cartesian-Torsion Hessian as used previously.

Basic Algorithm The following expression was computed according to methods described herein: and added to the rest of #/#q #u computed by existing methods.

This was rewritten as:

= H #W#T #T (26)<BR> <BR> =H # (# #W)T to allow: 1. Computation of the"body"Hessian 2. Computation of pu', using the following sequence of operators: a. Y = #W b. Z=HY C. X =&commat;ZT d. Pu =HX The Low-memory Algorithm The low-memory algorithm only stores O (N) intermediate memory. The expression for the dynamic residual q-derivative can be written as follows: = H #W#T #T (27)<BR> =H QHT The matrices W and Q can be computed in an efficient, element-by-element method: Reorder bodies to minimize the difference m between child and parent index Reserve memory for m columns of matrix Q for body i=n to 1 for body j=i to 1 #i,# = Wi,j + #ci#ci,# + #i,#j #cjT - #ci#ci,#j #cjT (29)<BR> <BR> ##u(i)/#qq(j) = Hu(i)#i,j#q(j)T (30) end end where

k is equal to k mod (m) ci is the set of children of body i qi is the set of q-indices for body i ui is the set of u-indices for body i In the above, Einstein summation convention is used. The elements of matrix W are computed from #F1/@ as needed. ar EXAMPLE 2 COMPUTATION OF THE JACOBIAN MATRIX The Jacobian matrix consists of 4 blocks All but the lower left block are straight-forward to compute. According to methods described herein, the lower left block can be computed from the mass matrix M and the dynamic residual/7 : u =M-'pu The last term involves the derivative of dynamic residual with respect to the generalized coordinates, as described in the present invention.

EXAMPLE 3 COMPUTATION OF THE STIFFNESS MATRIX Let the system possess ii, generalized coordinates and n1 generalized speeds. If there are no constraints or quaternion joints, then fa9 = n". In this case, the full-rank (non-singular) stiffness matrix with respect to the independent set of generalized coordinates can be computed directly: K = #/#q #u (33) this is an nu # nu matrix.

However, in the presence of quaternions and/or constraints, n"&gt; nU. In this case, the stiffness matrix can be computed in two steps, the first of which is a subset of the Jacobian computation: 1. The singular stiffness matrix with respect to the full set of (dependent) generalized coordinates, is computed as the derivative of the dynamic residual #u: # = #/#q #u (34) this is an nq # nq matrix.

2. The non-singular stiffness matrix is then computed from this matrix, by elimination of the dependent generalized coordinates. This can be done using any of a number of standard approaches. For example, one can use singular-value decomposition of the constraint matrix. If G represent the constraint matrix, one computes its null space Z of G, by solving GZ = 0. Then the full-rank stiffness matrix can be computed as: K =ZTKZ One application of the stiffness matrix is in the computation of normal modes, as is well- known in the art.

Results <BR> <BR> <BR> <BR> The above implementation was used to compute-/ ? oflysozyme (+/-omegas) and<BR> <BR> <BR> <BR> <BR> <BR> q trypsin (+omegas) using the existing methods and methods of the present invention. The results are summarized in Table 1, below.

Table 1 Protein nQ Nu # atoms Speed (PA) Speed (MI) Lysozyme 514 513 1666 43 14 (no omegas) Lysozyme 620 619 1666 77 18 (+omegas) Trypsin 1238 1238 3223 553 80 (+omegas)

Speed (PA) is the computational speed (in seconds) using the previous methods described above ; speed (MI) is the computational speed (in seconds) using methods of the invention. It can be appreciated that methods of the invention can substantially increase the computation speed of #/#q #u relative to previously-used methods.

The Table 2 shows the results from the basic algorithm, and the low-memory (LM) implementations of the Fast Jacobian algorithm.

Table 2 Memory CPU Time Jacobian breakdown Peak dRhoU/dQ breakdown Heap Jacobian dRhoU/d Molecule nRes nAtoms Algorithm (MB) Total Q Total dF/dR dF/dU dF/dQ other LM 62 8.5 7.8 3.3 0.9 1.6 2.0 HIV B 96 9.2 8.4 3.9 0.9 1.6 2.0 Protease 15 subset 75 1196 Change 35% 8% % LM 100 14.6 13.2 5.4 1.6 2.7 3.5 HIV B 150 15.9 14.5 6.7 1.6 2.7 3.5 Protease 19 monomer 99 1565 Change 33% 8% % LM 155 23.3 20.9 8.6 2.6 4.2 5.6 10.

Basic 250 25.4 23.0 7 2.6 4.2 5.6 20 Lysozyme 129 1969 Change 38% 8% % 11.

LM 196 31.6 28.2 9 3.4 5.6 7.3 14.

Basic 320 34.2 30.7 4 3.4 5.6 7.3 17 Calmodulin 144 2209 Change 39% 8% % 24.11. 13.

LM 380 63.3 56.4 2 7.0 3 9 30.11. 13.

HIV Basic 626 69.5 62.6 3 7.0 4 9 Protease 20 dimer 198 3130 Change 39% 9% % 26.12. 15.

LM 405 69.2 61.4 4 7.3 2 5 31.12. 15.

Basic 724 74.2 66.1 2 7.3 2 4 15 Trypsin 223 3223 Change 44% 7% % 64.16. 27. 37.

P38 subset LM 867 163.3 145.3 7 3 1 2 (300 Basic N/A residues) 300 4851 Change

Scalability The Cartesian Hessian matrix F can be large, and may eventually exceed the 32- ar bit address space. To resolve this issue, the matrix can be constructed in parts. The algorithm can be made scalable by operating on a row of the Hessian matrix, constructing W row-by-row, and construct the corresponding columns of pu'.

While the foregoing is a complete description of the embodiments of the invention, it should be evident that various modifications, alternatives and equivalents may be made and used. Accordingly, the above description should not be taken as limiting the scope of the invention which is defined by the metes and bounds of the appended claims.