Time‐parallel implicit integrators for the near‐real‐time prediction of linear structural dynamic responses

The time‐parallel framework for constructing parallel implicit time‐integration algorithms (PITA) is revisited in the specific context of linear structural dynamics and near‐real‐time computing. The concepts of decomposing the time‐domain in time‐slices whose boundaries define a coarse time‐grid, generating iteratively seed values of the solution on this coarse time‐grid, and using them to time‐advance the solution in each time‐slice with embarrassingly parallel time‐integrations are maintained. However, the Newton‐based corrections of the seed values, which so far have been computed in PITA and related approaches on the coarse time‐grid, are eliminated to avoid artificial resonance and numerical instability. Instead, the jumps of the solution on the coarse time‐grid are addressed by a projector which makes their propagation on the fine time‐grid computationally feasible while avoiding artificial resonance and numerical instability. The new PITA framework is demonstrated for a complex structural dynamics problem from the aircraft industry. Its potential for near‐real‐time computing is also highlighted with the solution of a relatively small‐scale problem on a Linux cluster system. Copyright © 2006 John Wiley & Sons, Ltd.     

Time‐decomposed parallel time‐integrators: theory and feasibility studies for fluid,structure, and fluid–structure applications

A methodology for squeezing the most out of massively parallel processors when solving partial differential evolution equations by implicit schemes is presented. Its key components include a preferred implicit time‐integrator, a decomposition of the time‐domain into time‐slices, independent time‐integrations in each time‐slice of the semi‐discrete equations, and Newton‐type iterations on a coarse time‐grid. Hence, this methodology parallelizes the time‐loop of a time‐dependent partial differential equation solver without interfering with its sequential or parallel space‐computations. It is particularly interesting for time‐dependent problems with a few degrees of freedom such as those arising in robotics and protein folding applications, where the opportunities for parallelization over the degrees of freedom are limited. Error and stability analyses of the proposed parallel methodology are performed for first‐ and second‐order hyperbolic problems. Its feasibility and impact on reducing the solution time below what is attainable by methods which address only parallelism in the space‐domain are highlighted for fluid, structure, and coupled fluid–structure model problems. Copyright © 2003 John Wiley & Sons, Ltd.     

A novel non‐linearly explicit second‐order accurate L‐stable methodology for finite deformation: hypoelastic/hypoelasto‐plastic structural dynamics problems

A novel non‐linearly explicit second‐order accurate L‐stable computational methodology for integrating the non‐linear equations of motion without non‐linear iterations during each time step, and the underlying implementation procedure is described. Emphasis is placed on illustrative non‐linear structural dynamics problems employing both total/updated Lagrangian formulations to handle finite deformation hypoelasticity/hypoelasto‐plasticity models in conjunction with a new explicit exact integration procedure for a particular rate form constitutive equation. Illustrative numerical examples are shown to demonstrate the robustness of the overall developments for non‐linear structural dynamics applications. Copyright © 2004 John Wiley & Sons, Ltd.     

A‐scalability and an integrated computational technology and framework for non‐linear structural dynamics. Part 2: Implementation aspects and parallel performance results

An integrated framework and computational technology is described that addresses the issues to foster absolute scalability (A‐scalability) of the entire transient duration of the simulations of implicit non‐linear structural dynamics of large scale practical applications on a large number of parallel processors. Whereas the theoretical developments and parallel formulations were presented in Part 1, the implementation, validation and parallel performance assessments and results are presented here in Part 2 of the paper. Relatively simple numerical examples involving large deformation and elastic and elastoplastic non‐linear dynamic behaviour are first presented via the proposed framework for demonstrating the comparative accuracy of methods in comparison to available experimental results and/or results available in the literature. For practical geometrically complex meshes, the A‐scalability of non‐linear implicit dynamic computations is then illustrated by employing scalable optimal dissipative zero‐order displacement and velocity overshoot behaviour time operators which are a subset of the generalized framework in conjunction with numerically scalable spatial domain decomposition methods and scalable graph partitioning techniques. The constant run times of the entire simulation of ‘fixed‐memory‐use‐per‐processor’ scaling of complex finite element mesh geometries is demonstrated for large scale problems and large processor counts on at least 1024 processors. Copyright © 2003 John Wiley & Sons, Ltd.     

The global modal parameterization for non‐linear model‐order reduction in flexible multibody dynamics

In flexible multibody dynamics, advanced modelling methods lead to high‐order non‐linear differential‐algebraic equations (DAEs). The development of model reduction techniques is motivated by control design problems, for which compact ordinary differential equations (ODEs) in closed‐form are desirable. In a linear framework, reduction techniques classically rely on a projection of the dynamics onto a linear subspace. In flexible multibody dynamics, we propose to project the dynamics onto a submanifold of the configuration space, which allows to eliminate the non‐linear holonomic constraints and to preserve the Lagrangian structure. The construction of this submanifold follows from the definition of a global modal parameterization (GMP): the motion of the assembled mechanism is described in terms of rigid and flexible modes, which are configuration‐dependent. The numerical reduction procedure is presented, and an approximation strategy is also implemented in order to build a closed‐form expression of the reduced model in the configuration space. Numerical and experimental results illustrate the relevance of this approach. Copyright © 2006 John Wiley & Sons, Ltd.     

A fast implementation of the FETI‐DP method: FETI‐DP‐RBS‐LNA and applications on large scale problems with localized non‐linearities

As parallel and distributed computing gradually becomes the computing standard for large scale problems, the domain decomposition method (DD) has received growing attention since it provides a natural basis for splitting a large problem into many small problems, which can be submitted to individual computing nodes and processed in a parallel fashion. This approach not only provides a method to solve large scale problems that are not solvable on a single computer by using direct sparse solvers but also gives a flexible solution to deal with large scale problems with localized non‐linearities. When some parts of the structure are modified, only the corresponding subdomains and the interface equation that connects all the subdomains need to be recomputed. In this paper, the dual–primal finite element tearing and interconnecting method (FETI‐DP) is carefully investigated, and a reduced back‐substitution (RBS) algorithm is proposed to accelerate the time‐consuming preconditioned conjugate gradient (PCG) iterations involved in the interface problems. Linear–non‐linear analysis (LNA) is also adopted for large scale problems with localized non‐linearities based on subdomain linear–non‐linear identification criteria. This combined approach is named as the FETI‐DP‐RBS‐LNA algorithm and demonstrated on the mechanical analyses of a welding problem. Serial CPU costs of this algorithm are measured at each solution stage and compared with that from the IBM Watson direct sparse solver and the FETI‐DP method. The results demonstrate the effectiveness of the proposed computational approach for simulating welding problems, which is representative of a large class of three‐dimensional large scale problems with localized non‐linearities. Copyright © 2005 John Wiley & Sons, Ltd.     

Robust and provably second‐order explicit–explicit and implicit–explicit staggered time‐integrators for highly non‐linear compressible fluid–structure interaction problems

An explicit–explicit staggered time‐integration algorithm and an implicit–explicit counterpart are presented for the solution of non‐linear transient fluid–structure interaction problems in the Arbitrary Lagrangian–Eulerian (ALE) setting. In the explicit–explicit case where the usually desirable simultaneous updating of the fluid and structural states is both natural and trivial, staggering is shown to improve numerical stability. Using rigorous ALE extensions of the two‐stage explicit Runge–Kutta and three‐point backward difference methods for the fluid, and in both cases the explicit central difference scheme for the structure, second‐order time‐accuracy is achieved for the coupled explicit–explicit and implicit–explicit fluid–structure time‐integration methods, respectively, via suitable predictors and careful stagings of the computational steps. The robustness of both methods and their proven second‐order time‐accuracy are verified for sample application problems. Their potential for the solution of highly non‐linear fluid–structure interaction problems is demonstrated and validated with the simulation of the dynamic collapse of a cylindrical shell submerged in water. The obtained numerical results demonstrate that, even for fluid–structure applications with strong added mass effects, a carefully designed staggered and subiteration‐free time‐integrator can achieve numerical stability and robustness with respect to the slenderness of the structure, as long as the fluid is justifiably modeled as a compressible medium. Copyright © 2010 John Wiley & Sons, Ltd.     

Multi‐time‐step and two‐scale domain decomposition method for non‐linear structural dynamics

In this paper we propose a method to improve the means of taking into account the specific time‐scale and space‐scale characteristics in time‐dependent non‐linear problems. This method enables the use of arbitrary time steps in each subdomain: these can be coupled by prescribing continuous velocities at the interfaces, which are modelled using a dual Schur formulation. For certain subdomains, in space, we adopt a two‐scale resolution technique inspired by the multigrid methods in order to obtain the part of the solution related to small variation lengths on a refined scale and the part corresponding to large variation lengths on a coarse scale. For non‐linear problems, we propose an algorithm with a single iteration level to deal with both the non‐linear equilibrium and the two space scales thanks to a two‐grid method in which the relaxation steps are performed using a non‐linear, preconditioned conjugate gradient algorithm. Finally, we present an example which demonstrates the feasibility of the method. Copyright © 2003 John Wiley & Sons, Ltd.     

Numerical solution of second‐order,two‐point boundary value problems using continuous genetic algorithms

Second‐order, two‐point boundary‐value problems are encountered in many engineering applications including the study of beam deflections, heat flow, and various dynamic systems. Two classical numerical techniques are widely used in the engineering community for the solution of such problems; the shooting method and finite difference method. These methods are suited for linear problems. However, when solving the non‐linear problems, these methods require some major modifications that include the use of some root‐finding technique. Furthermore, they require the use of other basic numerical techniques in order to obtain the solution. In this paper, the author introduces a novel method based on continuous genetic algorithms for numerically approximating a solution to this problem. The new method has the following characteristics; first, it does not require any modification while switching from the linear to the non‐linear case; as a result, it is of versatile nature. Second, this approach does not resort to more advanced mathematical tools and is thus easily accepted in the engineering application field. Third, the proposed methodology has an implicit parallel nature which points to its implementation on parallel machines. However, being a variant of the finite difference scheme with truncation error of the order O(h²), the method provides solutions with moderate accuracy. Numerical examples presented in the paper illustrate the applicability and generality of the proposed method. Copyright © 2004 John Wiley & Sons, Ltd.     

An explicit discontinuous Galerkin method for non‐linear solid dynamics: Formulation,parallel implementation and scalability properties

An explicit‐dynamics spatially discontinuous Galerkin (DG) formulation for non‐linear solid dynamics is proposed and implemented for parallel computation. DG methods have particular appeal in problems involving complex material response, e.g. non‐local behavior and failure, as, even in the presence of discontinuities, they provide a rigorous means of ensuring both consistency and stability. In the proposed method, these are guaranteed: the former by the use of average numerical fluxes and the latter by the introduction of appropriate quadratic terms in the weak formulation. The semi‐discrete system of ordinary differential equations is integrated in time using a conventional second‐order central‐difference explicit scheme. A stability criterion for the time integration algorithm, accounting for the influence of the DG discretization stability, is derived for the equivalent linearized system. This approach naturally lends itself to efficient parallel implementation. The resulting DG computational framework is implemented in three dimensions via specialized interface elements. The versatility, robustness and scalability of the overall computational approach are all demonstrated in problems involving stress‐wave propagation and large plastic deformations. Copyright © 2007 John Wiley & Sons, Ltd.     

A parallel hp‐FEM infrastructure for three‐dimensional structural acoustics

This paper describes a parallel three‐dimensional numerical infrastructure for the solution of a wide range of time‐harmonic problems in structural acoustics and vibration. High accuracy and rate of error‐convergence, in the mid‐frequency regime,is achieved by the use of hp‐finite and infinite element approximations. The infrastructure supports parallel computation in both single and multi‐frequency settings. Multi‐frequency solves utilize concurrent factoring of the frequency‐dependent linear algebraic systems and are naturally scalable. Scalability of large‐scale single‐frequency problems is realized by using FETI‐DP—an iterative domain‐decomposition scheme. Numerical examples are presented to cover applications in vibratory response of fluid‐filled elastic structures as well as radiation and scattering from elastic structures submerged in an infinite acoustic medium. We demonstrate both the numerical accuracy as well as parallel scalability of the infrastructure in terms of problem parameters that include wavenumber and number of frequencies, polynomial degree of finite/infinite element approximations as well as the number of processors. Scalability and accuracy is evaluated for both single and multiple frequency sweeps on four high‐performance parallel computing platforms: SGI Altix, SGI Origin, IBM p690 SP and Linux‐cluster. Results show good performance on shared as well as distributed‐memory architecture. Copyright © 2006 John Wiley & Sons, Ltd.     

Efficient non‐linear model reduction via a least‐squares Petrov–Galerkin projection and compressive tensor approximations

A Petrov–Galerkin projection method is proposed for reducing the dimension of a discrete non‐linear static or dynamic computational model in view of enabling its processing in real time. The right reduced‐order basis is chosen to be invariant and is constructed using the Proper Orthogonal Decomposition method. The left reduced‐order basis is selected to minimize the two‐norm of the residual arising at each Newton iteration. Thus, this basis is iteration‐dependent, enables capturing of non‐linearities, and leads to the globally convergent Gauss–Newton method. To avoid the significant computational cost of assembling the reduced‐order operators, the residual and action of the Jacobian on the right reduced‐order basis are each approximated by the product of an invariant, large‐scale matrix, and an iteration‐dependent, smaller one. The invariant matrix is computed using a data compression procedure that meets proposed consistency requirements. The iteration‐dependent matrix is computed to enable the least‐squares reconstruction of some entries of the approximated quantities. The results obtained for the solution of a turbulent flow problem and several non‐linear structural dynamics problems highlight the merit of the proposed consistency requirements. They also demonstrate the potential of this method to significantly reduce the computational cost associated with high‐dimensional non‐linear models while retaining their accuracy. Copyright © 2010 John Wiley & Sons, Ltd.     

Fatigue control of thin‐walled structures

The control of the ultimate fatigue behaviour of slender thin‐walled structures is treated in the paper. A macro‐ and micromechanical simulation model adopting the neural network approach is used for the numerical analysis of the problem. The numerical treatment of the non‐linear problems is made using the updated Lagrangian formulation of motion combined with the pseudo‐force technique in the FETM‐approach. Each step of the iteration approaches the solution of the linear problem and the feasibility of the parallel processing and neural network numerical techniques is established. The application on the actual slender bridge is made in order to demonstrate the efficiency of the procedures suggested. Copyright © 2003 John Wiley & Sons, Ltd.     

Arbitrary discontinuities in space–time finite elements by level sets and X‐FEM

An enriched finite element method with arbitrary discontinuities in space–time is presented. The discontinuities are treated by the extended finite element method (X‐FEM), which uses a local partition of unity enrichment to introduce discontinuities along a moving hyper‐surface which is described by level sets. A space–time weak form for conservation laws is developed where the Rankine–Hugoniot jump conditions are natural conditions of the weak form. The method is illustrated in the solution of first order hyperbolic equations and applied to linear first order wave and non‐linear Burgers' equations. By capturing the discontinuity in time as well as space, results are improved over capturing the discontinuity in space alone and the method is remarkably accurate. Implications to standard semi‐discretization X‐FEM formulations are also discussed. Copyright © 2004 John Wiley & Sons, Ltd.     

A new exact,closed‐form a priori global error estimator for second‐ and higher‐order time‐integration methods for linear elastodynamics

In our recent papers, we suggested a new two‐stage time‐integration procedure for linear elastodynamics problems and showed that for long‐term integration, time‐integration methods with zero numerical dissipation are very effective for all linear elastodynamics problems, including structural dynamics, wave propagation and impact problems. In this paper, we have derived a new exact, closed‐form a priori global error estimator for time integration of linear elastodynamics by the trapezoidal rule and the high‐order time continuous Galerkin (TCG) methods with zero numerical dissipation (these methods correspond to the diagonal of the Padé approximation table). The new a priori global error estimator allows the selection of the size (the number) of time increments for the indicated time‐integration methods at the prescribed accuracy as well as the comparison of the effectiveness of the second‐ and high‐order TCG methods at different observation times. A numerical example shows a good agreement between theoretical and numerical results. Copyright © 2011 John Wiley & Sons, Ltd.     

Multi‐time‐step explicit–implicit method for non‐linear structural dynamics

We present a method with domain decomposition to solve time‐dependent non‐linear problems. This method enables arbitrary numeric schemes of the Newmark family to be coupled with different time steps in each subdomain: this coupling is achieved by prescribing continuity of velocities at the interface. We are more specifically interested in the coupling of implicit/explicit numeric schemes taking into account material and geometric non‐linearities. The interfaces are modelled using a dual Schur formulation where the Lagrange multipliers represent the interfacial forces. Unlike the continuous formulation, the discretized formulation of the dynamic problem is unable to verify simultaneously the continuity of displacements, velocities and accelerations at the interfaces. We show that, within the framework of the Newmark family of numeric schemes, continuity of velocities at the interfaces enables the definition of an algorithm which is stable for all cases envisaged. To prove this stability, we use an energy method, i.e. a global method over the whole time interval, in order to verify the algorithms properties. Then, we propose to extend this to non‐linear situations in the following cases: implicit linear/explicit non‐linear, explicit non‐linear/explicit non‐linear and implicit non‐linear/explicit non‐linear. Finally, we present some examples showing the feasibility of the method. Copyright © 2001 John Wiley & Sons, Ltd.     

Higher‐order accurate time‐step‐integration algorithms by post‐integration techniques

In this paper, a framework to construct higher‐order‐accurate time‐step‐integration algorithms based on the post‐integration techniques is presented. The prescribed initial conditions are naturally incorporated in the formulations and can be strongly or weakly enforced. The algorithmic parameters are chosen such that unconditionally A‐stable higher‐order‐accurate time‐step‐integration algorithms with controllable numerical dissipation can be constructed for linear problems. Besides, it is shown that the order of accuracy for non‐linear problems is maintained through the relationship between the present formulation and the Runge–Kutta method. The second‐order differential equations are also considered. Numerical examples are given to illustrate the validity of the present formulation. Copyright © 2001 John Wiley & Sons, Ltd.     

k‐version of finite element method in gas dynamics: higher‐order global differentiability numerical solutions

In this paper, we consider and examine alternate finite element computational strategies for time‐dependent Navier–Stokes equations describing high‐speed compressible flows with shocks in a viscous and conducting medium, with the ultimate objective of establishing the desired features of a general mathematical and computational framework for such initial value problems (IVP) in which: (a) the numerically computed solutions are in agreement with the physics of evolution described by the governing differential equations (GDEs) i.e. the IVP, (b) the solutions are admissible in the non‐discretized form of the GDEs in the pointwise sense (i.e. anywhere and everywhere) in the entire space–time domain, and hence in the integrated sense as well, (c) the numerical approximations progressively approach the same global differentiability in space and time as the theoretical solutions, (d) it is possible to time march the solutions (this is essential for efficiency as well as ensuring desired accuracy of the computed solution for the current increment of time, i.e. to minimize the error build up in the time marching process), (e) the computational process is unconditionally stable and non‐degenerate regardless of the choice of discretization, nature of approximations and their global differentiability and the dimensionless parameters influencing the physics of the process, (f) there are no issues of stability, CFL number limitations and (g) the mathematical and computational methodology is independent of the nature of the space–time differential operators. We consider one‐dimensional compressible flow in a viscous and conducting medium with shocks as model problems to illustrate various features of the general mathematical and computational framework used here and to demonstrate that the proposed framework is general and is applicable to all IVP. The Riemann shock tube with a single diaphragm serves as a model problem. The specific details presented in the paper discuss: (1) Choice of the form of the GDEs, i.e. strong form or weak form. (2) Various choices of variables. The paper establishes and considers density, velocity and temperature as variables of choice. (3) Details of the space–time least squares (LS) integral forms (meritorious over all others in all aspects) are presented and choice of approximation spaces are discussed. (4) In all numerical studies we consider a viscous and conducting medium with ideal gas law, however results are also presented for non‐conducting medium. Extension of this work to real gas models will be presented in a separate paper. It is worth noting that when the medium is viscous and conducting, the solutions of gas dynamics equations are analytic. (5) It is also significant to note that upwinding methods based on addition of artificial diffusion such as SUPG, SUPG/DC, SUPG/DC/LS and their many variations are neither needed nor used in this present work. (6) Numerical studies are aimed at resolving the localized details of the shock structure, i.e. shock relations, shock width, shock speed, etc. as well as the over all global behaviour of the solution in the entire space–time domain. (7) Numerical studies are presented for Riemann shock tube for high Mach number flows with special emphasis also on time accuracy of the evolution which is ensured by requiring that the approximations for each increment of time satisfy non‐discretized form of the GDEs in the pointwise sense, and hence in the integrated sense as well. (8) Comparisons are made with published results as well as theoretical solutions (when possible). It is established that space–time least squares processes are the only processes that yield variationally consistent space–time integral forms, and hence unconditionally non‐degenerate space–time computational processes, which when considered in higher‐order scalar product spaces provide the desired mathematical framework in which progressively higher‐order global differentiability solutions in space and time yield the same characteristics as the theoretical solutions of the IVP in all aspects. Copyright © 2006 John Wiley & Sons, Ltd.     

The maximum principle violations of the mixed‐hybrid finite‐element method applied to diffusion equations

The abundant literature of finite‐element methods applied to linear parabolic problems, generally, produces numerical procedures with satisfactory properties. However, some initial–boundary value problems may cause large gradients at some points and consequently jumps in the solution that usually needs a certain period of time to become more and more smooth. This intuitive fact of the diffusion process necessitates, when applying numerical methods, varying the mesh size (in time and space) according to the smoothness of the solution. In this work, the numerical behaviour of the time‐dependent solutions for such problems during small time duration obtained by using a non‐conforming mixed‐hybrid finite‐element method (MHFEM) is investigated. Numerical comparisons with the standard Galerkin finite element (FE) as well as the finite‐difference (FD) methods are checked. Owing to the fact that the mixed methods violate the discrete maximum principle, some numerical experiments showed that the MHFEM leads sometimes to non‐physical peaks in the solution. A diffusivity criterion relating the mesh steps for an artificial initial–boundary value problem will be presented. One of the propositions given to avoid any non‐physical oscillations is to use the mass‐lumping techniques. Copyright © 2002 John Wiley & Sons, Ltd.     

Remarks on the interpretation of current non‐linear finite element analyses as differential–algebraic equations

For the numerical solution of materially non‐linear problems like in computational plasticity or viscoplasticity the finite element discretization in space is usually coupled with point‐wise defined evolution equations characterizing the material behaviour. The interpretation of such systems as differential–algebraic equations (DAE) allows modern‐day integration algorithms from Numerical Mathematics to be efficiently applied. Especially, the application of diagonally implicit Runge–Kutta methods (DIRK) together with a Multilevel‐Newton method preserves the algorithmic structure of current finite element implementations which are based on the principle of virtual displacements and on backward Euler schemes for the local time integration. Moreover, the notion of the consistent tangent operator becomes more obvious in this context. The quadratical order of convergence of the Multilevel‐Newton algorithm is usually validated by numerical studies. However, an analytical proof of this second order convergence has already been given by authors in the field of non‐linear electrical networks. We show that this proof can be applied in the current context based on the DAE interpretation mentioned above. We finally compare the proposed procedure to several well‐known stress algorithms and show that the inclusion of a step‐size control based on local error estimations merely requires a small extra time‐investment. Copyright © 2001 John Wiley & Sons, Ltd.