A fictitious domain decomposition method for the solution of partially axisymmetric acoustic scattering problems. Part 2: Neumann boundary conditions

We present a fictitious domain decomposition method for the fast solution of acoustic scattering problems characterized by a partially axisymmetric sound‐hard scatterer. We apply this method to the solution of a mock‐up submarine problem, and highlight its computational advantages and intrinsic parallelism. A key component of our method is an original idea for addressing a Neumann boundary condition in the general framework of a fictitious domain method. This idea is applicable to many other linear partial differential equations besides the Helmholtz equation. Copyright © 2003 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 numerically scalable domain decomposition method for the solution of frictionless contact problems

We present a domain decomposition method with Lagrange multipliers for solving iteratively frictionless contact problems. This method, which is based on the FETI method and therefore is named here the FETI‐C method, incorporates a coarse contact system that guides the iterative prediction of the active zone of contact. We demonstrate numerically that this method is numerically scalable with respect to both the problem size and the number of subdomains. Copyright © 2001 John Wiley & Sons, Ltd.     

Iteratively-improved Robin boundary conditions for the finite element solution of scattering problems in unbounded domains

An iterative procedure is described for the finite-element solution of scalar scattering problems in unbounded domains. The scattering objects may have multiple connectivity, may be of different materials or with different boundary conditions. A fictitious boundary enclosing all the objects involved is introduced. An appropriate Robin (mixed) condition is initially guessed on this boundary and is iteratively improved making use of Green's formula. It will be seen that the best choice for the Robin boundary condition is an absorbing-like one. A theorem about the theoretical convergence of the procedure is demonstrated. An analytical study of the special case of a circular cylindrical scatterer is made. Comparisons are made with other methods. Some numerical examples are provided in order to illustrate and validate the procedure and to show its applicability whatever the frequency of the incident wave. Although particular emphasis is laid in the paper on electromagnetic problems, the procedure is fully applicable to other kinds of physical phenomena such as acoustic ones. © 1998 John Wiley & Sons, Ltd.     

A fictitious domain method for the simulation of thermoelastic deformations in NC‐milling processes

This paper presents a (higher‐order) finite element approach for the simulation of heat diffusion and thermoelastic deformations in NC‐milling processes. The inherent continuous material removal in the process of the simulation is taken into account via continuous removal‐dependent refinements of a paraxial hexahedron base‐mesh covering a given workpiece. These refinements rely on isotropic bisections of these hexahedrons along with subdivisions of the latter into tetrahedrons and pyramids in correspondence to a milling surface triangulation obtained from the application of the marching cubes algorithm. The resulting mesh is used for an element‐wise defined characteristic function for the milling‐dependent workpiece within that paraxial hexahedron base‐mesh. Using this characteristic function, a (higher‐order) fictitious domain method is used to compute the heat diffusion and thermoelastic deformations, where the corresponding ansatz spaces are defined for some hexahedron‐based refinement of the base‐mesh. Numerical experiments compared to real physical experiments exhibit the applicability of the proposed approach to predict deviations of the milled workpiece from its designed shape because of thermoelastic deformations in the process.     

The multiblock method. A new strategy based on domain decomposition for the solution of wave propagation problems

A novel single‐step domain decomposition technique for the elastic wave propagation problem is introduced in this paper, based on the Huygens principle. The method allows an effective and efficient implementation on parallel computers through coarse‐grain multiprocessor computations. The various tests and numerical examples let infer that it is very competitive in comparison with classic substructuring techniques, specially for implicit discretization schemes. Copyright © 2000 John Wiley & Sons, Ltd.     

求解水下非圆弹性环声散射问题的一种半解析方法

基于传递矩阵法、齐次扩容精细积分法和复数矢径虚拟边界谱方法 ,提出了一种求解水下非圆弹性环声散射问题的半解析方法。该方法具有以下几个优点 :(1)采用复数矢径虚拟边界谱方法 ,不仅能保证在全波数域内Helmholtz外问题解的唯一性 ,而且由于虚拟源强密度函数采用 Fourier级数展开 ,克服了用单元离散解法不能用于较高频率范围的缺点 ;(2 )采用齐次扩容精细积分法求解非圆弹性环的状态微分方程 ,其计算结果具有很高的精度 ;(3)耦合方程不需要交错迭代求解 ,提高了计算效率。文中给出了两个典型非圆弹性环在平面声波激励下的声散射算例 ,计算结果表明本文方法是一种求解二维非圆弹性环声散射问题非常有效的半解析法。     

Investigations on boundary temperature control analysis considering a moving body based on the adjoint variable and the fictitious domain finite element methods

This paper presents an examination of moving‐boundary temperature control problems. With a moving‐boundary problem, a finite‐element mesh is generated at each time step to express the position of the boundary. On the other hand, if an overlapped domain, that is, comprising foreground and background meshes, is prepared, the moving boundary problem can be solved without mesh generation at each time step by using the fictitious domain method. In this study, boundary temperature control problems with a moving boundary are formulated using the finite element, the adjoint variable, and the fictitious domain methods, and several numerical experiments are carried out. Copyright © 2015 John Wiley & Sons, Ltd.     

An adaptive quadrature-based factorization method for inverse acoustic scattering problems

We propose a novel adaptive algorithm, which generates nonuniform sampling points that automatically concentrate near the boundary of an unknown scatterer, to dramatically speed up Kirsch’s factorization method for inverse acoustic scattering problems. Built upon the widely used adaptive Simpson quadrature method, our proposed adaptive algorithm approximates the integral of an indicator function over the search domain and yields reliable and accurate reconstructions significantly faster than the standard factorization method. Numerical experiments are performed to validate the effectiveness of our proposed algorithm and make comparisons with the established multilevel linear sampling method.     

A dual domain decomposition method for finite element digital image correlation

The computational burden associated to finite element based digital image correlation methods is mostly due to the inversion of finite element systems and to image interpolations. A non‐overlapping dual domain decomposition method is here proposed to rationalise the computational cost of high resolution finite element digital image correlation measurements when dealing with large images. It consists in splitting the global mesh into submeshes and the reference and deformed states images into subset images. Classic finite element digital image correlation formulations are first written in each subdomain independently. The displacement continuity at the interfaces is enforced by introducing a set of Lagrange multipliers. The problem is then condensed on the interface and solved by a conjugate gradient algorithm. Three different preconditioners are proposed to accelerate its convergence. The proposed domain decomposition method is here exemplified with real high resolution images. It is shown to combine the metrological performances of finite element based digital image correlation and the parallelisation ability of subset based methods. Copyright © 2015 John Wiley & Sons, Ltd.     

A domain decomposition method for solving thin film elliptic interface problems with variable coefficients

A domain decomposition method is developed for solving thin film elliptic interface problems with variable coefficients. In this study, the elliptic equation with variable coefficients is discretized using second‐order finite differences while a discrete interface equation is obtained using the immersed interface method in order to obtain a second‐order global accuracy. The obtained linear system is solved using a preconditioned Richardson iteration, which is shown to converge fast when the grid size in the thickness direction is much smaller than the grid sizes in both the length and width directions. To simplify the computation, a domain decomposition algorithm is obtained based on a parallel Gaussian elimination procedure. The method is illustrated by a numerical example. 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.     

Transient heat conduction under nonzero initial conditions: A solution using the boundary element method in the frequency domain

A boundary element method formulation is proposed to solve the diffusion equation under nonzero initial conditions. The problem is solved in the frequency domain, considering only the conduction phenomenon. Complex frequencies are used to avoid aliasing and to allow the computation of the static response. Two numerical examples are given to illustrate the effectiveness of this approach for solving 2-D diffusion equations.     

Analysis of frictional contact problem using boundary element method and domain decomposition method

In this paper, we study the bilateral or unilateral contact with Coulomb friction between two elastic solids, using a domain decomposition method coupled with the boundary element method. The decomposition method we have selected is the Schur complement method, a non‐overlapping technique. It enables to reduce the solution of the global problem to the solution of a problem defined only on the contact surface. Moreover, its principal advantage is that computing is done separately on each solid. We have chosen to associate it with the boundary element method. Indeed, it only requires the discretization of the boundaries of solids. This technique of coupling reduces the number of unknowns and the time of computing. We have applied it to the study of indentation of an elastic foundation by an elastic flat punch and a sphere. In this last case, our results are in conformity with the Hertz theory and the analytical solution of Spence. Moreover, we have shown the influence of friction on the size of the contact radius and on the normal pressure at centre. Copyright © 1999 John Wiley & Sons, Ltd.     

A domain decomposition technique applied to the solution of the coupled electro‐mechanical problem

A domain decomposition approach for the solution of the coupled electro‐mechanical problem in dynamics is proposed. The finite element analysis of a coupled electro‐mechanical system is frequently found, for example, in the modelling and design of microsystems and may lead to a burdensome nonlinear problem solution, particularly in the dynamic case. Two versions of the algorithm are proposed: the first one, called single‐level decomposition, exploits the natural partition of the analysis domain given by the two physics to be solved; the second one, called two‐level decomposition, adds a further subdivision of each physics into subdomains. The multilevel domain decomposition strategy here proposed is shown to accurately predict the response of microsystems subjected to electro‐mechanical coupling and to allow for a significant reduction in the computational burden. Copyright © 2012 John Wiley & Sons, Ltd.     

A parallel noninvasive multiscale strategy for a mixed domain decomposition method with frictional contact

A multiscale extension for a parallel noninvasive mixed domain decomposition method is presented. After briefly exposing our noninvasive implementation of the Latin method, we present how the scalability of the algorithm is obtained by the partial verification of the constitutive law of the interfaces. We propose a new interpretation of the classical macrostrategy that imposes the overall balance of interface's forces. We also propose a new study of the macrostrategy that consists in enforcing the coarse continuity of the interfaces' displacement.     

A parallel two‐level domain decomposition based one‐shot method for shape optimization problems

A two‐level domain decomposition method is introduced for general shape optimization problems constrained by the incompressible Navier–Stokes equations. The optimization problem is first discretized with a finite element method on an unstructured moving mesh that is implicitly defined without assuming that the computational domain is known and then solved by some one‐shot Lagrange–Newton–Krylov–Schwarz algorithms. In this approach, the shape of the domain, its corresponding finite element mesh, the flow fields and their corresponding Lagrange multipliers are all obtained computationally in a single solve of a nonlinear system of equations. Highly scalable parallel algorithms are absolutely necessary to solve such an expensive system. The one‐level domain decomposition method works reasonably well when the number of processors is not large. Aiming for machines with a large number of processors and robust nonlinear convergence, we introduce a two‐level inexact Newton method with a hybrid two‐level overlapping Schwarz preconditioner. As applications, we consider the shape optimization of a cannula problem and an artery bypass problem in 2D. Numerical experiments show that our algorithm performs well on a supercomputer with over 1000 processors for problems with millions of unknowns. Copyright © 2014 John Wiley & Sons, Ltd.     

An overlapping domain decomposition method for the simulation of elastoplastic incremental forming processes

The implicit finite element (FE) simulation of incremental metal cold forming processes is still a challenging task. We introduce a dynamic, overlapping domain decomposition method to reduce the computational cost and to circumvent the need for sophisticated remeshing procedures. The two FE domains interchange information using the elastoplastic operator split and the mortar method. Copyright © 2008 John Wiley & Sons, Ltd.     

A domain decomposition method for concurrent coupling of multiscale models

Motivated by atomistic‐to‐continuum coupling, we consider a fine‐scale problem defined on a small region embedded in a much larger coarse‐scale domain and propose an efficient solution technique on the basis of the domain decomposition framework. Specifically, we develop a nonoverlapping Schwarz method with two important features: (i) the use of an efficient approximation of the Dirichlet‐to‐Neumann map for the interface conditions; and (ii) the utilization of the inherent scale separation in the solution. The paper includes a detailed formulation of the proposed interface condition, along with the illustration of its effectiveness by using simple but representative numerical experiments. Copyright © 2012 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.