A two‐level nonoverlapping Schwarz algorithm for the Stokes problem without primal pressure unknowns

A two‐level nonoverlapping Schwarz algorithm is developed for the Stokes problem. The main feature of the algorithm is that a mixed problem with both velocity and pressure unknowns is solved with a balancing domain decomposition by constraints (BDDC)‐type preconditioner, which consists of solving local Stokes problems and one global coarse problem related to only primal velocity unknowns. Our preconditioner allows to use a smaller set of primal velocity unknowns than other BDDC preconditioners without much concern on certain flux conditions on the subdomain boundaries and the inf–sup stability of the coarse problem. In the two‐dimensional case, velocity unknowns at subdomain corners are selected as the primal unknowns. In addition to them, averages of each velocity component across common faces are employed as the primal unknowns for the three‐dimensional case. By using its close connection to the Dual–primal finite element tearing and interconnecting (FETI‐DP algorithm) (SIAM J Sci Comput 2010; 32 : 3301–3322; SIAM J Numer Anal 2010; 47 : 4142–4162], it is shown that the resulting matrix of our algorithm has the same eigenvalues as the FETI‐DP algorithm except zero and one. The maximum eigenvalue is determined by H/h, the number of elements across each subdomains, and the minimum eigenvalue is bounded below by a constant, which does not depend on any mesh parameters. Convergence of the method is analyzed and numerical results are included. Copyright © 2011 John Wiley & Sons, Ltd.     

Accuracy of Galerkin finite elements for groundwater flow simulations in two and three‐dimensional triangulations

In standard finite element simulations of groundwater flow the correspondence between hydraulic head gradients and groundwater fluxes is represented by the stiffness matrix. In two‐dimensional problems the use of linear triangular elements on Delaunay triangulations guarantees a stiffness matrix of type M. This implies that the local numerical fluxes are physically consistent with Darcy's law. This condition is fundamental to avoid the occurrence of local maxima or minima, and is of crucial importance when the calculated flow field is used in contaminant transport simulations or pathline evaluation. In three spatial dimensions, the linear Galerkin approach on tetrahedra does not lead to M‐matrices even on Delaunay meshes. By interpretation of the Galerkin approach as a subdomain collocation scheme, we develop a new approach (OSC, orthogonal subdomain collocation) that is shown to produce M‐matrices in three‐dimensional Delaunay triangulations. In case of heterogeneous and anisotropic coefficients, extra mesh properties required for M‐stiffness matrices will also be discussed. Copyright © 2001 John Wiley & Sons, Ltd.     

Adaptive solution strategy for solving large systems of p-type finite element equations

A solution strategy is proposed and implemented for taking advantage of the hierarchical structure of linear equation sets arising from the p-type finite element method using a hierarchical basis function set. The algorithm dynamically branches to either direct or iterative solution methods. In. the iterative solution branch, the substructure of the finite element equation set is used to generate a lower order preconditioner for a preconditioned conjugate gradient (PCG) method. The convergence rate of the PCG algorithm is monitored to improve the heuristics used in the choice of the preconditioner. The robustness and efficiency of the method are demonstrated on a variety of three dimensional examples utilizing both hexahedral and tetrahedral mesh discretizations. This strategy has been implemented in a p-version finite element code which has been used in an industrial environment for over two years to solve mechanical design problems.     

Conservation properties of a time FE method. Part I: time‐stepping schemes for N‐body problems

In the present paper one‐step implicit integration algorithms for the N‐body problem are developed. The time‐stepping schemes are based on a Petrov–Galerkin finite element method applied to the Hamiltonian formulation of the N‐body problem. The approach furnishes algorithmic energy conservation in a natural way. The proposed time finite element method facilitates a systematic implementation of a family of time‐stepping schemes. A particular algorithm is specified by the associated quadrature rule employed for the evaluation of time integrals. The influence of various standard as well as non‐standard quadrature formulas on algorithmic energy conservation and conservation of angular momentum is examined in detail for linear and quadratic time elements. Copyright © 2000 John Wiley & Sons, Ltd.     

Use of higher‐order shape functions in the scaled boundary finite element method

The scaled boundary finite element method is a novel semi‐analytical technique, whose versatility, accuracy and efficiency are not only equal to, but potentially better than the finite element method and the boundary element method for certain problems. This paper investigates the possibility of using higher‐order polynomial functions for the shape functions. Two techniques for generating the higher‐order shape functions are investigated. In the first, the spectral element approach is used with Lagrange interpolation functions. In the second, hierarchical polynomial shape functions are employed to add new degrees of freedom into the domain without changing the existing ones, as in the p‐version of the finite element method. To check the accuracy of the proposed procedures, a plane strain problem for which an exact solution is available is employed. A more complex example involving three scaled boundary subdomains is also addressed. The rates of convergence of these examples under p‐refinement are compared with the corresponding rates of convergence achieved when uniform h‐refinement is used, allowing direct comparison of the computational cost of the two approaches. The results show that it is advantageous to use higher‐order elements, and that higher rates of convergence can be obtained using p‐refinement instead of h‐refinement. Copyright © 2005 John Wiley & Sons, Ltd.     

The position code algorithm for contact searching

A new global search method for general contact systems is developed and implemented in the DYNA3D program, along with a recent contact interface algorithm. The concept of ‘position codes’ for efficient global contact searching is presented. With the position code algorithm, the problem of sorting and searching in three dimensions is transformed to a process of sorting and searching within a one-dimensional array. The cost of contact searching is of the order of N log₂ N, where N is the number of nodes in the system. The proposed algorithms are uncomplicated and the implementation into any finite element code is straightforward. Numerical experiments are presented in order to examine the behaviour of the algorithms in different aspects.     

3D‐based hp‐adaptive first‐order shell finite element for modelling and analysis of complex structures—Part 2: Application to structural analysis

The paper presents a 3D‐based adaptive first‐order shell finite element to be applied to hierarchical modelling and adaptive analysis of complex structures. The main feature of the element is that it is equipped with 3D degrees of freedom, while its mechanical model corresponds to classical first‐order shell theory. Other useful features of the element are its modelling and adaptive capabilities. The element is assigned to hierarchical modelling and hpq‐adaptive analysis of shell parts of complex structures consisting of solid, thick‐ and thin‐shell parts, as well as of transition zones, where h, p and q denote the mesh density parameter and the longitudinal and transverse orders of approximation, respectively. The proposed hp‐adaptive first‐order shell element can be joined with 3D‐based hpq‐adaptive hierarchical shell elements or 3D hpp‐adaptive solid elements by means of the family of 3D‐based hpq/hp‐ or hpp/hp‐adaptive transition elements. The main objective of the first part of our research, presented in the first part of the paper, was to provide non‐standard information on the original parts of the element algorithm. Here we describe the second part of the research, devoted to the methodology and results of the application of the element to various plate and shell problems. The main objective of this part is to verify algorithms of the element and to show its usefulness in modelling and adaptive analysis of shell and plate parts of complex structures. In order to do that, there is a presentation of the results of a comparative analysis of model plate and shell problems using the classical and our elements, and equidistributed and integrated Legendre shape functions. For the plate problem a comparison of the results obtained from the adaptive and non‐adaptive analysis is also included. Additionally, some advantages of the application of our element are shown through a comparative analysis of p‐convergence of the thin plate problem and an adaptive analysis of the exemplary complex structure. Copyright © 2006 John Wiley & Sons, Ltd.     

Computation of resonant modes for axisymmetric Maxwell cavities using hp‐version edge finite elements

The computation of the resonant frequencies for closed cavities is not a trivial task: Multi‐materials and sharp corners all give rise to highly singular eigenfunctions. However, an approach using hp‐finite elements is well suited to such problems and, with the correct combination of h‐ and p‐refinements, it yields the theoretically predicated exponential rates of convergence. In this paper, we present a novel approach to the solution of axisymmetric cavity problems which uses a hierarchic H¹ and H (curl) conforming finite element basis. A selection of numerical examples is included and these demonstrate that the exponential rates of convergence are achieved in practice. Copyright © 2005 John Wiley & Sons, Ltd.     

Efficient visualization of high‐order finite elements

A general method for the post‐processing treatment of high‐order finite element fields is presented. The method applies to general polynomial fields, including discontinuous finite element fields. The technique uses error estimation and h‐refinement to provide an optimal visualization grid. Some filtering is added to the algorithm in order to focus the refinement on a visualization plane or on the computation of one single iso‐zero surface. 2D and 3D examples are provided that illustrate the power of the technique. In addition, schemes and algorithms that are discussed in the paper are readily available as part of an open source project that is developed by the authors, namely Gmsh. Copyright © 2006 John Wiley & Sons, Ltd.     

A family of second‐order boundary dampers for finite element analysis of two and three‐dimensional problems in transient exterior acoustics

Numerical modelling of exterior acoustics problems involving infinite medium requires truncation of the medium at a finite distance from the obstacle or the structure and use of non‐reflecting boundary condition at this truncation surface to simulate the asymptotic behaviour of radiated waves at far field. In the context of the finite element method, Bayliss–Gunzburger–Turkel (BGT) boundary conditions are well suited since they are local in both space and time. These conditions involve ‘damper’ operators of various orders, which work on acoustic pressure p and they have been used in time harmonic problems widely and in transient problems in a limited way. Alternative forms of second‐order BGT operators, which work on ṗ (time derivative of p) had been suggested in an earlier paper for 3D problems but they were neither implemented nor validated. This paper presents detailed formulations of these second‐order dampers both for 2D and 3D problems, implements them in a finite element code and validates them using appropriate example problems. The developed code is capable of handling exterior acoustics problems involving both Dirichlet and Neumann boundary conditions. Copyright © 2000 John Wiley & Sons, Ltd.     

Coupled finite element – hierarchical boundary element methods for dynamic soil–structure interaction in the frequency domain

This paper discusses the coupling of finite element and fast boundary element methods for the solution of dynamic soil–structure interaction problems in the frequency domain. The application of hierarchical matrices in the boundary element formulation allows considering much larger problems compared to classical methods. Three coupling methodologies are presented and their computational performance is assessed through numerical examples. It is demonstrated that the use of hierarchical matrices renders a direct coupling approach the least efficient, as it requires the assembly of a dynamic soil stiffness matrix. Iterative solution procedures are presented as well, and it is shown that the application of such schemes to dynamic soil–structure interaction problems in the frequency domain is not trivial, as convergence can hardly be achieved if no relaxation procedure is incorporated. Aitken's Δ²‐method is therefore employed in sequential iterative schemes for the calculation of an optimized interface relaxation parameter, while a novel relaxation technique is proposed for parallel iterative algorithms. It is demonstrated that the efficiency of these algorithms strongly depends on the boundary conditions applied to each subdomain; the fastest convergence is observed if Neumann boundary conditions are imposed on the stiffest subdomain. The use of a dedicated solver for each subdomain hence results in a reduced computational effort. A monolithic coupling strategy, often used for the solution of fluid–structure interaction problems, is also introduced. The governing equations are simultaneously solved in this approach, while the assembly of a dynamic soil stiffness matrix is avoided. Copyright © 2013 John Wiley & Sons, Ltd.     

Polygon scaled boundary finite elements for crack propagation modelling

An automatic crack propagation modelling technique using polygon elements is presented. A simple algorithm to generate a polygon mesh from a Delaunay triangulated mesh is implemented. The polygon element formulation is constructed from the scaled boundary finite element method (SBFEM), treating each polygon as a SBFEM subdomain and is very efficient in modelling singular stress fields in the vicinity of cracks. Stress intensity factors are computed directly from their definitions without any nodal enrichment functions. An automatic remeshing algorithm capable of handling any n‐sided polygon is developed to accommodate crack propagation. The algorithm is simple yet flexible because remeshing involves minimal changes to the global mesh and is limited to only polygons on the crack paths. The efficiency of the polygon SBFEM in computing accurate stress intensity factors is first demonstrated for a problem with a stationary crack. Four crack propagation benchmarks are then modelled to validate the developed technique and demonstrate its salient features. The predicted crack paths show good agreement with experimental observations and numerical simulations reported in the literature. Copyright © 2012 John Wiley & Sons, Ltd.     

Guaranteed energy error bounds for the Poisson equation using a flux‐free approach: Solving the local problems in subdomains

A method to compute guaranteed upper bounds for the energy norm of the exact error in the finite element solution of the Poisson equation is presented. The bounds are guaranteed for any finite element mesh however coarse it may be, not just in the asymptotic regime. The bounds are constructed by employing a subdomain‐based a posteriori error estimate which yields self‐equilibrated residual loads in stars (patches of elements). The proposed approach is an alternative to standard equilibrated residual methods providing sharper bounds. The use of a flux‐free error estimator improves the effectivities of the upper bounds for the energy while retaining the certainty of the bounds. Copyright © 2009 John Wiley & Sons, Ltd.     

A p‐hierarchical adaptive procedure for the scaled boundary finite element method

This paper describes a p‐hierarchical adaptive procedure based on minimizing the classical energy norm for the scaled boundary finite element method. The reference solution, which is the solution of the fine mesh formed by uniformly refining the current mesh element‐wise one order higher, is used to represent the unknown exact solution. The optimum mesh is assumed to be obtained when each element contributes equally to the global error. The refinement criteria and the energy norm‐based error estimator are described and formulated for the scaled boundary finite element method. The effectivity index is derived and used to examine quality of the proposed error estimator. An algorithm for implementing the proposed p‐hierarchical adaptive procedure is developed. Numerical studies are performed on various bounded domain and unbounded domain problems. The results reflect a number of key points. Higher‐order elements are shown to be highly efficient. The effectivity index indicates that the proposed error estimator based on the classical energy norm works effectively and that the reference solution employed is a high‐quality approximation of the exact solution. The proposed p‐hierarchical adaptive strategy works efficiently. Copyright © 2007 John Wiley & Sons, Ltd.     

MR linear contact detection algorithm

Large‐scale discrete element simulations, as well as a whole range of related problems, involve contact of a large number of separate bodies and an efficient and robust contact detection algorithm is necessary. There has been a number of contact detection algorithms with total detection time proportional to N ln(N) (where N is the total number of separate bodies) reported in the past. In more recent years algorithms with total CPU time proportional to N have been developed. In this work, a novel contact detection algorithm with total detection time proportional to N is proposed. The performance of the algorithm is not influenced by packing density, while memory requirements are insignificant. The algorithm is applicable to systems comprising bodies of a similar size. The algorithm is named MR (Munjiza–Rougier: Munjiza devised the algorithm, Rougier implemented it). In the second part of the paper the algorithm is extended to particles of different sizes. The new algorithm is called MMR (multi‐step MR) algorithm. Copyright © 2005 John Wiley & Sons, Ltd.     

Novel partitioned time integration methods for DAE systems based on L‐stable linearly implicit algorithms

Real‐time applications based on the principle of Dynamic Substructuring require integration methods that can deal with constraints without exceeding an a priori fixed number of steps. For these applications, first we introduce novel partitioned algorithms able to solve DAEs arising from transient structural dynamics. In particular, the spatial domain is partitioned into a set of disconnected subdomains and continuity conditions of acceleration at the interface are modeled using a dual Schur formulation. Interface equations along with subdomain equations lead to a system of DAEs for which both staggered and parallel procedures are developed. Moreover under the framework of projection methods, also a parallel partitioned method is conceived. The proposed partitioned algorithms enable a Rosenbrock‐based linearly implicit LSRT2 method, to be strongly coupled with different time steps in each subdomain. Thus, user‐defined algorithmic damping and subcycling strategies are allowed. Secondly, the paper presents the convergence analysis of the novel schemes for linear single‐Degree‐of‐Freedom (DoF) systems. The algorithms are generally A‐stable and preserve the accuracy order as the original monolithic method. Successively, these results are validated via simulations on single‐ and three‐DoFs systems. Finally, the insight gained from previous analyses is confirmed by means of numerical experiments on a coupled spring–pendulum system. Copyright © 2011 John Wiley & Sons, Ltd.     

An adaptive non‐conforming finite‐element method for Reissner–Mindlin plates

Adaptive algorithms are important tools for efficient finite‐element mesh design. In this paper, an error controlled adaptive mesh‐refining algorithm is proposed for a non‐conforming low‐order finite‐element method for the Reissner–Mindlin plate model. The algorithm is controlled by a reliable and efficient residual‐based a posteriori error estimate, which is robust with respect to the plate's thickness. Numerical evidence for this and the efficiency of the new algorithm is provided in the sense that non‐optimal convergence rates are optimally improved in our numerical experiments. Copyright © 2003 John Wiley & Sons, Ltd.     

A parallel run‐time iterative load balancing algorithm for solution‐adaptive finite element meshes on hypercubes

Abstract

To efficiently execute a finite element program on a hypercube, we need to map nodes of the corresponding finite element graph to processors of a hypercube such that each processor has approximately the same amount of computational load and the communication among processors is minimized. If the number of nodes of a finite element graph will not be increased during the execution of a program, the mapping only needs to be performed once. However, if a finite element graph is solution‐adaptive, that is, the number of nodes will be increased discretely due to the refinement of some finite elements during the execution of a program, a run‐time load balancing algorithm has to be performed many times in order to balance the computational load of processors while keeping the communication cost as low as possible. In this paper, we propose a parallel iterative load balancing algorithm (ILB) to deal with the load imbalancing problem of a solution‐adaptive finite element program. The proposed algorithm has three properties. First, the algorithm is simple and easy to be implemented. Second, the execution of the algorithm is fast. Third, it guarantees that the computational load will be balanced after the execution of the algorithm. We have implemented the proposed algorithm along with two parallel mapping algorithms, parallel orthogonal recursive bisection (ORB) [19] and parallel recursive mincut bipartitioning (MC) [8], on a 16‐node NCUBE‐2. Three criteria, the execution time of load balancing algorithms, the computation time of an application program under different load balancing algorithms, and the total execution time of an application program (under several refinement phases) are used for performance evaluation. Experimental results show that (1) the execution time of ILB is very short compared to those of MC and ORB; (2) the mappings produced by ILB are better than those of ORB and MC; and (3) the speedups produced by ILB are better than those of ORB and MC.     

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.