Search

This paper investigates the possibilities offered by combining regularization and preconditioning by the same symmetric positive semi-definite operator when solving ill-posed problems. We study the question of the stopping criterion, and the possibility offered by Ritz eigenelements for the a posteriori filtering of the solution and the tuning of Tikhonov's weight. The method is applied as the linear solver for an optical flow estimator and it is coupled with a subspace recycling strategy.

This paper presents results and convergence study of the Global--Local Iterative Coupling through the implementation in the commercial software Abaqus making use of the co-simulation engine. A hierarchical modeling and simulation approach is often required to alleviate modeling burdens. Particular focus has been devoted here on convergence acceleration and performance optimization. Two applications in statics with nonlinear material behavior and geometrically nonlinear formulation are considered here: first a holed curved plate under traction with elastic--plastic material, then a pre-stressed bolted joint connecting two plates between each other and subjected to traction load. Three different convergence acceleration techniques are compared in terms of convergence performance and accuracy. An inexact solver strategy is proposed to improve computing time performance. The results show promising results for the coupling technology and constitute a step forward in the availability of non-intrusive multi-scale modeling capabilities for complex structures and assemblies.

We propose in this paper a Proper Generalized Decomposition (PGD) solver for reduced-order modeling of linear elastodynamic problems. It primarily focuses on enhancing the computational efficiency of a previously introduced PGD solver based on the Hamiltonian formalism. The novelty of this work lies in the implementation of a solver that is halfway between Modal Decomposition and the conventional PGD framework, so as to accelerate the fixed-point iteration algorithm. Additional procedures such that Aitken's delta-squared process and mode-orthogonalization are incorporated to ensure convergence and stability of the algorithm. Numerical results regarding the ROM accuracy, time complexity, and scalability are provided to demonstrate the performance of the new solver when applied to dynamic simulation of a three-dimensional structure.

A novel approach is being developed to introduce a parallel asynchronous implementation of non-intrusive global-local coupling. This study examines scenarios involving numerous patches, including those covering the entire structure. By leveraging asynchronous, the method aims to minimize reliance on communication, handle failures effectively, and address load imbalances. Detailed insights into the methodology are presented, accompanied by a demonstration of its performance through an academic case study.

This paper presents the first asynchronous version of the Global/Local non-invasive coupling, capable of dealing efficiently with multiple, possibly adjacent, patches. We give a new interpretation of the coupling in terms of primal domain decomposition method, and we prove the convergence of the relaxed asynchronous iteration. The asynchronous paradigm lifts many bottlenecks of the Global/Local coupling performance. We illustrate the method on several linear elliptic problems as encountered in thermal and elasticity studies.

The Global-Local non-invasive coupling is an improvement of the submodeling technique, which permits to locally enhance structure computations by introducing patches with refined models and to take into accounts all the interactions. In order to circumvent its inherently limited computational performance, we propose and implement an asynchronous version of the method. The asynchronous coupling reduces the dependency on communications, failures, and load imbalance. We present the theory and the implementation of the method in the linear case and illustrate its performance on academic cases inspired by actual industrial problems.

An asynchronous parallel version of the non-intrusive global-local coupling is implemented. The case of many patches, including those covering the entire structure, is studied. The asynchronism limits the dependency on communications, failures, and load imbalance. We detail the method and illustrate its performance in an academic case., Comment: in French language

This paper presents a parallel \PG{implementation} for the Optimal Transportation Meshfree (OTM) method on large CPU clusters. Communications are handled with the Message Passing Interface (MPI). The Recursive Coordinate Bisection (RCB) algorithm is utilized for domain decomposition and for implementing dynamic load-balancing strategy. This work involves three new concepts to reduce the computational efforts: Dynamic halo regions, Efficient data management strategies for ease of addition and deletion of nodes and material points using advanced STL container, and nearest neighborhood communication for detection of neighbors and communication. Also, Linked Cell approach has been implemented to further reduce the computational efforts. Parallel performance analysis is investigated for challenging multiphysics applications like Taylor rod impact and serrated chip formation process. Adequate scalability of parallel implementation for these applications is reported., Comment: 21 page, 18 figures

The modal analysis is revisited through the symplectic formalism, what leads to two intertwined eigenproblems. Studying the properties of the solutions, we prove that they form a canonical basis. The method is general and works even if the Hamiltonian is not the sum of the potential and kinetic energies. On this ground, we want to address the following problem: data being given in the form of one or more structural evolutions, we want to construct an approximation of the Hamiltonian from a covariant snapshot matrix and to perform a symplectic decomposition. We prove the convergence properties of the method when the time discretization is refined. If the data cloud is not enough rich, we extract the principal component of the Hamiltonian corresponding to the leading modes, allowing to perform a model order reduction for very high dimension models. The method is illustrated by a numerical example.

The purpose of this paper is to extend the non-invasive global/local iterative coupling technique [15] to the case of large structures undergoing nonlinear time-dependent evolutions at all scales. It appears that, due to the use of legacy codes, the use of different time grids at the global and local levels is mandatory in order to reach a satisfying level of precision. In this paper two strategies are proposed and compared for elastoviscoplastic models. The questions of the precision and performance of those schemes with respect to a monolithic approach is addressed. The methods are first exposed on a 2D example and then applied on a 3D part of industrial complexity.

An efficient method for solving large nonlinear problems combines Newton solvers and Domain Decomposition Methods (DDM). In the DDM framework, the boundary conditions can be chosen to be primal, dual or mixed. The mixed approach presents the advantage to be eligible for the research of an optimal interface parameter (often called impedance) which can increase the convergence rate. The optimal value for this parameter is often too expensive to be computed exactly in practice: an approximate version has to be sought for, along with a compromise between efficiency and computational cost. In the context of parallel algorithms for solving nonlinear structural mechanical problems, we propose a new heuristic for the impedance which combines short and long range effects at a low computational cost.

This paper investigates the question of the building of admissible stress field in a substructured context. More precisely we analyze the special role played by multiple points. This study leads to (1) an improved recovery of the stress field, (2) an opportunity to minimize the estimator in the case of heterogeneous structures (in the parallel and sequential case), (3) a procedure to build admissible fields for FETI-DP and BDDC methods leading to an error bound which separates the contributions of the solver and of the discretization.

Most large engineering structures are described as assemblies of plates and shells and they are computed as such using adhoc Finite Element packages. In fact their computation in 3D would be much too costly. In this framework, the connections between the parts are often modeled by means of simplified tying models. In order to improve the reliability of such simulations, we propose to apply a non-intrusive technique so as to virtually substitute the simplified connectors by a precise 3D nonlinear model, without modifying the global plate model. Moreover each computation can be conducted on independent optimized software. After a description of the method, examples are used to analyze its performance, and to draw some conclusions on the validity and limitation of both the modeling of junction by rigid connectors and the use of submodeling techniques for the estimation of the carrying capacity of bolted plates.

This article deals with the computation of guaranteed lower bounds of the error in the framework of finite element (FE) and domain decomposition (DD) methods. In addition to a fully parallel computation, the proposed lower bounds separate the algebraic error (due to the use of a DD iterative solver) from the discretization error (due to the FE), which enables the steering of the iterative solver by the discretization error. These lower bounds are also used to improve the goal-oriented error estimation in a substructured context. Assessments on 2D static linear mechanic problems illustrate the relevance of the separation of sources of error and the lower bounds' independence from the substructuring. We also steer the iterative solver by an objective of precision on a quantity of interest. This strategy consists in a sequence of solvings and takes advantage of adaptive remeshing and recycling of search directions., Comment: International Journal for Numerical Methods in Engineering, Wiley, 2016

The Variational Theory of Complex Rays (VTCR) is an indirect Trefftz method designed to study systems governed by Helmholtz-like equations. It uses wave functions to represent the solution inside elements, which reduces the dispersion error compared to classical polynomial approaches but the resulting system is prone to be ill conditioned. This paper gives a simple and original presentation of the VTCR using the discontinuous Galerkin framework and it traces back the ill-conditioning to the accumulation of eigenvalues near zero for the formulation written in terms of wave amplitude. The core of this paper presents an efficient solving strategy that overcomes this issue. The key element is the construction of a search subspace where the condition number is controlled at the cost of a limited decrease of attainable precision. An augmented LSQR solver is then proposed to solve efficiently and accurately the complete system. The approach is successfully applied to different examples., Comment: International Journal for Numerical Methods in Engineering, Wiley, 2016

This paper deals with bounding the error on the estimation of quantities of interest obtained by finite element and domain decomposition methods. The proposed bounds are written in order to separate the two errors involved in the resolution of reference and adjoint problems : on the one hand the discretization error due to the finite element method and on the other hand the algebraic error due to the use of the iterative solver. Beside practical considerations on the parallel computation of the bounds, it is shown that the interface conformity can be slightly relaxed so that local enrichment or refinement are possible in the subdomains bearing singularities or quantities of interest which simplifies the improvement of the estimation. Academic assessments are given on 2D static linear mechanic problems., Comment: Computer Methods in Applied Mechanics and Engineering, Elsevier, 2015, online preview

In order to simulate the mechanical behavior of large structures assembled from thin composite panels, we propose a coupling technique which substitutes local 3D models for the global plate model in the critical zones where plate modeling is inadequate. The transition from 3D to 2D is based on stress and displacement distributions associated with Saint-Venant problems which are precalculated automatically for a simple 3D cell. The hybrid plate/3D model is obtained after convergence of a series of iterations between a global plate model of the structure and localized 3D models of the critical zones. This technique is nonintrusive because the global calculations can be carried out using commercial software. Evaluation tests show that convergence is fast and that the resulting hybrid model is very close to a full 3D model.

This paper deals with the estimation of the distance between the solution of a static linear mechanic problem and its approximation by the finite element method solved with a non-overlapping domain decomposition method (FETI or BDD). We propose a new strict upper bound of the error which separates the contribution of the iterative solver and the contribution of the discretization. Numerical assessments show that the bound is sharp and enables us to define an objective stopping criterion for the iterative solver, Comment: Computer Methods in Applied Mechanics and Engineering (2013) online

This paper focuses on the construction of statically admissible stress fields (SA-fields) for a posteriori error estimation. In the context of verification, the recovery of such fields enables to provide strict upper bounds of the energy norm of the discretization error between the known finite element solution and the unavailable exact solution. The reconstruction is a difficult and decisive step insofar as the effectiveness of the estimator strongly depends on the quality of the SA-fields. This paper examines the strong prolongation hypothesis, which is the starting point of the Element Equilibration Technique (EET). We manage to characterize the full space of SA-fields satisfying the prolongation equation so that optimizing inside this space is possible. The computation exploits topological properties of the mesh so that implementation is easy and costs remain controlled. In this paper, we describe the new technique in details and compare it to the classical EET and to the flux-free technique for different 2D mechanical problems. The method is explained on first degree triangular elements, but we show how extensions to different elements and to 3D are straightforward., Comment: Computer Methods in Applied Mechanics and Engineering (2013) early view online

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.

This paper deals with the definition and optimization of augmentation spaces for faster convergence of the conjugate gradient method in the resolution of sequences of linear systems. Using advanced convergence results from the literature, we present a procedure based on a selection of relevant approximations of the eigenspaces for extracting, selecting and reusing information from the Krylov subspaces generated by previous solutions in order to accelerate the current iteration. Assessments of the method are proposed in the cases of both linear and nonlinear structural problems., Comment: International Journal for Numerical Methods in Engineering (2013) 24 pages

This paper investigates a computational strategy for studying the interactions between multiple through-the-width delaminations and global or local buckling in composite laminates taking into account possible contact between the delaminated surfaces. In order to achieve an accurate prediction of the quasi-static response, a very refined discretization of the structure is required, leading to the resolution of very large and highly nonlinear numerical problems. In this paper, a nonlinear finite element formulation along with a parallel iterative scheme based on a multiscale domain decomposition are used for the computation of 3D mesoscale models. Previous works by the authors already dealt with the simulation of multiscale delamination assuming small perturbations. This paper presents the formulation used to include geometric nonlinearities into this existing multiscale framework and discusses the adaptations that need to be made to the iterative process in order to ensure the rapid convergence and the scalability of the method in the presence of buckling and delamination. These various adaptations are illustrated by simulations involving large numbers of DOFs.

This paper presents a strategy for the computation of structures with repeated patterns based on domain decomposition and block Krylov solvers. It can be seen as a special variant of the FETI method. We propose using the presence of repeated domains in the problem to compute the solution by minimizing the interface error on several directions simultaneously. The method not only drastically decreases the size of the problems to solve but also accelerates the convergence of interface problem for nearly no additional computational cost and minimizes expensive memory accesses. The numerical performances are illustrated on some thermal and elastic academic problems.

This paper presents a strategy for a posteriori error estimation for substructured problems solved by non-overlapping domain decomposition methods. We focus on global estimates of the discretization error obtained through the error in constitutive relation for linear mechanical problems. Our method allows to compute error estimate in a fully parallel way for both primal (BDD) and dual (FETI) approaches of non-overlapping domain decomposition whatever the state (converged or not) of the associated iterative solver. Results obtained on an academic problem show that the strategy we propose is efficient in the sense that correct estimation is obtained with fully parallel computations; they also indicate that the estimation of the discretization error reaches sufficient precision in very few iterations of the domain decomposition solver, which enables to consider highly effective adaptive computational strategies.

The Balanced Domain Decomposition (BDD) method and the Finite Element Tearing and Interconnecting (FETI) method are two commonly used non-overlapping domain decomposition methods. Due to strong theoretical and numerical similarities, these two methods are generally considered as being equivalently efficient. However, for some particular cases, such as for structures with strong heterogeneities, FETI requires a large number of iterations to compute the solution compared to BDD. In this paper, the origin of the bad efficiency of FETI in these particular cases is traced back to poor initial estimates of the interface stresses. To improve the estimation of interface forces a novel strategy for splitting interface forces between neighboring substructures is proposed. The additional computational cost incurred is not significant. This yields a new initialization for the FETI method and restores numerical efficiency which makes FETI comparable to BDD even for problems where FETI was performing poorly. Various simple test problems are presented to discuss the efficiency of the proposed strategy and to illustrate the so-obtained numerical equivalence between the BDD and FETI solvers.

The modern design of industrial structures leads to very complex simulations characterized by nonlinearities, high heterogeneities, tortuous geometries... Whatever the modelization may be, such an analysis leads to the solution to a family of large ill-conditioned linear systems. In this paper we study strategies to efficiently solve to linear system based on non-overlapping domain decomposition methods. We present a review of most employed approaches and their strong connections. We outline their mechanical interpretations as well as the practical issues when willing to implement and use them. Numerical properties are illustrated by various assessments from academic to industrial problems. An hybrid approach, mainly designed for multifield problems, is also introduced as it provides a general framework of such approaches.

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.