Abstract
This paper presents a step-by-step time integration algorithm for efficiently solving second-order nonlinear dynamic problems. The method employs the rewriting of motion as two sets of first-order differential equations. The interpolation of the relevant quantities is achieved by a particular quadratic polinomial expression for the velocities and forces and is defined by values at the boundaries of the time step. Then the time definite integrals of both first-order ordinary differential equations define the numerical relations in the step. An accurate extrapolation predictor and an adaptive time stepping procedure are used as the time predictor–corrector method.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
1 Introduction
The numerical simulation of the behaviour of nonlinear systems by direct integration of the motion equation is a current problem in computational dynamics. In the worst cases, N-body problems or finite element models resulting from the spatial discretization often lead to the time integration of stiff ordinary differential equations. This requirement is almost always carried out by explicit or implicit step-by-step approaches [1,2,3,4,5,6]. The computational approach by explicit schemes is very simple but numerical instability is an issue. As regards this a very small time step should be utilized for analysing the considered stiff problems. In this respect, fewer problems are encountered in the implicit approaches. In these the extrapolation (predictor phase) is followed by an iterative scheme (corrector phase) such as the Newton–Raphson iteration for the solution of the balance equation. Some of the first implicit time integration procedures used were the Houbolt, Newmark, and Wilson methods [4, 7]. Of these, the Newmark method was soon recognized to be most effective and is now widely used. In fact, in the trapezoidal rule version this method is second-order accurate and unconditionally stable in the linear analysis. However, in nonlinear analyses the stability of such a method is not assured. So research has focused on establishing more effective time integration schemes for nonlinear cases.
Schemes that obtain stable solutions can be carried out by requiring the conservation or decrease in the total energy of the Hamiltonian system within each time step. Such energy conserving algorithms have initially appeared in elastodynamics in the works [8] and [9]. Subsequently, schemes that preserve energy as well as linear and angular momentum in the time interval have been introduced in [10] (the energy-momentum method). In [11] a modification of the energy-momentum method which allows us to include numerical dissipation is introduced. These conservation properties are enforced into the equation of motion via Lagrange multipliers. Better computational characteristics are achieved by the use of adaptive time stepping procedures [12] and controllable numerical dissipation [13, 14]. More recently, schemes based on time finite element discretizations have been carried out (see [15, 16] and related bibliography). In these the Newmark family formulas can be recovered by the choice of representative constants and the algorithmic energy conservation is implicitly preserved. Finally, it seems that an appropriate representation and discretization of the motion equation lead to an appreciable difference in the time integration schemes with regard to stability [17,18,19,20].
An essential feature for a time integration scheme, as existing literature suggests (see for example [21]), is (at least) second-order accuracy. It is also desirable that the algorithm is based on a single-step scheme. Such an attribute is achieved if the solution of the motion equation at the current time depends only on the solution at the previous time step. One-step algorithms, however, may be cast into a spectrally equivalent linear multistep form. Finally, efficiency and robustness is obtained if additional variables, like Lagrange multipliers, are not involved in the algorithm and the method has no parameters which need to be chosen or adjusted by the analyst depending on the specific case. In this respect in [22,23,24] an effective implicit time integration method, referred to as the Bathe method, was introduced for linear and nonlinear analyses. The procedure uses a single-step, but two sub-steps where the trapezoidal rule is used in the first sub-steps and the three-points backward differential formula is employed in the second sub-steps.
An alternative approach to the time integration formulation is based on the rewriting of motion as two sets of first-order differential equations. One set specifies the motion in terms of the time derivative of the momenta and another defines the momenta in terms of the time derivative of the displacements. In this way energy and momentum conservation laws can be imposed in a simple manner while temporal compatibility between velocity and displacements can be properly relaxed [25,26,27,28].
In this paper the time definite integrals of both first-order ordinary differential equations define the numerical relations in the step. A quadratic polinomial expression for the velocity and internal and external forces is defined by values at the boundaries of the time step. In particular, related values are taken at the beginning of each step while values and time derivative are taken at the end of the step. Such a choice, used together with a accurate extrapolation predictor and an adaptive time stepping procedures, gives an effective time step-by-step procedure. The performed tests shown that stable and accurate solutions are obtained even for stiff nonlinear problems with reduced period elongation and high-frequency algorithmic damping in the analysis. Finally, the increase in computational effort due to the evaluation of the first derivative of the internal force vector, and consequent evaluation of the second derivative in the iteration matrix definition, is balanced by the increase in the range of stability of the time integration process and by the reduction in the number of Newton–Raphson iterations in the steps.
The paper is set out in the following way. In Sect. 2 we describe the temporal discretization that defines the current widely used (Newmark, Bathe) and the presented direct, implicit, single-step itegration schemes. The definition of related nonlinear problems is also given. In Sect. 3 we discuss on the stability and accuracy of the presented scheme. Section 4 contains the description of the adaptive time predictor–corrector solution algorithm. N-body and finite element structural models are formulated and analysed to compare the described solution methods in Sect. 5. Final conclusions are drawn in Sect. 6.
2 Approximation in the time domain
The semidiscrete formulation of the equation of motion can be written, after spatial discretization with \(\mathbf{u}\in \mathbb {R}^{N}\) unknown parameters vector and inclusion of boundary conditions, in the form
where \(\mathbf{u}_{,tt}\) denotes the acceleration, while \(\mathbf{u}^*\) and \(\mathbf{u}_{,t}^*\) represent the initial displacements and initial velocities, respectively. In (1) t is the time coordinate, \(\mathbf{M}{} \mathbf{u}_{,tt}\) is the inertia force, \(\mathbf{C}{} \mathbf{u}_{,t}\) the damping force, \(\mathbf{f}(\mathbf{u})\) the internal force and \(\mathbf{p}\) the external force. We refer to dynamic systems with \(V(\mathbf{u}(\mathbf{x},t))\) internal energy, \(T(\mathbf{u}_{,t}(\mathbf{x},t))\) kinetic energy and \(L(\mathbf{u}(\mathbf{x},t),t)\) external work where \(\mathbf{x}\) is the spatial coordinate. Then forces are defined as
For the time integration of the semidiscrete initial value problem (1) we refer to the current time step \(\varDelta t = \tilde{t} - \bar{t}\). In the following we refer with the accent mark \(\bar{\circ }\) and \(\tilde{\circ }\) quantities defined in the initial and the final time of the step, respectively. By assuming the state variables \(\bar{\mathbf{u}}\), \(\bar{\mathbf{u}}_{,t}\), \(\bar{\mathbf{u}}_{,tt}\), as known and making the external forces \(\mathbf{p}(t)\) for all t, the time integration is restricted to the successive solution of the state variables at the end of each step \(\tilde{\mathbf{u}}\), \(\tilde{\mathbf{u}}_{,t}\), \(\tilde{\mathbf{u}}_{,tt}\).
2.1 Newmark average acceleration scheme
In order to realize the step-by-step integration, the set of variables is reduced to the \(\tilde{\mathbf{u}}\) displacement parameters vector alone by the Newmark approximations
Here we use the average acceleration scheme by adopting \(\gamma =1/2\) and \(\beta =1/4\). Such a choice makes expressions (3) and (4) second order accurate and the related method unconditionally stable in linear problems. By inserting relations (3) and (4) in Eq. (1) written at the \(\tilde{t}\) time, we arrive at the nonlinear equation
in the unknown \(\tilde{\mathbf{u}}\) vector.
2.2 Bathe two equal spaced sub-steps scheme
In the Bathe integration scheme we calculate the unknown displacements, velocities, and accelerations at time \(\tilde{t}=\bar{t}+\varDelta t\) by considering the time step \(\varDelta t\) to consist of two sub-steps. Generally, the sub-step sizes are \(\gamma \varDelta t\) and \((1-\gamma ) \varDelta t\) for the first and second sub-steps, respectively. By using the trapezoidal rule over the first time interval \(\gamma \varDelta t\), we have the following assumptions on velocity and acceleration at the intermediate \(\hat{t}=\bar{t}+\gamma \varDelta t\) time
With the (6) assuptions the motion Eq. (1) becomes an algebraic nonlinear equation in the \(\hat{\mathbf{u}}\) unknown vector. Once the displacements \(\hat{\mathbf{u}}\) have been computed, the velocities \(\hat{\mathbf{u}}_{,t}\) and accelerations \(\hat{\mathbf{u}}_{,tt}\) are obtained from the relations given above in (6). Then, in the second sub-step the following Euler 3-point backward rule is utilized
where
The equally spaced \(\gamma =1/2\) sub-step choice seems to provide good computational characteristics for a large class of nonlinear problems [29, 30] and is adopted here. Then, by inserting relations (6) in the motion equation at the \(\hat{t}\) time, we have
After that, the time step is completed by computing the solution of the motion equation at the \(\tilde{t}\) final step time:
Equation (10) is as usual obtained by inserting (7) in (1).
2.3 An integration of first order momenta and equilibrium equations
An equivalent statement of motion Eq. (1) in terms of 2N first order equations may be written in the form
The equations of motion in the first-order form (11) and (12) are in agreement with Hamilton’s canonical equations where the system motion is described by means of the 2N paired quantities \((\mathbf{u},\mathbf{M}{} \mathbf{v})\) which constitute the phase space. In the current time step from \(\bar{t}\) to \(\tilde{t}=\bar{t}+\varDelta t\) we assume the quadratic approximation \(\mathbf{v}(t)=\mathbf{v}_{0}+\mathbf{v}_{1}t+\mathbf{v}_{2}t^{2}\) of the velocity vector with
where definition
is used. Then integration of Eq. (11) in the step leads to the following relation between the displacements \(\tilde{\mathbf{u}}\) and the velocities \(\tilde{\mathbf{v}}\) at the current \(\tilde{t}\) time:
Likewise the quadratic approximation \(\mathbf{g}(t)=\mathbf{g}_{0}+\mathbf{g}_{1}t+\mathbf{g}_{2}t^{2}\) of the force vector with
is assumed. By integrating in the step and by using expressions (16) it follows that
while
Therefore Eq. (12) becomes a nonlinear equation in the \(\tilde{\mathbf{u}}\) and \(\tilde{\mathbf{v}}\) unknown vectors. Besides, by (15) the following relation of the \(\tilde{\mathbf{v}}\) vector in function of the \(\tilde{\mathbf{u}}\) vector resuts:
where
Then, by defining \(\tilde{\mathbf{v}}_{D}(\tilde{\mathbf{u}}) = \mathbf{D}^{-1}\tilde{\mathbf{q}}(\tilde{\mathbf{u}})\), the nonlinear motion equation is written as
for \(\tilde{\mathbf{u}}\in \mathbb {R}^{N}\) alone.
3 Stability and accuracy of the presented scheme
To investigate and compare the properties of stability and accuracy of the described time integration schemes we refer mainly to [4, 31]. We consider the homogeneous undamped single-degree-of-freedom model equation
in which \(\omega \) is the free vibration frequency and \(T=2\pi /\omega \) the related period. Equation (22) has an analytical solution of the form
where the constants of integration \(c_{1}\) and \(c_{2}\) are determined by the given initial conditions. In the described numerical integration techniques, displacement, velocity and acceleration at the \(\tilde{t}\) time can be expressed in terms of their values at the \(\bar{t}\) time as
in which \(\mathbf{r}^{T}=\{u \,\,\, \varDelta t v \,\,\, \varDelta t^{2} a\}\) and \(\mathbf{A}\) is the amplification matrix. The explicit definition of the \(\mathbf{A}\) matrix for the Newmark and the Bathe schemes can be found in the cited literature while for the presented scheme it can be computed by referring to the application of the expressions in Sect. 2.3 to the linear Eq. (22):
where \(\tau =\omega \varDelta t\). Then (24) gives:
The stability and accuracy of the integration schemes are determined from the spectral properties of the \(\mathbf{A}\) matrix. In the following we refer to the invariants of \(\mathbf{A}\): \(\alpha _1\)\(=\) 1/2 trace \(\mathbf{A}\), \(\alpha _2\)\(=\) sum of principal minors of \(\mathbf{A}\), \(\alpha _3\)\(=\) determinant \(\mathbf{A}\). By the definition (28) it follows that \(\alpha _3=0\) and \(\alpha _1^2<\alpha _2\). Therefore
is the couple of complex conjugates (\(\lambda _3=0\)) eigenvalues of the \(\mathbf{A}\) matrix. In (29) we define \(\gamma _2=\sqrt{\alpha _2-\alpha _1^2}\) and \(\gamma _1=\alpha _1\). We can show that the general solution of the difference Eq. (24) is
where \(\rho _p = \sqrt{\gamma _1^2+\gamma _2^2}\), \(t_n = n \varDelta t\), \(\hat{\omega } = \phi /\varDelta t\) and \(\hat{c}_{1}\), \(\hat{c}_{2}\) are constants determined by the initial conditions. Measures of the relative accuracy can then be obtained by comparison between the (23) analytical solution and the (30) numerical solution. In particular, we define the period elongation (PE) and the amplitude decay (AD) by
where \(\hat{T}=2\pi /\hat{\omega }\). Likewise we can observe that stability of the numerical solution is achieved if the spectral radius \(\rho (\mathbf{A})=\max \{|\lambda _1|,|\lambda _2|,|\lambda _3|\}\) of matrix \(\mathbf{A}\) is less than or equal to 1.
To represent the behaviour of the above defined stability and accuracy measures we choose a sufficiently small \(d\tau \) increment of \(\tau \). Then, for each \(\tau _n=n\,d\tau \) point the \(\mathbf{A}_n=\mathbf{A}(\tau =2\pi \tau _n)\) matrix and related \(\lambda _n=\lambda _{nRe}\pm i\,\lambda _{nIm}\) complex conjugates eigenvalues are computed. By referring to the discrete values
we can evaluate
In (33) \(PE_n\) and \(AD_n\) are the percentage period elongation and percentage amplitude decay, respectively. Finally, by the spectral radius \(\rho _{pn}\) computed in (32) the stability of the scheme is checked. The curves obtained for increasing values of the relative \(\omega \varDelta t\) time step are given in Figs. 1 and 2. The (HFDI) fourth degree integration of Hamilton’s canonical equations scheme can be seen to perform well when compared to the Newmark and Bathe schemes. In particular, the HFDI scheme provides a very small period elongation with an unconditional stable condition and a good annihilation attribute of the high-frequency mode responses. On the other hand, compared with the other methods, the presented method shows a larger amplitude decay effect.
4 Adaptive time predictor–corrector solution algorithm
Equation (5) for the Newmark scheme, Eq. (9) (or (10)) for the standard Bathe scheme and (21) for the presented scheme represent a nonlinear system of algebraic equations of the type
defined at the \(t_{n+1}=t_{n}+\varDelta t_{n+1}=\tilde{t}\) time with the \(\mathbf{u}_{n+1}=\tilde{\mathbf{u}}\) (or \(\hat{\mathbf{u}}\) at \(\hat{t}\)) unknown vector. The velocities and accelerations at the end of the time step can then be obtained, for the above mentioned schemes, by relations (3) and (4), (7), (19) and (14) respectively. The Newton–Rapson iterative method can be used as corrector to solve system (34) by linearization
\(k=0,1,\ldots \).
The same initialization formula is used as predictor for all adopted integration schemes. When \(n=0\) the iterative process is initialized by the formula \(\mathbf{u}_{1}^{(0)}=\mathbf{u}^{*}+\varDelta t_{0}\mathbf{u}_{,t}^{*}\). When \(n>0\) the initialization is performed by the fourth order extrapolation \(\mathbf{u}_{n+1}^{(0)}(t)=\sum _{i=0}^{4}{} \mathbf{c}_{n+1,i}t^{i}\) with coefficient vectors \(\mathbf{c}_{i}\) determined by impositions:
Note that the \(\mathbf{u}_{n+1}^{(0)}(t)\) extrapolation defined by (36) has the same approximation of that defined in the proposed 2.3 scheme for displacements. Finally,
represents the predictor point for the \(n+1\) step of the solution algorithm. Such an accurate extrapolation is effective for the proposed algorithm because the scheme described in Sect. 2.3 has been shown to provide very accurate velocities and accelerations at the solution points. Furthermore, tests show that the presented method takes advantage in computational performance of the choice of an accurate extrapolation formula, whereas the Newmark and Bathe methods seem to be insensitive to such a choice.
By choosing the fixed tolerance \(\eta =10^{-8}\), the formula
is adopted as convergence criterion for the k-th Newton–Raphson iteration. The length \(\varDelta t_{n+1}=\mu _{n+1}\varDelta t_{n}\) of the extrapolation parameter in the \(n+1\)-th predictor–corrector step is chosen as a function of the iterations \(N^{(it)}_{n}\) performed in the previous corrector step and a \(\bar{N}^{(it)}\) target iteration count. Estimate
is adopted to save computational costs in the analysis because high \(\mu _{(n)}\) values can be reached. Evaluation (39) also takes into account the smoothness of the solution and then leads to an adaptive time stepping procedure that improves the accuracy of the approximation. Finally, if divergence in corrector iterations occurs a new predictor–corrector step is performed with the length \(\mu _{(k)}\) halved.
In the \(\varDelta t_{n+1}\) time step, stable behavior of the time integration method, in the absence of numerical dissipation, is verified by referring to the condition
as a sufficient stability condition in the nonlinear dynamical schemes (see, e.g., [8] and [10]). In the following we refer to \(W_{n}=V_{n}+T_{n}\) for the sum of the internal and the kinetic energies and we assume that physical dissipation is not present. Equation (40) expresses the conservation of the \(\varDelta E\) total energy in the step where \(\varDelta L\) symbolizes the work done by external forces within the time step. Here we use the trapezoidal rule to calculate the work of the external forces:
As regards consistency, in the numerical tests, accuracy in the \(\mathbf{z}\) quantity of interest is calculated by the mean-square norm of the error \(\varepsilon _\mathbf{z}\) according to
where \(T_{o}\) is the chosen time of observation. In (42) \(\mathbf{z}^{*}(t)\) denotes the reference solution which has been calculated with the Newmark algorithm and by using a \(\varDelta t=10^{-4}T_{o}\) constant time step. Integrals of expression (42) are computed by a sum on the steps carried out in the analysis and by using the trapezoidal rule as in (41) formula in the \(\varDelta t_{n+1}\) step. Values of \(\mathbf{z}^{*}(t)\) at the \(t_{n}\) and \(t_{n+1}\) time are detected as a linear interpolation of the neighbouring reference solution points.
We note that in the (21) nonlinear equilibrium equation the time derivative \(\tilde{\mathbf{p}}_{,t}\) of the external force must be computed. Of course, simple numerical approximations of such a derivative can be defined also for discontinuity behaviour of \(\mathbf{p}(t)\) in the \(\tilde{t}\) time. Here, to keep the integration scheme defined in the single step, the \(\tilde{\mathbf{p}}_{,t}=(\mathbf{p}(t_{n+1})-\mathbf{p}(t_{n}))/\varDelta t_{n+1}\) approximation was used. Finally, the computations carried out by the algotithm to accomplish the \(n+1\) step by means of the HFDI scheme are summarized in Table 1.
5 Numerical tests
Some numerical tests have been carried out with the suggested algorithms. The described integration algorithms resulting from Newmark, Bathe and presented HFDI equations have been compared. As stated, predictor–corrector steps are characterized by the use of Newton–Raphson method as corrector with assigned \(\bar{N}^{(it)}\) target iteration counts. Tables report the number steps of predictor–corrector steps and the \(N^{(it)}_{\small mv }\) mean value of the number of Newton–Raphson iterations in the steps
\(N^{(it)}_{\small tot }\) is the total number of iterations and \({t}_{T}\) the CPU time (s) spent in the whole analysis. For the Bathe like algorithm the \(N^{(it)}_{\small tot }\) value in (43) is the sum of the iterations needed for convergence for the first and second sub-step. In the case of divergence of the corrector phase we mark one step in the steps count while the number of Newton–Raphson iterations performed are sum in the \(N^{(it)}_{\small tot }\) value. The \(\varDelta t_{\small mv }\) mean value of the \(\varDelta t_{n}\) time integration steps used in the analysis is also reported as a computational characteristic of the adopted scheme.
Traversing the assigned \(T_{o}\) observation time is adopted as the stopping criteria of the step-by-step analysis. Also, in the analysis there is a maximum number of iterations \(N^{(it)}_{\small max }\) permitted in the corrector step. This is done because the convergence of the iterations may not occur or becomes very slow. We make \(N^{(it)}_{\small max }=2\bar{N}^{(it)}\). If the number of corrector iterations exceeds \(N^{(it)}_{\small max }\) we treat this circumstance as divergence and initialize a new corrector step as described in Sect. 4. Finally, the initial \(\varDelta t_{0}\) value in the extrapolation is chosen in such a way that convergence of the first step is attained at \(\bar{N}^{(it)}\) corrector iteration.
5.1 Motion of a dumbbell
The motion of a dumbbell in the two-dimensional ambient space (x, y) is examined here. The dumbbell is modelled as a two-body problem where additional background material on the motion of a several particles system in a potential field can be found in standard books on classical mechanics, see e.g. [32]. By referring to Fig. 3, we assume \(m_{1}=m_{2}=1\) with \(\mathbf{u}^{T}=\{ u_{1} \,\, v_{1} \,\, u_{2} \,\, v_{2} \}\). The initial conditions are given by \(\mathbf{u}^{*T}=\{ 0 \,\, 0 \,\, 1 \,\, 0 \}\) and \(\mathbf{u}_{,t}^{*T}=\{ 0 \,\, 10 \,\, 0 \,\, 5 \}\). The following Leonard-Jones-type potential, which is often employed in molecular dynamic simulations, is assumed to define the interaction of the two bodies:
In (44) r is the distance between the position of the centers of the two bodies. We make \(\sigma = (3/5)^{1/2}\), such that \(r=r_{0}=1\) characterizes the internal force free configuration. Accordingly, if \(r<1\), the resulting force is repulsive, whereas \(r>1\) implies attraction of the two bodies. We can refer to [15] and [20] for the numerical instabilities which are introduced in the time integration of such dynamic systems.
We investigate the quasi-rigid case related to \(A=10^{6}\). The integration process analyzes the behaviour of the system for \(T_{o}=2\). Computational performances are reported in Table 2 for each of described integration schemes, unless it becomes unstable (div), and increasing values of the \(\bar{N}^{(it)}\) target iteration counts. We note that, due to a fast convergence of the Newton iterations, in the HFDI procedure large increments of \(\varDelta t_{\small mv }\) values are achieved when small increments of \(\bar{N}^{it}\) are fixed.
To illustrate the motion, Fig. 4 contains a sequence of configurations calculated by the considered algorithms. An unstable behaviour of the Newmark scheme is observed for the required \(\bar{N}^{(it)}\)=4.5 where \(\varDelta t_{\small mv }\)=0.26 results. This value is computed by referring to t from 0 to the beginning of the unphysical motion. Accurate representations are obtained by the Bathe \(\bar{N}^{(it)}\)=2\(\cdot \)4.5 (\(\varDelta t_{\small mv }\)=0.40) and the presented \(\bar{N}^{(it)}\)=3.3 (\(\varDelta t_{\small mv }\)=0.45) algorithms, although a period elongation increase is observed in the Bathe experimentations. Likewise, the longitudinal stretch \(\lambda =(r-r_{0})/r_{0}\) is plotted versus time in the Fig. 5. Of course high frequency are not represented while the mean value is provided by the algorithms. Finally, the increment of the total energy (40) is shown in Fig. 6 where stable behaviour is represented by oscillations contained in the neighbourhood of zero. A pronounced overshooting in the response is also encountered in the Bathe integration. The observed increase of the increment of total energy in the presented method, however, is limited also for long periods of analysis. To showing this Fig. 7 reports the evolution of the normalized increment of the total energy \(\varDelta E / W\) with \(T_{o}=10\) for several \(\bar{N}^{(it)}\) values.
5.2 Motion of a tetrahedra
In this example we consider the motion of a tetrahedra-type structure in three-dimensional space analyzed in [15]. The structure (see Fig. 8) is treated as 4-body \(m_{i}=1\), \(i=1,\ldots ,4\) problem where the particles are connected by means of nonlinear elastic springs. By denoting with \(r^{ij}\) the distance between the ith and the jth particle, for defining the potential energy of the elastic springs we make use of the Neo-Hooke-type potential given by [33]:
\(i,j=1,\ldots ,4\). The spring constants are assumed to be given by \(k^{ij}=1\) for \((i,j)\ne (1,2)\) while \(k^{ij}=10^{3}\) for \((i,j)=(1,2)\). In (45) \(r_{0}^{ij}\) is the distance between particles in the force-free configuration where the relation \(V^{ij}(r_{0}^{ij})=0\) holds. In view of (45), the forces of interaction are given by
In (46) \(\mathbf{e}^{ij}\) is the director individualized by the related i and j particles and \(\mathbf{f}^{ij}(r_{0}^{ij})=\mathbf{0}\). The displacement vector of the i body of tetrahedra is represented by \(\mathbf{u}_{i}^{T}=\{ u_{i} \,\, v_{i} \,\, w_{i} \}\). Then the initial position is described by the definitions \(\mathbf{u}_{1}^{T}=\{ 0 \,\, 0 \,\, 0 \}\), \(\mathbf{u}_{2}^{T}=\{ 1 \,\, 0 \,\, 0 \}\), \(\mathbf{u}_{3}^{T}=\{ 0 \,\, 1 \,\, 0 \}\), \(\mathbf{u}_{4}^{T}=\{ 0 \,\, 0 \,\, 1 \}\).
Starting at rest (\(\mathbf{u}_{i,t}^{*}=\mathbf{0}\) for all i), the tetrahedra is subjected to a spatially fixed external load P(t) acting in the x direction on the first particle with time history as described in Fig. 8. For the considered integration methods Table 3 reports the related computational performances for increasing values of the \(\bar{N}^{(it)}\) required iterations and for a \(T_{o}=50\) observation time. In the Newmark scheme the reported steps values denotes that several divergences in corrector iterations occurs for high values of \(\bar{N}^{(it)}\). A stable and efficient behaviour of Bathe and HFDI algorithms is also observed.
Accurancy in the analysis is evaluated by computing the error \(\varepsilon _\mathbf{u}\) and \(\varepsilon _\mathbf{f}\) in (42) for the \(\mathbf{u}^{T}=\{ \mathbf{u}_{1}^{T} \,\, \mathbf{u}_{2}^{T} \,\, \mathbf{u}_{3}^{T} \,\, \mathbf{u}_{4}^{T} \}\) and \(\mathbf{f}^{T}=\{ \mathbf{f}^{12^{T}} \,\, \mathbf{f}^{13^{T}} \,\, \mathbf{f}^{14^{T}} \,\, \mathbf{f}^{23^{T}} \,\, \mathbf{f}^{24^{T}} \,\, \mathbf{f}^{34^{T}} \}\) vectors, respectively. Figures 9 and 10, by varying the \(\varDelta t_{\small mv }\) time step mean value, show that a better approximation of the quantities of interest is obtained by the HFDI algorithm in respect to the Newmark and Bathe algorithm. In effect the time step reported in the Bathe pattern takes in account both the sub-steps. We note how a non constant coefficient in the order of the approximations is obtained due to the adaptive time step size (see Fig. 11). In Fig. 12 and 13 we also report the sequence of configurations in the \(x-y\) plane of the body 1 and the evolution of \(f^{12}\) interaction force for \(\varDelta t_{\small mv }\) about the value 0.30, respectively. As we can see, this test shows the overall effective behaviour of the HFDI integation procedure.
5.3 Articulated system
Here, we study the behaviour of an articulated system. The dynamics of three masses \(m_{1}=m_{2}=m_{3}=\)1 is stimulated by a force P(t) acting on mass \(m_{1}\) and in the y-coordinate direction (see Fig. 14). Internal forces are due to the potential
The first term of the potential (47) expresses internal forces proportional to the distance \(r^{ij}\) between \(m_{i}\) and \(m_{j}\) masses and with spring stiffness \(k_{e}\) in the \(r^{ij}=h\) force-free configuration. The second term of the potential (47) expresses an internal force proportional to the angle \(\alpha ^{12}-\alpha ^{23}\) between \((m_{1},m_{2})\) body and \((m_{2},m_{3})\) body with spring stiffness \(k_{f}\) in the \(\alpha ^{12}=\alpha ^{23}\) force-free configuration. We assume \(h=\)0.5 and \(k_{e}= 10^{7}\), \(k_{f}= 10^{3}\). Time-stepping schemes applied to such three body problems can be found in [18].
The system is characterized by Cartesian state variables \(\mathbf{u}^{T}=\{u_{1}\,v_{1}\,u_{2}\,v_{2}\,u_{3}\,v_{3}\}\). The definition of dynamical motion equations is here similar to that of the previous example. For completeness, we give the explicit formulae used for the definitions of the geometrical parameters \(r^{ij}\) and \(\alpha ^{ij}\):
Applications of described integration schemes for increasing values of the target iteration count are investigated. Table 4 reports the computational characteristics performed in the time integration processes for the observing time \(T_{o}=\)0.5.
The motion of the articulated system, computed by Newmark, Bathe and HFDI methods with \(\bar{N}^{it}=\)5.0 is shown in Fig. 15. The evolution of the \(\varDelta \alpha =\alpha ^{12}-\alpha ^{23}\) relative angle at the central body versus the time is also shown in Fig. 16 for the \(\varDelta t_{\small mv }\) quantity about the value 0.0065. For the same \(\varDelta t_{\small mv }\) value the increment of the total energy \(\varDelta E_{n}\) in the step is shown in Fig. 17. The unstable behaviour in the Newmark formulation is observed. As can be seen, an unphysical chaotic motion of the system occurs at about \(t=\)0.2. Accurate representations are obtained by the presented HFDI algorithms, while a pronounced period elongation is observed in the Bathe experimentations. High frequency are not reproduced exactly although the mean value is provided by the algorithms. Finally, for several assigned values of \(\bar{N}^{it}\) and for the long observation time \(T_{o}=\)3, the behaviour of the normalized increment of the total energy in the HFDI approach is showed in Fig. 18. We note that appreciable values of the energy increment are encountered only for high time steps and after many evolutions of the articulated system.
5.4 Finite element Timoshenko beam
The plane movement of a toss rule is now investigated (examples of solutions of such a dynamical problem can be found in [19, 20, 34]). The characteristics of the examined time integration schemes will be shown here in connection with one-dimensional finite element discretizations. Standard linear two node shape functions for horizontal u and vertical v displacements and the rotation \(\alpha \) of the cross section are used. Since the Timoshenko beam model is considered in the examined beam, only \(C^{0}\) continuity for the displacements and rotations is needed at the element boundaries. A total Lagrangian co-rotational formulation is used to describe the motion of the element from the initial to the final deformed configuration. For a detailed account of the main co-rotational framework we can refer to the textbook [35] and to the articles [36,37,38].
In summary, the kinematic is split into two stages. First, a rigid translation and rotation of the local element frame is considered. This rigid motion is accompanied by deformation displacements with respect to the local element frame. We refer to the referential coordinate \(\xi \) along the beam element centerline \(-h/2\le \xi \le +h/2\). Then, by referring to the deformational displacements expressed in the local system, the total deformation energy V is obtained from:
where EA, GA and EJ represent the axial, shear and flexural rigidities, respectively. In the \(\mathbf{u}^{T}(\xi )=\{ u(\xi ) \,\, v(\xi ) \,\, \alpha (\xi ) \}\) state variable representation, measurements of the axial \(\varepsilon \) and transversal \(\gamma \) strain, together with the usual definition of the curvature \(\chi \), are formulated by the following expressions:
where \(S_{e}=\sin (\hat{\alpha })\) and \(C_{e}=\cos (\hat{\alpha })\) specify the orientation (\(\hat{\alpha }\)) of the element in the initial configuration. We refer to an element with nodes i and j at the boundaries. Definitions like \(\alpha _{o}=(\alpha _{i}+\alpha _{j})/2\) are used at the centre of the element.
The elemental internal force vector is then derived from the differentation of potential (50) with respect to the nodal parameters of the vector \(\mathbf{u}^{T}=\{ u_{i} \,\, u_{j} \,\, v_{i} \,\, v_{j} \alpha _{i} \,\, \alpha _{j} \}\) in the \(\mathbf{u}(\xi )\) interpolation. The elemental inertia force vector is derived from the differentation of kinetic energy here defined by
with respect to the first derivative of nodal parameters. By the definition (54) of the elemental kinetic energy, matrix \(\mathbf{M}\) can be represented as a diagonal matrix. This simplifies the computation of the nonlinear motion Eq. (21) wherever an accurate representation of the inertia forces is achieved.
The geometry, material, position of loads and load function of the rule are described in Fig. 19. For discretization \(N_{el}=\)6 beam elements as described above are used. Table 5 shows the behaviour of the three different integration processes for \(T_{o}=\)0.1. The divergent behaviour of the corrector phase in the Newmark approach for high \(\bar{N}^{it}\) values can be seen while a stable and efficient behaviour of Bathe and HFDI algorithms is verified. Accuracy in the analysis is now evaluated by compute the error \(\varepsilon _{\alpha _{\small mv }}\) and \(\varepsilon _{m_{\small c }}\) related to the definitions:
where \(\alpha _{o}^{(e)}\) refers to the elemental e value and \(x_{\small c }\) is the x coordinate at the centre of the bar.
Figures 20 and 21, for increasing \(\varDelta t_{\small mv }\) time step mean values, show that the best approximation of the quantities of interest is obtained by the HFDI algorithm compared to the Newmark and Bathe algorithm. Moreover, we note that the time step reported in the Bathe patterns takes into account both the sub-steps. As usual, a non constant coefficient in the order of the approximations is obtained due to the adaptive time step size (as reported in Fig. 22). In Fig. 23 we report the evolution of mean value \(\alpha _{,t\small mv }\) of the angular velocity \(\alpha _{,t}\) defined as in expression (55). Likewise, Fig. 24 shows the evolution of central value \(N{\small c }\) of the axial stress \(EA\varepsilon \). A highly effective behaviour of the HFDI integation procedure is verified. Furthermore, no significant differences were detected in computational performances for refined meshes of the beam.
6 Conclusions
The presented work is concerned with the development of an effective time integration algorithm in nonlinear dynamic problems. The algorithm is based on a predictor–corrector procedure and employs the rewriting of motion as two sets of first-order differential equations. The features of the presented procedure are: a particular quadratic polinomial expression for the relevant quantities such as velocities and forces in the interpolation, a suitable extrapolation in the predictor phase and an optimization of the number of iterations in the corrector phase which generates an efficient adaptive time stepping selection. Furthermore, the following attributes characterize the type of integrators taken into account: (i) the approximation scheme is at least second-order accuracy; (ii) it is applicable to general nonlinear analyses; (iii) it does not involve additional variables or artificial parameters chosen by the user; (iv) it is a single-step scheme with self-starting attribute. For comparison, the widely used integration methods with the above characteristics such as Newmark and Bathe schemes are implemented with the same algorithm approach.
In the tests performed, N-body and finite element structural models are formulated and analized to compare the considered solution methods. For the presented algorithm, the tests show that stable and accurate solutions are obtained even for stiff nonlinear problems while there is reduced period elongation and high-frequency algorithmic damping in the analysis. The increase in computational effort due to the evaluation of the first derivative of the internal force vector, and consequent evaluation of the second derivative in the iteration matrix definition, is balanced by the increase in the range of stability of the time integration process and by the reduction in the number of Newton–Raphson iterations in the steps.
Therefore, if compared with widely used integration schemes with the above characteristics, such as the Newmark and Bathe schemes, the proposed method requires less computational effort combined with valuable accuracy and stability in the time analysis.
References
Belytschko, T., Hughes, T.: Computational Methods for Transient Analysis. North Holland, Amsterdam (1983)
Hughes, T.: The Finite Element Method. Prentice Hall, New Jersey (1987)
Géradin, M., Rixen, D.: Mechanical Vibrations Theory and Applications to Structural Dynamics. Wiley, Paris (1994)
Bathe, K.J.: Finite Element Procedures. Prentice Hall, New Jersey (1996)
Hulbert, G., Chung, J.: Explicit time integration algorithms for structural dynamics with optimal numerical dissipation. Comput. Methods Appl. Mech. Eng. 137, 175–188 (1996)
Géradin, M., Cardona, A.: Flexible Multibody Dynamics. A Finite Element Approach. Wiley, New Jersey (2000)
Newmark, N.: A method of computation for structural dynamics. J. Eng. Mech. Div. ASCE 85, 67–94 (1959)
Belytschko, T., Schoeberle, D.F.: On the unconditional stability of an implicit algorithm for nonlinear structuraldynamics. J. Appl. Mech. 42, 865–869 (1975)
Hughes, T.J.R., Caughy, T.K., Liu, W.K.: Finite-element methods for nonlinear elastodynamics which conserve energy. J. Appl. Mech. 45, 366–370 (1978)
Simo, J.C., Tarnow, N.: A new energy and momentum conserving algorithm for the nonlinear dynamics of shells. Intern. J. Numer. Methods Eng. 37, 2527–2549 (1994)
Armero, F., Petöcz, E.: Formulation and analysis of conserving algorithms for frictionless dynamic contact/impact problems. Comput. Methods Appl. Mech. Eng. 158, 269–300 (1998)
Kuhl, D., Ramm, E.: Generalized energy-momentum method for non-linear adaptive shell dynamics. Comput. Methods Appl. Mech. Eng. 178, 343–366 (1999)
Hoff, C., Pahl, P.J.: Development of an implicit method with numerical dissipation for generalized single step algorithm for structural dynamics. Comput. Methods Appl. Mech. Eng. 67, 367–385 (1988)
Chung, J., Hulbert, G.M.: A time integration algorithm for structural dynamics with improved numerical dissipation: the generalized-\(\alpha \) method. J. Appl. Mech. 60, 371–375 (1993)
Betsch, P., Steinmann, P.: Conservation properties of a time FE method. part I: time-stepping schemes for N-body problems. Int. J. Numer. Methods Eng. 49, 599–638 (2000)
Pimenta, P.M., Campello, E.M.B., Wriggers, P.: An exact conserving algorithm for nonlinear dynamisc with rotational DOFs and general hyperelasticity. part 1 rods. Comput. Mech. 42, 715–732 (2008)
Argyris, J., Papadrakakis, M., Mauroutis, Z.S.: Nonlinear dynamic analysis of shells with the triangular element TRIC. Comput. Methods Appl. Mech. Eng. 192, 3005–3038 (2003)
Lopez, S.: Changing the representation and improving stability in time-stepping analysis of structural non-linear dynamics. Nonlinear Dyn. 46, 337–348 (2006)
Lopez, S.: Improving stability by change of representation in time-stepping analysis of non-linear beams dynamics. Intern. J. Numer. Methods Eng. 69, 822–836 (2007)
Lopez, S.: Relaxed representations and improving stability in time-stepping analysis of three-dimensional structural nonlinear dynamics. Nonlinear Dyn. 69, 705–720 (2012)
Hughes, T.: The Finite Element Method: Linear Static and Dynamic Finite Element Analysis. Courier Dover Publications, New York (2012)
Bathe, K.J., Baig, M.M.I.: On a composite implicit time integration procedure for nonlinear dynamics. Comput. Struct. 83, 2513–34 (2005)
Bathe, K.J.: Conserving energy and momentum in nonlinear dynamics: a simple implicit time integration scheme. Comput. Struct. 85, 437–45 (2007)
Bathe, K.J., Noh, G.: Insight into an implicit time integration scheme for structural dynamics. Comput. Struct. 98, 1–6 (2012)
Simo, J.C., Wong, K.K.: Unconditionally stable algorithms for rigid body dynamics that exactly preserve energy and momentum. Intern. J. Numer. Methods Eng. 31, 19–52 (1991)
Gonzalez, O.: Exact energy and momentum conserving algorithms for general models in non-linear elasticity. Comput. Methods Appl. Mech. Eng. 190, 1763–1783 (2000)
Lens, E.V., Cardona, A., Geradin, M.: Energy preserving time integration for constrained multibody systems. Multibody Syst. Dyn. 11, 41–61 (2004)
Krenk, S.: State-space time integration with energy control and 4th order accuracy for linear dynamic systems. Intern. J. Numer. Methods Eng. 65, 595–619 (2006)
Malakiyeh, M.M., Shojaee, S., Bathe, K.J.: The Bathe time integration method revisited for prescribing desired numerical dissipation. Comput. Struct. 212, 289–298 (2019)
Noh, G., Bathe, K.J.: The Bathe time integration method with controllable spectral radius: The \(\rho _{\infty }\)-Bathe method. Comput. Struct. 212, 299–310 (2019)
Humar, J.L.: Dynamics of Structures. CRC Press, Leiden (2012)
Arnold, V.I.: Mathematical Methods of Classical Mechanics. Prentice-Hall, Englewood Cliffs (1989)
Ogden, R.W.: Non-Linear Elastic Deformations. E. Horwood, Chichester (2013)
Kuhl, D., Ramm, E.: Constraint energy momentum algorithm and its application to non-linear dynamics of shells. Comput. Methods Appl. Mech. Eng. 136, 293–315 (1996)
Crisfield, M.A.: Non-linear Finite Element Analysis of Solids and Structures. Advanced Topics, vol. 2. Wiley, Chichester (2003)
Nour-Omid, B., Rankin, C.C.: Finite rotation analysis and consistent linearization using projectors. Comput. Methods Appl. Mech. Eng. 93, 353–384 (1991)
Pacoste, C.: Co-rotational flat facet triangular elements for shell instability analyses. Comput. Methods Appl. Mech. Eng. 156, 75–110 (1998)
Lopez, S.: Three-dimensional finite rotations treatment based on a minimal set parameterization and vector space operations in beam elements. Comput. Mech. 52, 377–399 (2013)
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Lopez, S. A predictor–corrector time integration algorithm for dynamic analysis of nonlinear systems. Nonlinear Dyn 101, 1365–1381 (2020). https://doi.org/10.1007/s11071-020-05798-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11071-020-05798-x