1. What are the benefits and drawbacks of explicit and implicit integration algorithms in structural dynamics?
Explicit algorithms assume the solution to the problem is already known, and the calculation of new response values within each step only requires the use of the quantities already obtained in the previous steps. This makes the calculation process straightforward and less time-consuming. However, explicit algorithms are subject to conditional stability, as the numerical solution is stable only if the proportion between the integration step and the intrinsic period of the structure is below a certain threshold. Implicit algorithms, on the other hand, contain one or more values related to the current step, requiring the assumed value to be improved through continuous iterations. While implicit algorithms offer higher numerical stability, they may be computationally more intensive. Linearly implicit integration techniques have been developed to combine the computational efficiency of explicit algorithms with the stability of implicit algorithms. These techniques, such as the Chang method, CR method, and Rosenbrock technique, have been proposed by various researchers to address nonlinear structural problems and improve computational efficiency without compromising stability.
read more
2. What is the Newmark-β method used for?
The Newmark-β method is extensively employed for solving second-order motion equations in multi-degree-of-freedom (MDoF) mechanisms with nonlinear restoring and damping forces. It postulates the fluctuation of acceleration within a timeframe and utilizes the initial state quantity of motion at the onset of the time step. The method provides expressions for velocity and displacement at the end of the time step, maintaining consistent acceleration approach, unconditional stability, and implicit format.
read more
3. How does Rosenbrock's approach integrate Newton iteration?
Rosenbrock's approach integrates a single Newton iteration within the implicit Runge-Kutta technique, making it a standard linearly implicit numerical integration procedure. This technique avoids iterative computations while maintaining the same level of consistency as the classic Runge-Kutta method. The motion equation is written in a lower-order Hamiltonian form, and the solution of Equation (11) is the mean of the s-stage. The Rosenbrock method requires updating the Jacobian matrix at the outset of each step. The first-order Rosenbrock method has been employed as an exemplar, and the derivation of Equation (15) utilizing the Newton iteration principle is presented. Typically, a single iteration is sufficient to meet specific accuracy criteria in the iterative process. The incorporation of a Newton iteration into the average acceleration method was motivated by the Rosenbrock method strategy, as reported by reference [43].
read more
4. How can a novel linearly implicit algorithm be derived?
A novel linearly implicit algorithm can be derived by implementing an embedded Newton iteration and utilizing the displacement term as the iteration parameter. For an MDoF system with nonlinear restoring and damping forces, the motion equations can be represented mathematically. By substituting equations and performing one Newton iteration, the solution for the displacement increment can be derived. The explicit recursive format of the new algorithm is represented by equations (39)-(41). The resolution of the displacement increment is crucial for deriving subsequent values of displacement, velocity, and acceleration.
read more