A new planar triangular element based on the absolute nodal coordinate formulation

In this paper, an improved three-node incomplete cubic planar triangular element is proposed based on the two recently reported absolute nodal coordinate formulation triangular elements. Compared with the existing absolute nodal coordinate formulation elements, a different set of polynomial basis is used to develop the new element using the method analogous to the one used in the conventional Zienkiewicz triangular element. Concise shape functions are obtained by employing both Cartesian and area coordinate sets and the concept of independent area gradient coordinate vector. From the view of the order of the polynomial basis, the criterion for developing incomplete cubic absolute nodal coordinate formulation triangular element that captures the quadratic accuracy is presented. Additionally, the algebraic constraint method used in developing the incomplete cubic triangular element is discussed. Based on the criterion, the proposed element is compared analytically with the previous incomplete cubic element. On the other hand, the proposed element is evaluated using both the static and dynamic numerical examples. The element successfully passes the patch test. The results obtained by the proposed element in this paper agree well with analytical solutions or those given by the full cubic element/general commercial finite element software. The higher accuracy, better convergence of the proposed element and the criterion are verified.

TLISMNI/Adams algorithm for the solution of the differential/algebraic equations of constrained dynamical systems

This paper examines the performance of the 3rd and 4th order implicit Adams methods in the framework of the two-loop implicit sparse matrix numerical integration method in solving the differential/algebraic equations of heavily constrained dynamical systems. The variable-step size two-loop implicit sparse matrix numerical integration/Adams method proposed in this investigation avoids numerical force differentiation, ensures satisfying the nonlinear algebraic constraint equations at the position, velocity, and acceleration levels, and allows using sparse matrix techniques for efficiently solving the dynamical equations. The iterative outer loop of the two-loop implicit sparse matrix numerical integration/Adams method is aimed at achieving the convergence of the implicit integration formulae used to solve the independent differential equations of motion, while the inner loop is used to ensure the convergence of the iterative procedure used to satisfy the algebraic constraint equations. To solve the independent differential equations, two different implicit Adams integration formulae are examined in this investigation; a 3rd order implicit Adams-Moulton formula with a 2nd order explicit predictor Adams Bashforth formula, and a 4th order implicit Adams-Moulton formula with a 3rd order explicit predictor Adams Bashforth formula. A standard Newton–Raphson algorithm is used to satisfy the nonlinear algebraic constraint equations at the position level. The constraint equations at the velocity and acceleration levels are linear, and therefore, there is no need for an iterative procedure to solve for the dependent velocities and accelerations. The algorithm used for the error check and step-size change is described. The performance of the two-loop implicit sparse matrix numerical integration/Adams algorithm developed in this investigation is evaluated by comparison with the explicit predictor-corrector Adams method which has a variable-order and variable-step size. Simple and heavily constrained dynamical systems are used to evaluate the accuracy, robustness, damping characteristics, and effect of the outer-loop iterations of the proposed implicit schemes. The results obtained in this investigation show that the two-loop implicit sparse matrix numerical integration methods proposed in this study can be more efficient for stiff systems because of their ability to damp out high-frequency oscillations. Explicit integration methods, on the other hand, can be more efficient in the case of non-stiff systems.

Convergence of Variational Iteration Method for Fractional Delay Integrodifferential-Algebraic Equations

Fractional order delay integrodifferential-algebraic equations are often used for many practical modeling problems in science and engineering, which have time lag, memory, constraint limit, and so forth. These yield some difficulties in numerical computation. The iterative methods are good choice. In the present paper, we construct variational iteration method for solving them by using the appropriate restricted variation. This overcomes the difficulties caused by limitations of large storage amount and algebraic constraint and extends the previous conclusions.

A Method for Solving Large-Scale Multiloop Constrained Dynamical Systems Using Structural Decomposition

A structural decomposition method based on symbol operation for solving differential algebraic equations (DAEs) is developed. Constrained dynamical systems are represented in terms of DAEs. State-space methods are universal for solving DAEs in general forms, but for complex systems with multiple degrees-of-freedom, these methods will become difficult and time consuming because they involve detecting Jacobian singularities and reselecting the state variables. Therefore, we adopted a strategy of dividing and conquering. A large-scale system with multiple degrees-of-freedom can be divided into several subsystems based on the topology. Next, the problem of selecting all of the state variables from the whole system can be transformed into selecting one or several from each subsystem successively. At the same time, Jacobian singularities can also be easily detected in each subsystem. To decompose the original dynamical system completely, as the algebraic constraint equations are underdetermined, we proposed a principle of minimum variable reference degree to achieve the bipartite matching. Subsequently, the subsystems are determined by aggregating the strongly connected components in the algebraic constraint equations. After that determination, the free variables remain; therefore, a merging algorithm is proposed to allocate these variables into each subsystem optimally. Several examples are given to show that the proposed method is not only easy to implement but also efficient.

Integration of Geometry and Analysis for Vehicle System Applications: Continuum-Based Leaf Spring and Tire Assembly

The development of new and complex vehicle models using the absolute nodal coordinate formulation (ANCF) and multibody systems (MBS) algorithms is discussed in this paper. It is shown how a continuum-based finite element (FE) leaf spring and tire assembly can be developed at a preprocessing stage and integrated with MBS algorithms, allowing for the elimination of dependent variables before the start of the dynamic simulations. Leaf springs, which are important elements in the suspension system of large vehicles, are discretized using ANCF FEs and are integrated with ANCF tire meshes to develop new models with significant details. To this end, the concept of the ANCF reference node (ANCF-RN) is used in order to systematically assemble the vehicle model using linear algebraic constraint equations that can be applied at a preprocessing stage. These algebraic constraint equations define new FE connectivity conditions that include the leaf spring shackle/chassis assembly, tire flexible tread/rigid rim assembly, tire/axle assembly, and revolute joints between different vehicle components. The approach presented in this paper allows for using both gradient deficient and fully parameterized ANCF FEs to develop the new models. In order to develop accurate leaf spring models, the prestress of the leaves and the contact forces between leaves are taken into consideration in the ANCF models developed in this investigation. Numerical results are presented in order to demonstrate the use of the computational framework described in this paper to build continuum-based leaf spring/tire assembly that can be integrated with complex vehicle models. The results of this paper also demonstrate the feasibility of developing a CAD (computer-aided design)/analysis system in which the geometry and analysis mesh of a complete vehicle can be developed in one step, thereby avoiding the incompatibility and costly process of using different codes in the flexible MBS analysis.

A Method for Solving Dynamic Equations of a 3-PRR Parallel Robot

In this paper, kinematic relationships for a 3-PRR planar parallel robot are first presented. The robot dynamics equations are formulated using Lagrange equations of first kind. The derived equations are a mixed set of differential and algebraic constraint equations, DAE, which must be satisfied simultaneously. In order to solve the robot dynamic equations, a new method is presented in which the dynamics equation is first partitioned into two parts. The constraint equations and the dependent coordinates are next eliminated. This reduces the dynamic equations to a set of differential equations as a function of three independent coordinates. Finally, a trajectory for the robot end-effector is specified and PD controller which follows the desired trajectory is implemented. The proposed method significantly simplifies the solution of the dynamics equations.