The nsBETI method: an extension of the FETI method to non‐symmetrical BEM‐FEM coupled problems

The finite element tearing and interconnecting (FETI) method is recognized as an effective domain decomposition tool to achieve scalability in the solution of partitioned second‐order elasticity problems. In the boundary element tearing and interconnecting (BETI) method, a direct extension of the FETI algorithm to the BEM, the symmetric Galerkin BEM formulation, is used to obtain symmetric system matrices, making possible to apply the same FETI conjugate gradient solver. In this work, we propose a new BETI variant labeled nsBETI that allows to couple substructures modeled with the FEM and/or non‐symmetrical BEM formulations. The method connects non‐matching BEM and FEM subdomains using localized Lagrange multipliers and solves the associated non‐symmetrical flexibility equations with a Bi‐CGstab iterative algorithm. Scalability issues of nsBETI in BEM–BEM and combined BEM–FEM coupled problems are also investigated. Copyright © 2012 John Wiley & Sons, Ltd.     

An algebraically partitioned FETI method for parallel structural analysis: algorithm description

An algebraically partitioned FETI method for the solution of structural engineering problems on parallel computers is presented. The present algorithm consists of three attributes: an explicit generation of the orthogonal null-space matrix associated with the interface nodal forces, the floating subdomain rigid-body modes computed from the subdomain static equilibrium equation of the classical force method and the identification of redundant interface force constraint operator that emanates when the interface force computations are localized. Comparisons of the present method with the previously developed differentially partitioned FETI method are offered in terms of the saddle-point formulations at the end of the paper. A companion paper reports implementation details and numerical performance of the proposed algorithm. © 1997 John Wiley & Sons, Ltd.     

Domain decomposition methods for parallel solution of shape sensitivity analysis problems

This paper presents the implementation of advanced domain decomposition techniques for parallel solution of large‐scale shape sensitivity analysis problems. The methods presented in this study are based on the FETI method proposed by Farhat and Roux which is a dual domain decomposition implementation. Two variants of the basic FETI method have been implemented in this study: (i) FETI‐1 where the rigid‐body modes of the floating subdomains are computed explicitly. (ii) FETI‐2 where the local problem at each subdomain is solved by the PCG method and the rigid‐body modes are computed explicitly. A two‐level iterative method is proposed particularly tailored to solve re‐analysis type of problems, where the dual domain decomposition method is incorporated in the preconditioning step of a subdomain global PCG implementation. The superiority of this two‐level iterative solver is demonstrated with a number of numerical tests in serial as well as in parallel computing environments. Copyright © 1999 John Wiley & Sons, Ltd.     

A FETI‐DP method for the parallel iterative solution of indefinite and complex‐valued solid and shell vibration problems

The dual‐primal finite element tearing and interconnecting (FETI‐DP) domain decomposition method (DDM) is extended to address the iterative solution of a class of indefinite problems of the form ( K ?σ² M ) u = f , and a class of complex problems of the form ( K ?σ² M +iσ D ) u = f , where K , M , and D are three real symmetric matrices arising from the finite element discretization of solid and shell dynamic problems, i is the imaginary complex number, and σ is a real positive number. A key component of this extension is a new coarse problem based on the free‐space solutions of Navier's equations of motion. These solutions are waves, and therefore the resulting DDM is reminiscent of the FETI‐H method. For this reason, it is named here the FETI‐DPH method. For a practically large σ range, FETI‐DPH is shown numerically to be scalable with respect to all of the problem size, substructure size, and number of substructures. The CPU performance of this iterative solver is illustrated on a 40‐processor computing system with the parallel solution, for various σ ranges, of several large‐scale, indefinite, or complex‐valued systems of equations associated with shifted eigenvalue and forced frequency response structural dynamics problems. Copyright © 2005 John Wiley & Sons, Ltd.     

A domain decomposition method for discontinuous Galerkin discretizations of Helmholtz problems with plane waves and Lagrange multipliers

A nonoverlapping domain decomposition (DD) method is proposed for the iterative solution of systems of equations arising from the discretization of Helmholtz problems by the discontinuous enrichment method. This discretization method is a discontinuous Galerkin finite element method with plane wave basis functions for approximating locally the solution and dual Lagrange multipliers for weakly enforcing its continuity over the element interfaces. The primal subdomain degrees of freedom are eliminated by local static condensations to obtain an algebraic system of equations formulated in terms of the interface Lagrange multipliers only. As in the FETI‐H and FETI‐DPH DD methods for continuous Galerkin discretizations, this system of Lagrange multipliers is iteratively solved by a Krylov method equipped with both a local preconditioner based on subdomain data, and a global one using a coarse space. Numerical experiments performed for two‐ and three‐dimensional acoustic scattering problems suggest that the proposed DD‐based iterative solver is scalable with respect to both the size of the global problem and the number of subdomains. Copyright © 2009 John Wiley & Sons, Ltd.     

Hybrid time domain solvers for the Maxwell equations in 2D

We present a new approach to time domain hybrid schemes for the Maxwell equations. By combining the classical FD‐TD scheme with two unstructured solvers, one explicit finite volume solver and one implicit finite element solver, we achieve a very efficient and flexible second‐order scheme. The second‐order accuracy of the hybrid scheme is verified through convergence studies on perfectly conducting as well as dielectric and diamagnetic circular cylinders. The numerical results also show its superiority to the FD‐TD scheme. Copyright © 2002 John Wiley & Sons, Ltd.     

Theoretical comparison of the FETI and algebraically partitioned FETI methods,and performance comparisons with a direct sparse solver

In this paper, we prove that the Algebraic A‐FETI method corresponds to one particular instance of the original one‐level FETI method. We also report on performance comparisons on an Origin 2000 between the one‐ and two‐level FETI methods and an optimized sparse solver, for two industrial applications: the stress analysis of a thin shell structure, and that of a three‐dimensional structure modelled by solid elements. These comparisons suggest that for topologically two‐dimensional problems, sparse solvers are effective when the number of processors is relatively small. They also suggest that for three‐dimensional applications, scalable domain decomposition methods such as FETI deliver a superior performance on both sequential and parallel hardware configurations. Copyright © 1999 John Wiley & Sons, Ltd.     

A scalable Lagrange multiplier based domain decomposition method for time-dependent problems

We present a new efficient and scalable domain decomposition method for solving implicitly linear and non-linear time-dependent problems in computational mechanics. The method is derived by adding a coarse problem to the recently proposed transient FETI substructuring algorithm in order to propagate the error globally and accelerate convergence. It is proved that in the limit for large time steps, the new method converges toward the FETI algorithm for time-independent problems. Computational results confirm that the optimal convergence properties of the time-independent FETI method are preserved in the time-dependent case. We employ an iterative scheme for solving efficiently the coarse problem on massively parallel processors, and demonstrate the effective scalability of the new transient FETI method with the large-scale finite element dynamic analysis on the Paragon XP/S and IBM SP2 systems of several diffraction grating finite element structural models. We also show that this new domain decomposition method outperforms the popular direct skyline solver. The coarse problem presented herein is applicable and beneficial to a large class of Lagrange multiplier based substructuring algorithms for time-dependent problems, including the fictitious domain decomposition method.     

Finite calculus formulation for incompressible solids using linear triangles and tetrahedra

Many finite elements exhibit the so‐called ‘volumetric locking’ in the analysis of incompressible or quasi‐incompressible problems.In this paper, a new approach is taken to overcome this undesirable effect. The starting point is a new setting of the governing differential equations using a finite calculus (FIC) formulation. The basis of the FIC method is the satisfaction of the standard equations for balance of momentum (equilibrium of forces) and mass conservation in a domain of finite size and retaining higher order terms in the Taylor expansions used to express the different terms of the differential equations over the balance domain. The modified differential equations contain additional terms which introduce the necessary stability in the equations to overcome the volumetric locking problem. The FIC approach has been successfully used for deriving stabilized finite element and meshless methods for a wide range of advective–diffusive and fluid flow problems. The same ideas are applied in this paper to derive a stabilized formulation for static and dynamic finite element analysis of incompressible solids using linear triangles and tetrahedra. Examples of application of the new stabilized formulation to linear static problems as well as to the semi‐implicit and explicit 2D and 3D non‐linear transient dynamic analysis of an impact problem and a bulk forming process are presented. Copyright © 2004 John Wiley & Sons, Ltd.     

An implicit–explicit solution method for electro‐osmotic flow through three‐dimensional micro‐channels

This paper presents a comprehensive finite‐element modelling approach to electro‐osmotic flows on unstructured meshes. The non‐linear equation governing the electric potential is solved using an iterative algorithm. The employed algorithm is based on a preconditioned GMRES scheme. The linear Laplace equation governing the external electric potential is solved using a standard pre‐conditioned conjugate gradient solver. The coupled fluid dynamics equations are solved using a fractional step‐based, fully explicit, artificial compressibility scheme. This combination of an implicit approach to the electric potential equations and an explicit discretization to the Navier–Stokes equations is one of the best ways of solving the coupled equations in a memory‐efficient manner. The local time‐stepping approach used in the solution of the fluid flow equations accelerates the solution to a steady state faster than by using a global time‐stepping approach. The fully explicit form and the fractional stages of the fluid dynamics equations make the system memory efficient and free of pressure instability. In addition to these advantages, the proposed method is suitable for use on both structured and unstructured meshes with a highly non‐uniform distribution of element sizes. The accuracy of the proposed procedure is demonstrated by solving a basic micro‐channel flow problem and comparing the results against an analytical solution. The comparisons show excellent agreement between the numerical and analytical data. In addition to the benchmark solution, we have also presented results for flow through a fully three‐dimensional rectangular channel to further demonstrate the application of the presented method. Copyright © 2007 John Wiley & Sons, Ltd.     

Fast Computation of Stationary Inviscid Flow Around an Airfoil

The parallel performance of an implicit solver for the Euler equations on a structured grid is discussed. The flow studied is a two-dimensional transonic flow around an airfoil. The spatial discretization involves the MUSCL scheme, a higher-order Total Variation Diminishing scheme. The solver described in this paper is an implicit solver that is based on quasi Newton iteration and approximate factorization to solve the linear system of equations resulting from the Euler Backward scheme. It is shown that the implicit time-stepping method can be used as a smoother to obtain an efficient and stable multigrid process. Also, the solver has good properties for parallelization comparable with explicit time-stepping schemes. To preserve data locality domain decomposition is applied to obtain a parallelizable code. Although the domain decomposition slightly affects the efficiency of the approximate factorization method with respect to the number of time steps required to attain the stationary solution, the results show that this hardly affects the performance for practical purposes. The accuracy with which the linear system of equations is solved is found to be an important parameter. Because the method is equally applicable for the Navier-Stokes equations and in three-dimensions, the presented combination of efficient parallel execution and implicit time-integration provides an interesting perspective for time-dependent problems in computational fluid dynamics.     

A FETI‐based domain decomposition technique for time‐dependent first‐order systems based on a DAE approach

We present a novel partitioned coupling algorithm to solve first‐order time‐dependent non‐linear problems (e.g. transient heat conduction). The spatial domain is partitioned into a set of totally disconnected subdomains. The continuity conditions at the interface are modeled using a dual Schur formulation where the Lagrange multipliers represent the interface fluxes (or the reaction forces) that are required to maintain the continuity conditions. The interface equations along with the subdomain equations lead to a system of differential algebraic equations (DAEs). For the resulting equations a numerical algorithm is developed, which includes choosing appropriate constraint stabilization techniques. The algorithm first solves for the interface Lagrange multipliers, which are subsequently used to advance the solution in the subdomains. The proposed coupling algorithm enables arbitrary numeric schemes to be coupled with different time steps (i.e. it allows subcycling) in each subdomain. This implies that existing software and numerical techniques can be used to solve each subdomain separately. The coupling algorithm can also be applied to multiple subdomains and is suitable for parallel computers. We present examples showing the feasibility of the proposed coupling algorithm. Copyright © 2008 John Wiley & Sons, Ltd.     

Iterative solution of large‐scale acoustic scattering problems with multiple right hand‐sides by a domain decomposition method with Lagrange multipliers

An extension of the FETI‐H method is designed for the solution of acoustic scattering problems with multiple right‐hand sides. A new local pre‐conditioning of this domain decomposition method is also presented. The potential of the resulting iterative solver is demonstrated by numerical experiments for two‐dimensional problems with high wavenumbers, as many as 2.5 million complex degrees of freedom, and a sweep on the angle of the incident wave. Preliminary results for a three‐dimensional submarine problem are also included. The FETI‐H method, whose numerical scalability with respect to the mesh and subdomain sizes was previously established, is shown here to be also numerically scalable with respect to the wavenumber. Copyright © 2001 John Wiley & Sons, Ltd.     

A dual‐primal FETI method for solving a class of fluid–structure interaction problems in the frequency domain

The dual‐primal finite element tearing and interconnecting method (FETI‐DP) is extended to systems of linear equations arising from a finite element discretization for a class of fluid–structure interaction problems in the frequency domain. A preconditioned generalized minimal residual method is used to solve the linear equations for the Lagrange multipliers introduced on the subdomain boundaries to enforce continuity of the solution. The coupling between the fluid and the structure on the fluid–structure interface requires an appropriate choice of coarse level degrees of freedom in the FETI‐DP algorithm to achieve fast convergence. Several choices are proposed and tested by numerical experiments on three‐dimensional fluid–structure interaction problems in the mid‐frequency regime that demonstrate the greatly improved performance of the proposed algorithm over the standard FETI‐DP method. Copyright © 2011 John Wiley & Sons, Ltd.     

Explicit multistep time integration for discontinuous elastic stress wave propagation in heterogeneous solids

A multistep explicit time integration algorithm is presented for tracking the propagation of discontinuous stress waves in heterogeneous solids whose subdomain-to-subdomain critical time step ratios range from tens to thousands. The present multistep algorithm offers efficient and accurate computations for tracking discontinuous waves propagating through such heterogeneous solids. The present algorithm, first, employs the partitioned formulation for representing each subdomain, whose interface compatibility is enforced via the method of the localized Lagrange multipliers. Second, for each subdomain, the governing equations of motion are decomposed into the extensional and shear components so that tracking of waves of different propagation speeds is treated with different critical step sizes to significantly reduce the computational dispersion errors. Stability and accuracy analysis of the present multistep time integration is performed with one-dimensional heterogeneous bar. Analyses of the present algorithm are also demonstrated as applied to the stress wave propagation in one-dimensional heterogeneous bar and in heterogeneous plain strain problems.     

Fourth‐order energy‐preserving locally implicit time discretization for linear wave equations

A family of fourth‐order coupled implicit–explicit time schemes is presented as a special case of fourth‐order coupled implicit schemes for linear wave equations. The domain of interest is decomposed into several regions where different fourth‐order time discretizations are used, chosen among a family of implicit or explicit fourth‐order schemes. The coupling is based on a Lagrangian formulation on the boundaries between the several non‐conforming meshes of the regions. A global discrete energy is shown to be preserved and leads to global fourth‐order consistency in time. Numerical results in 1D and 2D for the acoustic and elastodynamics equations illustrate the good behavior of the schemes and their potential for the simulation of realistic highly heterogeneous media or strongly refined geometries, for which using everywhere an explicit scheme can be extremely penalizing. Accuracy up to fourth order reduces the numerical dispersion inherent to implicit methods used with a large time step and makes this family of schemes attractive compared with second‐order accurate methods. Copyright © 2015 John Wiley & Sons, Ltd.     

Scalable TFETI algorithm for the solution of multibody contact problems of elasticity

A Total FETI (TFETI)‐based domain decomposition algorithm with preconditioning by a natural coarse grid of the rigid body motions is adapted to the solution of multibody contact problems of elasticity in 2D and 3D and proved to be scalable. The algorithm finds an approximate solution at the cost asymptotically proportional to the number of variables provided the ratio of the decomposition parameter and the discretization parameter is bounded. The analysis is based on the classical results by Farhat, Mandel, and Roux on scalability of FETI with a natural coarse grid for linear problems and on our development of optimal quadratic programming algorithms for bound and equality constrained problems. The algorithm preserves parallel scalability of the classical FETI method. Both theoretical results and numerical experiments indicate a high efficiency of our algorithm. In addition, its performance is illustrated on a real‐world problem of analysis of the ball bearing. Copyright © 2009 John Wiley & Sons, Ltd.     

A transient FETI methodology for large-scale parallel implicit computations in structural mechanics

We present a domain decomposition method for implicit schemes that requires significantly less storage than factorization algorithms, that is several times faster than other popular direct and iterative methods, that can be easily implemented on both shared and local memory parallel processors, and that is both computationally and communication-wise efficient. The proposed transient domain decomposition method is an extension of the method of Finite Element Tearing and Interconnecting (FETI) developed by Farhat and Roux for the solution of static problems. Serial and parallel performance results on the CRAY Y-MP/8 and the iPSC-860/128 systems are reported and analyzed for realistic structural dynamics problems. These results establish the superiority of the FETI method over both the serial/parallel conjugate gradient algorithm with diagonal scaling and the serial/parallel direct method, and contrast the computational power of the iPSC-860/128 parallel processor with that of the CRAY Y-MP/8 system.     

板料成形数值模拟有限元求解算法

正确选用有限元求解算法是成形模拟成功的关键技术之一。阐述了板料成形数值模拟的4种有限元求解算法,即静力隐式算法、动力显式算法、静力显式算法和一步成形法,并对这4种算法进行了论述和比较,介绍了其在实际中的应用,探讨了在板料成形模拟中如何选择有限元算法进行可靠、高效的有限元分析。