Search

Plastic flow is conventionally treated as continuous in finite element (FE) codes, whether in isotropic, anisotropic plasticity, or crystal plasticity. This approach, derived from continuum mechanics, contradicts the intermittent nature of plasticity at the elementary scale. Understanding crystal plasticity at micro-scale opens the door to new engineering applications, such as microscale machining. In this work, a new approach is proposed to account for the intermittence of plastic deformation while remaining within the framework of continuum mechanics. We introduce a material parameter, the plastic deformation threshold, denoted as $\Delta p_{min}$, corresponding to the plastic deformation carried by the minimal plastic deformation burst within the material. The incremental model is based on the traditional predictor-corrector algorithm to calculate the elastoplastic behavior of a material subjected to any external loading. The model is presented within the framework of small deformations for von Mises plasticity. To highlight the main features of the approach, the plastic strain increment is calculated using normality rule and consistency conditions, and is accepted only if it exceeds $\Delta p_{min}$. To achieve this, a time-discontinuous generalization of the Karush-Kuhn-Tucker (KKT) conditions is proposed. The simulations show that the introduction of the plastic threshold allows for the reproduction of the spatiotemporal intermittence of plastic flow, capturing the self-organization of plastic flow in complex loading scenarios within an FE model.

A multi-scale methodology is developed in conjunction with a probabilistic fatigue lifetime model for structures with pores whose exact distribution, i.e. geometries and locations, is unknown. The method takes into account uncertainty in fatigue lifetimes in structures due to defects at two scales: micro-scale heterogeneity & meso-scale pores. An element-wise probabilistic strain-life model with its criterion modified for taking into account multiaxial loading is developed for taking into account the effect of micro-scale defects on the lifetime. Meso-scale pores in the structure are taken into account via statistical modelling of the expected pore populations via a finite element method, based on tomographic scans of a small region of porous material used to make the structure. A previously implemented Neuber-type plastic correction algorithm is used for fast full-field approximation of the strain-life criterion around the statistically generated pore fields. The probability of failure of a porous structure is obtained via a weakest link assumption at the level of its constituent finite elements. The fatigue model can be identified via a maximum likelihood estimate on experimental fatigue data of structures containing different types of pore populations. The proposed method is tested on an existing high-cycle fatigue data-set of an aluminium alloy with two levels of porosity. The model requires lesser data for identification than traditional models that consider porous media as a homogeneous material, as the same base material is considered for the two grades of porous material. Numerical studies on synthetically generated data show that the method is capable of taking into account the statistical size effect in fatigue, and demonstrate that fatigue properties of subsurface porous material are lower than that of core porous material, which makes homogenisation of the method non-trivial., Comment: 42 pages, 29 figures

This paper introduces a new local plastic correction algorithm that is aimed at accelerating elasto-plastic finite element (FE) simulations for structural problems exhibiting localised plasticity (around e.g. notches, geometrical defects). The proposed method belongs to the category of generalised multi-axial Neuber-type methods, which process the results of an elastic prediction point-wise in order to calculate an approximation of the full elasto-plastic solution. The proposed algorithm relies on a rule of local proportionality, which, in the context of J2 plasticity, allows us to express the plastic plastic correction problem in terms of the amplitude of the full mechanical tensors only. This lightweight correction problem can be solved for numerically using a fully implicit time integrator that shares similarities with the radial return algorithm. The numerical capabilities of the proposed algorithm are demonstrated for a notched structure and a specimen containing a distribution of spherical pores, subjected to monotonic and cyclic loading. As a second point of innovation, we show that the proposed local plastic correction algorithm can be further accelerated by employing a simple meta-modelling strategy, with virtually no added errors. At last, we develop and investigate the merits of a deep-learning-based corrective layer designed to the approximation error of the plastic corrector. A convolutional architecture is used to analyse the neighbourhoods of material points and outputs a scalar correction to the point-wise Neuber-type predictions. This optional brick of the proposed plastic correction methodology relies on the availability of a set of full elasto-plastic finite element solutions to be used as training data-set., Comment: 60 pages, 25 figures. Paper accepted for publication in Springer Nature - Computational Mechanics

In this work, the uncertainty associated with the finite element discretization error is modeled following the Bayesian paradigm. First, a continuous formulation is derived, where a Gaussian process prior over the solution space is updated based on observations from a finite element discretization. To avoid the computation of intractable integrals, a second, finer, discretization is introduced that is assumed sufficiently dense to represent the true solution field. A prior distribution is assumed over the fine discretization, which is then updated based on observations from the coarse discretization. This yields a posterior distribution with a mean that serves as an estimate of the solution, and a covariance that models the uncertainty associated with this estimate. Two particular choices of prior are investigated: a prior defined implicitly by assigning a white noise distribution to the right-hand side term, and a prior whose covariance function is equal to the Green's function of the partial differential equation. The former yields a posterior distribution with a mean close to the reference solution, but a covariance that contains little information regarding the finite element discretization error. The latter, on the other hand, yields posterior distribution with a mean equal to the coarse finite element solution, and a covariance with a close connection to the discretization error. For both choices of prior a contradiction arises, since the discretization error depends on the right-hand side term, but the posterior covariance does not. We demonstrate how, by rescaling the eigenvalues of the posterior covariance, this independence can be avoided.

Stress prediction in porous materials and structures is challenging due to the high computational cost associated with direct numerical simulations. Convolutional Neural Network (CNN) based architectures have recently been proposed as surrogates to approximate and extrapolate the solution of such multiscale simulations. These methodologies are usually limited to 2D problems due to the high computational cost of 3D voxel based CNNs. We propose a novel geometric learning approach based on a Graph Neural Network (GNN) that efficiently deals with three-dimensional problems by performing convolutions over 2D surfaces only. Following our previous developments using pixel-based CNN, we train the GNN to automatically add local fine-scale stress corrections to an inexpensively computed coarse stress prediction in the porous structure of interest. Our method is Bayesian and generates densities of stress fields, from which credible intervals may be extracted. As a second scientific contribution, we propose to improve the extrapolation ability of our network by deploying a strategy of online physics-based corrections. Specifically, we condition the posterior predictions of our probabilistic predictions to satisfy partial equilibrium at the microscale, at the inference stage. This is done using an Ensemble Kalman algorithm, to ensure tractability of the Bayesian conditioning operation. We show that this innovative methodology allows us to alleviate the effect of undesirable biases observed in the outputs of the uncorrected GNN, and improves the accuracy of the predictions in general., Comment: 68 pages; 52 figures

In this paper, we present a robust and efficient unfitted concurrent multiscale method for continuum-continuum coupling, based on the Cut Finite Element Method (CutFEM). The computational domain is defined using approximate signed distance functions over a fixed background mesh and is decomposed into microscale and macroscale regions using a novel zooming technique. The zoom interface is represented by a signed distance function intersecting the computational mesh arbitrarily. The mesh inside the zoomed region is hierarchically refined to resolve the microstructure. In the examples considered, the microstructure may contain voids and hard inclusions, and its geometry is defined implicitly by a signed distance function interpolated over the refined mesh. Our zooming technique allows the zoom interface to intersect the microstructure interface in an arbitrary fashion, enabling greater flexibility and accuracy in the modelling of complex geometries. The micro and macro regions are coupled using Nitsche's method, ensuring stability and accuracy in the solution. Ghost penalty terms are utilised to ensure the stability of cut elements along the zoom interface and the microstructure interface. To demonstrate the effectiveness of our framework, we apply it for modelling several heterogeneous structures with both linear elasticity and plasticity constitutive behaviours. The results show that our framework is robust and efficient, producing accurate and reliable solutions for such problems. Our proposed method provides a highly versatile and effective approach to multiscale modeling of structures with complex microstructures, and has the potential to be extended to problems requiring seamless moving of zooming region(s) during the simulation, such as damage growth and fracture propagation.

In this paper, we develop a novel unfitted multiscale framework that combines two separate scales represented by only one single computational mesh. Our framework relies on a mixed zooming technique where we zoom at regions of interest to capture microscale properties and then mix the micro and macroscale properties in a transition region. Furthermore, we use homogenization techniques to derive macro model material properties. The microscale features are discretized using CutFEM. The transition region between the micro and macroscale is represented by a smooth blending function. To address the issues with ill-conditioning of the multiscale system matrix due to the arbitrary intersections in cut elements and the transition region, we add stabilization terms acting on the jumps of the normal gradient (ghost-penalty stabilization). We show that our multiscale framework is stable and is capable to reproduce mechanical responses for heterogeneous structures in a mesh-independent manner. The efficiency of our methodology is exemplified by 2D and 3D numerical simulations of linear elasticity problems.

Materials' microstructures are signatures of their alloying composition and processing history. Therefore, microstructures exist in a wide variety. As materials become increasingly complex to comply with engineering demands, advanced computer vision (CV) approaches such as deep learning (DL) inevitably gain relevance for quantifying microstrucutures' constituents from micrographs. While DL can outperform classical CV techniques for many tasks, shortcomings are poor data efficiency and generalizability across datasets. This is inherently in conflict with the expense associated with annotating materials data through experts and extensive materials diversity. To tackle poor domain generalizability and the lack of labeled data simultaneously, we propose to apply a sub-class of transfer learning methods called unsupervised domain adaptation (UDA). These algorithms address the task of finding domain-invariant features when supplied with annotated source data and unannotated target data, such that performance on the latter distribution is optimized despite the absence of annotations. Exemplarily, this study is conducted on a lath-shaped bainite segmentation task in complex phase steel micrographs. Here, the domains to bridge are selected to be different metallographic specimen preparations (surface etchings) and distinct imaging modalities. We show that a state-of-the-art UDA approach surpasses the na\"ive application of source domain trained models on the target domain (generalization baseline) to a large extent. This holds true independent of the domain shift, despite using little data, and even when the baseline models were pre-trained or employed data augmentation. Through UDA, mIoU was improved over generalization baselines from 82.2%, 61.0%, 49.7% to 84.7%, 67.3%, 73.3% on three target datasets, respectively. This underlines this techniques' potential to cope with materials variance., Comment: 20 pages, 7 figures

Multiscale computational modelling is challenging due to the high computational cost of direct numerical simulation by finite elements. To address this issue, concurrent multiscale methods use the solution of cheaper macroscale surrogates as boundary conditions to microscale sliding windows. The microscale problems remain a numerically challenging operation both in terms of implementation and cost. In this work we propose to replace the local microscale solution by an Encoder-Decoder Convolutional Neural Network that will generate fine-scale stress corrections to coarse predictions around unresolved microscale features, without prior parametrisation of local microscale problems. We deploy a Bayesian approach providing credible intervals to evaluate the uncertainty of the predictions, which is then used to investigate the merits of a selective learning framework. We will demonstrate the capability of the approach to predict equivalent stress fields in porous structures using linearised and finite strain elasticity theories., Comment: 50 pages, 42 figures; corrected typos; clarifications

In this article, we present a cut finite element method for two-phase Navier-Stokes flows. The main feature of the method is the formulation of a unified continuous interior penalty stabilisation approach for, on the one hand, stabilising advection and the pressure-velocity coupling and, on the other hand, stabilising the cut region. The accuracy of the algorithm is enhanced by the development of extended fictitious domains to guarantee a well defined velocity from previous time steps in the current geometry. Finally, the robustness of the moving-interface algorithm is further improved by the introduction of a curvature smoothing technique that reduces spurious velocities. The algorithm is shown to perform remarkably well for low capillary number flows, and is a first step towards flexible and robust CutFEM algorithms for the simulation of microfluidic devices.

In this article, we develop a cut finite element method for one-phase Stefan problems, with applications in laser manufacturing. The geometry of the workpiece is represented implicitly via a level set function. Material above the melting/vaporisation temperature is represented by a fictitious gas phase. The moving interface between the workpiece and the fictitious gas phase may cut arbitrarily through the elements of the finite element mesh, which remains fixed throughout the simulation, thereby circumventing the need for cumbersome re-meshing operations. The primal/dual formulation of the linear one-phase Stefan problem is recast into a primal non-linear formulation using a Nitsche-type approach, which avoids the difficulty of constructing inf-sup stable primal/dual pairs. Through the careful derivation of stabilisation terms, we show that the proposed Stefan-Signorini-Nitsche CutFEM method remains stable independently of the cut location. In addition, we obtain optimal convergence with respect to space and time refinement. Several 2D and 3D examples are proposed, highlighting the robustness and flexibility of the algorithm, together with its relevance to the field of micro-manufacturing.

This paper presents a novel methodology of local adaptivity for the frequency-domain analysis of the vibrations of Reissner-Mindlin plates. The adaptive discretization is based on the recently developed Geometry Independent Field approximaTion (GIFT) framework, which may be seen as a generalisation of the Iso-Geometric Analysis (IGA). Within the GIFT framework, we describe the geometry of the structure exactly with NURBS (Non-Uniform Rational B-Splines), whilst independently employing Polynomial splines over Hierarchical T-meshes (PHT)-splines to represent the solution field. The proposed strategy of local adaptivity, wherein a posteriori error estimators are computed based on inexpensive hierarchical $h-$refinement, aims to control the discretisation error within a frequency band. The approach sweeps from lower to higher frequencies, refining the mesh appropriately so that each of the free vibration mode within the targeted frequency band is sufficiently resolved. Through several numerical examples, we show that the GIFT framework is a powerful and versatile tool to perform local adaptivity in structural dynamics. We also show that the proposed adaptive local $h-$refinement scheme allows us to achieve significantly faster convergence rates than when using a uniform $h-$refinement.

In this paper, we propose a novel unfitted finite element method for the simulation of multiple body contact. The computational mesh is generated independently of the geometry of the interacting solids, which can be arbitrarily complex. The key novelty of the approach is the combination of elements of the CutFEM technology, namely the enrichment of the solution field via the definition of overlapping fictitious domains with a dedicated penalty-type regularisation of discrete operators, and the LaTIn hybrid-mixed formulation of complex interface conditions. Furthermore, the novel P1-P1 discretisation scheme that we propose for the unfitted LaTIn solver is shown to be stable, robust and optimally convergent with mesh refinement. Finally, the paper introduces a high-performance 3D level-set/CutFEM framework for the versatile and robust solution of contact problems involving multiple bodies of complex geometries, with more than two bodies interacting at a single point.

Simplifying the geometry of a CAD model using defeaturing techniques enables more efficient discretisation and subsequent simulation for engineering analysis problems. Understanding the effect this simplification has on the solution helps to decide whether the simplification is suitable for a specific simulation problem. It can also help to understand the functional effect of a geometry feature. The effect of the simplification is quantified by a user-defined quantity of interest which is assumed to be (approximately) linear in the solution. A bound on the difference between the quantity of interest of the original and simplified solutions based on the energy norm is derived. The approach is presented in the context of electrostatics problems, but can be applied in general to a range of elliptic partial differential equations. Numerical results on the efficiency of the bound are provided for electrostatics problems with simplifications involving changes inside the problem domain as well as changes to the boundaries., Comment: 32 pages, 21 figures

A Nitche's method is presented to couple different mechanical models. They include coupling of a solid and a beam and of a solid and a plate. Both conforming and non-conforming formulations are presented. In a non-conforming for- mulation, the structure domain is overlapped by a refined solid model. Applications can be found in multi-dimensional analyses in which parts of a structure are modeled with solid elements and others are modeled using a coarser model with beam and/or plate elements. Discretisations are performed using both standard Lagrange elements and high order NURBS (Non Uniform Rational Bsplines) based isogeometric elements. We present various examples to demonstrate the performance of the method., Comment: 41 pages, 34 figures

Goal oriented error estimation and adaptive procedures are essential for the accurate and efficient evaluation of numerical simulations that involve complex domains. By locally improving the approximation quality we can solve expensive problems which could result intractable otherwise. Here, we present an error estimation technique for enriched finite element approximations that is based on an equilibrated recovery technique, which considers the stress intensity factor as the quantity of interest. The locally equilibrated superconvergent patch recovery is used to obtain enhanced stress fields for the primal and dual problems defined to evaluate the error estimate., Comment: arXiv admin note: text overlap with arXiv:1209.3102

A Nitche's method is presented to couple non-conforming two and three dimensional NURBS (Non Uniform Rational B-splines) patches in the context of isogeometric analysis (IGA). We present results for elastic stress analyses under the static condition of two and three dimensional NURBS geometries. The contribution fills the gap in the literature and enlarges the applicability of NURBS-based isogeometric analysis.

In this paper, we study numerically the linear damped second-order hyperbolic partial differential equation (PDE) with affine parameter dependence using a goal-oriented approach by finite element (FE) and reduced basis (RB) methods. The main contribution of this paper is the "goal-oriented" proper orthogonal decomposition (POD)-Greedy sampling procedure within the RB approximation context. First, we introduce the RB recipe: Galerkin projection onto a space $Y_N$ spanned by solutions of the governing PDE at $N$ selected points in parameter space. This set of $N$ parameter points is constructed by the standard POD-Greedy sampling procedure already developed. Second, based on the affine parameter dependence, we make use of the offline-online computational procedures: in the offline stage, we generate the RB space; in the online stage, given a new parameter value, we calculate rapidly and accurately the space-time RB output of interest and its associated asymptotic error. The proposed goal-oriented POD-Greedy sampling procedure can now be implemented and will look for the parameter points such that it minimizes this (asymptotic) output error rather than the solution error (or, error indicator which is the dual norm of residual) as in the standard POD-Greedy procedure. Numerical results show that the new goal-oriented POD-Greedy sampling procedure improves significantly the accuracy of the space-time output computation in comparison with the standard POD-Greedy one. The method is thus ideally suited for repeated, rapid and reliable evaluation of input-output relationships within the space-time setting.

In this paper, we extend the reduced-basis methods developed earlier for wave equations to goal-oriented wave equations with affine parameter dependence. The essential new ingredient is the dual (or adjoint) problem and the use of its solution in a sampling procedure to pick up "goal-orientedly" parameter samples. First, we introduce the reduced-basis recipe --- Galerkin projection onto a space $Y_N$ spanned by the reduced basis functions which are constructed from the solutions of the governing partial differential equation at several selected points in parameter space. Second, we propose a new "goal-oriented" Proper Orthogonal Decomposition (POD)--Greedy sampling procedure to construct these associated basis functions. Third, based on the assumption of affine parameter dependence, we use the offline-online computational procedures developed earlier to split the computational procedure into offline and online stages. We verify the proposed computational procedure by applying it to a three-dimensional simulation dental implant problem. The good numerical results show that our proposed procedure performs better than the standard POD--Greedy procedure in terms of the accuracy of output functionals.

Isogeometric cohesive elements are presented for modeling two and three dimensional delaminated composite structures. We exploit the knot insertion algorithm offered by NURBS (Non Uniform Rational B-splines) to generate cohesive elements along delamination planes in an automatic fashion. A complete computational framework is presented including pre-processing, processing and post-processing. They are explained in details and implemented in MIGFEM--an open source Matlab Isogemetric Analysis code developed by the authors. The composite laminates are modeled using both NURBS solid and shell elements. Several two and three dimensional examples ranging from standard delamination tests (the mixed mode bending test), the L-shaped specimen with a fillet, three dimensional (3D) double cantilever beam and a 3D singly curved thick-walled laminate are provided. To the authors' knowledge, it is the first time that NURBS-based isogeometric analysis for two/three dimensional delamination modeling is presented. For all examples considered, the proposed framework outperforms conventional Lagrange finite elements.

This paper deals with the parallel simulation of delamination problems at the meso-scale by means of multi-scale methods, the aim being the Virtual Delamination Testing of Composite parts. In the non-linear context, Domain Decomposition Methods are mainly used as a solver for the tangent problem to be solved at each iteration of a Newton-Raphson algorithm. In case of strongly nonlinear and heterogeneous problems, this procedure may lead to severe difficulties. The paper focuses on methods to circumvent these problems, which can now be expressed using a relatively general framework, even though the different ingredients of the strategy have emerged separately. We rely here on the micro-macro framework proposed in (Ladev\`eze, Loiseau, and Dureisseix, 2001). The method proposed in this paper introduces three additional features: (i) the adaptation of the macro-basis to situations where classical homogenization does not provide a good preconditioner, (ii) the use of non-linear relocalization to decrease the number of global problems to be solved in the case of unevenly distributed non-linearities, (iii) the adaptation of the approximation of the local Schur complement which governs the convergence of the proposed iterative technique. Computations of delamination and delamination-buckling interaction with contact on potentially large delaminated areas are used to illustrate those aspects.

In this paper, we propose upper and lower error bounding techniques for reduced order modelling applied to the computational homogenisation of random composites. The upper bound relies on the construction of a reduced model for the stress field. Upon ensuring that the reduced stress satisfies the equilibrium in the finite element sense, the desired bounding property is obtained. The lower bound is obtained by defining a hierarchical enriched reduced model for the displacement. We show that the sharpness of both error estimates can be seamlessly controlled by adapting the parameters of the corresponding reduced order model.

During the last decade there has been an increase on the use of goal-oriented error estimates which help to quantify and control the local error on a quantity of interest (QoI) that might result relevant for design purposes (e.g. the mean stress or mean displacement in a particular area, the stress intensity factor for fracture problems,...). Residual-based error estimators have been used to estimate the error in quantities of interest for finite element approximations. This work presents a recovery-based error estimation technique for QoI whose main characteristic is the use of an enhanced version of the Superconvergent Patch Recovery (SPR) technique developed by Zienkiewicz and Zhu. This enhanced version of the SPR technique, used to recover the primal and dual solutions, provides a nearly statically admissible stress field that results in accurate estimations of the error in the QoI., Comment: in Computational Mechanics

We propose in this paper an adaptive reduced order modelling technique based on domain partitioning for parametric problems of fracture. We show that coupling domain decomposition and projection-based model order reduction permits to focus the numerical effort where it is most needed: around the zones where damage propagates. No \textit{a priori} knowledge of the damage pattern is required, the extraction of the corresponding spatial regions being based solely on algebra. The efficiency of the proposed approach is demonstrated numerically with an example relevant to engineering fracture., Comment: Submitted for publication in CMAME

We propose to identify process zones in heterogeneous materials by tailored statistical tools. The process zone is redefined as the part of the structure where the random process cannot be correctly approximated in a low-dimensional deterministic space. Such a low-dimensional space is obtained by a spectral analysis performed on pre-computed solution samples. A greedy algorithm is proposed to identify both process zone and low-dimensional representative subspace for the solution in the complementary region. In addition to the novelty of the tools proposed in this paper for the analysis of localised phenomena, we show that the reduced space generated by the method is a valid basis for the construction of a reduced order model., Comment: Submitted for publication in International Journal for Multiscale Computational Engineering

Purpose: This paper aims at assessing the effect of (1) the statical admissibility of the recovered solution; (2) the ability of the recovered solution to represent the singular solution; on the accuracy, local and global effectivity of recovery-based error estimators for enriched finite element methods (e.g. the extended finite element method, XFEM). Design/methodology/approach: We study the performance of two recovery techniques. The first is a recently developed superconvergent patch recovery procedure with equilibration and enrichment (SPR-CX). The second is known as the extended moving least squares recovery (XMLS), which enriches the recovered solutions but does not enforce equilibrium constraints. Both are extended recovery techniques as the polynomial basis used in the recovery process is enriched with singular terms for a better description of the singular nature of the solution. Findings: Numerical results comparing the convergence and the effectivity index of both techniques with those obtained without the enrichment enhancement clearly show the need for the use of extended recovery techniques in Zienkiewicz-Zhu type error estimators for this class of problems. The results also reveal significant improvements in the effectivities yielded by statically admissible recovered solutions. Originality/value: This work shows that both extended recovery procedures and statical admissibility are key to an accurate assessment of the quality of enriched finite element approximations., Comment: Submitted to Engineering Computations

This paper presents a three-scale computational strategy for the study of composite modeled at the mesoscale so that delamination can be reliably simulated. The solver is based on a LaTIn approach so that nonlinearities can be tackled at the local scale. We show how search directions which are parameters of the method need to be updated according to the delamination status of interfaces. We also present the parallelization of the macro problem which transmits long-range phenomena and warranty the scalabilty of the method; this parallelization is based on the balancing domain decomposition method, it leads to the introduction of a third (super-macro) scale., Comment: Multiscale Methods in Computational Mechanics -- Progress and Accomplishments, Ren\'e de Borst and Ekkehard Ramm (Ed.)

The prediction of the quasi-static response of industrial laminate structures requires to use fine descriptions of the material, especially when debonding is involved. Even when modeled at the mesoscale, the computation of these structures results in very large numerical problems. In this paper, the exact mesoscale solution is sought using parallel iterative solvers. The LaTIn-based mixed domain decomposition method makes it very easy to handle the complex description of the structure; moreover the provided multiscale features enable us to deal with numerical difficulties at their natural scale; we present the various enhancements we developed to ensure the scalability of the method. An extension of the method designed to handle instabilities is also presented.

In quasi-static nonlinear time-dependent analysis, the choice of the time discretization is a complex issue. The most basic strategy consists in determining a value of the load increment that ensures the convergence of the solution with respect to time on the base of preliminary simulations. In more advanced applications, the load increments can be controlled for instance by prescribing the number of iterations of the nonlinear resolution procedure, or by using an arc-length algorithm. These techniques usually introduce a parameter whose correct value is not easy to obtain. In this paper, an alternative procedure is proposed. It is based on the continuous control of the residual of the reference problem over time, whose measure is easy to interpret. This idea is applied in the framework of a multiscale domain decomposition strategy in order to perform 3D delamination analysis.

In this article, we present numerical enhancements of a multiscale domain decomposition strategy based on a LaTIn solver and dedicated to the computation of the debounding in laminates. We show that the classical scale separation is irrelevant in the process zones, which results in a drop in the convergence rate of the strategy. The scalability is restored by performing nonlinear subresolutions in the vincinity of the front of the crack, at each prediction stage of the iterative solver.

This article describes a bridge between POD-based model order reduction techniques and the classical Newton/Krylov solvers. This bridge is used to derive an efficient algorithm to correct, "on-the-fly", the reduced order modelling of highly nonlinear problems undergoing strong topological changes. Damage initiation problems are addressed and tackle via a corrected hyperreduction method. It is shown that the relevancy of reduced order model can be significantly improved with reasonable additional costs when using this algorithm, even when strong topological changes are involved.

This paper proposes a novel technique to reduce the computational burden associated with the simulation of localised failure. The proposed methodology affords the simulation of damage initiation and propagation whilst concentrating the computational effort where it is most needed, i.e. in the localisation zones. To do so, a local/global technique is devised where the global (slave) problem (far from the zones undergoing severe damage and cracking) is solved for in a reduced space computed by the classical Proper Orthogonal Decomposition, while the local (master) degrees of freedom (associated with the part of the structure where most of the damage is taking place) are fully resolved. Both domains are coupled through a local/global technique. This method circumvents the difficulties associated with model order reduction for the simulation of highly non-linear mechanical failure and offers an alternative or complementary approach to the development of multiscale fracture simulators., Comment: International Journal for Numerical Methods in Engineering (2011) online