Element‐wise a posteriori estimates based on hierarchical bases for non‐linear parabolic problems

We show that the issue of a posteriori estimate the errors in the numerical simulation of non‐linear parabolic equations can be reduced to a posteriori estimate the errors in the approximation of an elliptic problem with the right‐hand side depending on known data of the problem and the computed numerical solution. A procedure to obtain local error estimates for the p version of the finite element method by solving small discrete elliptic problems with right‐hand side the residual of the p‐FEM solution is introduced. The boundary conditions are inherited by those of the space of hierarchical bases to which the error estimator belongs. We prove that the error in the numerical solution can be reduced by adding the estimators that behave as a locally defined correction to the computed approximation. When the error being estimated is that of a elliptic problem constant free local lower bounds are obtained. The local error estimation procedure is applied to non‐linear parabolic differential equations in several space dimensions. Some numerical experiments for both the elliptic and the non‐linear parabolic cases are provided. Copyright © 2005 John Wiley & Sons, Ltd.     

A‐scalability and an integrated computational technology and framework for non‐linear structural dynamics. Part 2: Implementation aspects and parallel performance results

An integrated framework and computational technology is described that addresses the issues to foster absolute scalability (A‐scalability) of the entire transient duration of the simulations of implicit non‐linear structural dynamics of large scale practical applications on a large number of parallel processors. Whereas the theoretical developments and parallel formulations were presented in Part 1, the implementation, validation and parallel performance assessments and results are presented here in Part 2 of the paper. Relatively simple numerical examples involving large deformation and elastic and elastoplastic non‐linear dynamic behaviour are first presented via the proposed framework for demonstrating the comparative accuracy of methods in comparison to available experimental results and/or results available in the literature. For practical geometrically complex meshes, the A‐scalability of non‐linear implicit dynamic computations is then illustrated by employing scalable optimal dissipative zero‐order displacement and velocity overshoot behaviour time operators which are a subset of the generalized framework in conjunction with numerically scalable spatial domain decomposition methods and scalable graph partitioning techniques. The constant run times of the entire simulation of ‘fixed‐memory‐use‐per‐processor’ scaling of complex finite element mesh geometries is demonstrated for large scale problems and large processor counts on at least 1024 processors. Copyright © 2003 John Wiley & Sons, Ltd.     

Higher‐order accurate time‐step‐integration algorithms by post‐integration techniques

In this paper, a framework to construct higher‐order‐accurate time‐step‐integration algorithms based on the post‐integration techniques is presented. The prescribed initial conditions are naturally incorporated in the formulations and can be strongly or weakly enforced. The algorithmic parameters are chosen such that unconditionally A‐stable higher‐order‐accurate time‐step‐integration algorithms with controllable numerical dissipation can be constructed for linear problems. Besides, it is shown that the order of accuracy for non‐linear problems is maintained through the relationship between the present formulation and the Runge–Kutta method. The second‐order differential equations are also considered. Numerical examples are given to illustrate the validity of the present formulation. Copyright © 2001 John Wiley & Sons, Ltd.     

An optimal high‐order non‐reflecting finite element scheme for wave scattering problems

A new finite element scheme is proposed for the numerical solution of time‐harmonic wave scattering problems in unbounded domains. The infinite domain in truncated via an artificial boundary ?? which encloses a finite computational domain Ω. On ?? a local high‐order non‐reflecting boundary condition (NRBC) is applied which is constructed to be optimal in a certain sense. This NRBC is implemented in a special way, by using auxiliary variables along the boundary ??, so that it involves no high‐order derivatives regardless of its order. The order of the scheme is simply an input parameter, and it may be arbitrarily high. This leads to a symmetric finite element formulation where standard C⁰ finite elements are used in Ω. The performance of the method is demonstrated via numerical examples, and it is compared to other NRBC‐based schemes. The method is shown to be highly accurate and stable, and to lead to a well‐conditioned matrix problem. Copyright © 2002 John Wiley & Sons, Ltd.     

Finite element analysis of time‐dependent semi‐infinite wave‐guides with high‐order boundary treatment

A new finite element (FE) scheme is proposed for the solution of time‐dependent semi‐infinite wave‐guide problems, in dispersive or non‐dispersive media. The semi‐infinite domain is truncated via an artificial boundary ??, and a high‐order non‐reflecting boundary condition (NRBC), based on the Higdon non‐reflecting operators, is developed and applied on ??. The new NRBC does not involve any high derivatives beyond second order, but its order of accuracy is as high as one desires. It involves some parameters which are chosen automatically as a pre‐process. A C⁰ semi‐discrete FE formulation incorporating this NRBC is constructed for the problem in the finite domain bounded by ??. Augmented and split versions of this FE formulation are proposed. The semi‐discrete system of equations is solved by the Newmark time‐integration scheme. Numerical examples concerning dispersive waves in a semi‐infinite wave guide are used to demonstrate the performance of the new method. Copyright © 2003 John Wiley & Sons, Ltd.     

The maximum principle violations of the mixed‐hybrid finite‐element method applied to diffusion equations

The abundant literature of finite‐element methods applied to linear parabolic problems, generally, produces numerical procedures with satisfactory properties. However, some initial–boundary value problems may cause large gradients at some points and consequently jumps in the solution that usually needs a certain period of time to become more and more smooth. This intuitive fact of the diffusion process necessitates, when applying numerical methods, varying the mesh size (in time and space) according to the smoothness of the solution. In this work, the numerical behaviour of the time‐dependent solutions for such problems during small time duration obtained by using a non‐conforming mixed‐hybrid finite‐element method (MHFEM) is investigated. Numerical comparisons with the standard Galerkin finite element (FE) as well as the finite‐difference (FD) methods are checked. Owing to the fact that the mixed methods violate the discrete maximum principle, some numerical experiments showed that the MHFEM leads sometimes to non‐physical peaks in the solution. A diffusivity criterion relating the mesh steps for an artificial initial–boundary value problem will be presented. One of the propositions given to avoid any non‐physical oscillations is to use the mass‐lumping techniques. Copyright © 2002 John Wiley & Sons, Ltd.     

Modelling of reinforced‐concrete structures providing crack‐spacing based on X‐FEM,ED‐FEM and novel operator split solution procedure

In this work, we present a novel approach to the finite element modelling of reinforced‐concrete (RC) structures that provides the details of the constitutive behavior of each constituent (concrete, steel and bond‐slip), while keeping formally the same appearance as the classical finite element model. Each component constitutive behavior can be brought to fully non‐linear range, where we can consider cracking (or localized failure) of concrete, the plastic yielding and failure of steel bars and bond‐slip at concrete steel interface accounting for confining pressure effects. The standard finite element code architecture is preserved by using embedded discontinuity (ED‐FEM) and extended (X‐FEM) finite element strain representation for concrete and slip, respectively, along with the operator split solution method that separates the problem into computing the deformations of RC (with frozen slip) and the current value of the bond‐slip. Several numerical examples are presented in order to illustrate very satisfying performance of the proposed methodology. Copyright © 2010 John Wiley & Sons, Ltd.     

Parameter‐free,weak imposition of Dirichlet boundary conditions and coupling of trimmed and non‐conforming patches

We present a parameter‐free domain sewing approach for low‐order as well as high‐order finite elements. Its final form contains only primal unknowns; that is, the approach does not introduce additional unknowns at the interface. Additionally, it does not involve problem‐dependent parameters, which require an estimation. The presented approach is symmetry preserving; that is, the resulting discrete form of an elliptic equation will remain symmetric and positive definite. It preserves the order of the underlying discretization, and we demonstrate high‐order accuracy for problems of non‐matching discretizations concerning the mesh size h as well as the polynomial degree of the order of discretization p. We also demonstrate how the method may be used to model material interfaces, which may be curved and for which the interface does not coincide with the underlying mesh. This novel approach is presented in the context of the p‐version and B‐spline version of the finite cell method, an embedded domain method of high order, and compared with more classical methods such as the penalty method or Nitsche's method. Copyright © 2014 John Wiley & Sons, Ltd.     

A non‐linear programming approach to kinematic shakedown analysis of composite materials

Using a Representative volume element (RVE) to represent the microstructure of periodic composite materials, this paper develops a non‐linear numerical technique to calculate the macroscopic shakedown domains of composites subjected to cyclic loads. The shakedown analysis is performed using homogenization theory and the displacement‐based finite element method. With the aid of homogenization theory, the classical kinematic shakedown theorem is generalized to incorporate the microstructure of composites. Using an associated flow rule, the plastic dissipation power for an ellipsoid yield criterion is expressed in terms of the kinematically admissible velocity. By means of non‐linear mathematical programming techniques, a finite element formulation of kinematic shakedown analysis is then developed leading to a non‐linear mathematical programming problem subject to only a small number of equality constraints. The objective function corresponds to the plastic dissipation power which is to be minimized and an upper bound to the shakedown load of a composite is then obtained. An effective, direct iterative algorithm is proposed to solve the non‐linear programming problem. The effectiveness and efficiency of the proposed numerical method have been validated by several numerical examples. This can serve as a useful numerical tool for developing engineering design methods involving composite materials. Copyright © 2005 John Wiley & Sons, Ltd.     

Using the sequential linear integer programming method as a post‐processor for stress‐constrained topology optimization problems

This paper deals with topology optimization of load‐carrying structures defined on discretized continuum design domains. In particular, the minimum compliance problem with stress constraints is considered. The finite element method is used to discretize the design domain into n finite elements and the design of a certain structure is represented by an n‐dimensional binary design variable vector. In order to solve the problems, the binary constraints on the design variables are initially relaxed and the problems are solved with both the method of moving asymptotes and the sparse non‐linear optimizer solvers for continuous optimization in order to compare the two solvers. By solving a sequence of problems with a sequentially lower limit on the amount of grey allowed, designs that are close to ‘black‐and‐white’ are obtained. In order to get locally optimal solutions that are purely {0, 1}ⁿ, a sequential linear integer programming method is applied as a post‐processor. Numerical results are presented for some different test problems. Copyright © 2008 John Wiley & Sons, Ltd.     

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.     

Adaptive finite element analysis of 2‐D static and steady‐state electromagnetic problems

The adaptive finite element methods developed by the authors for a class of 2‐D problems in computational electromagnetics are presented. The cases covered are: magnetostatic, electrostatic, DC conduction and linear AC steady‐state eddy currents, both plane and axialsymmetric. Theory is developed in the linear case only, but the resulting methods are applied on a heuristic basis also to non‐linear cases and prove able to cope with them. These methods make use of an element‐by‐element error estimation and two different h‐refinement techniques to adapt meshes made up of first or second‐order triangular elements. Element‐by‐ element error estimation has two main advantages: it is well suited to cope with the intricate geometries of electromagnetic devices and, at the same time, very cheap from a computational viewpoint. The local error is estimated by approximately solving a differential problem in each element. Theory on which this error estimation method is grounded is developed in full details and the underlying assumptions are pointed out. The presence in electromagnetic problems of surface currents and interfaces between different materials poses new problems in the error estimation with respect to other applications in which similar methods are used. The h‐refinement technique can be selected between the bisection method and the centroid method followed by a Delaunay step. Accuracy and efficiency of the proposed method is discussed on the basis of previous work of the authors and further numerical experiments. Applications to realistic models showing good performances of the proposed methods are reported. Copyright © 1999 John wiley & Sons, Ltd.     

c‐Type method of unified CAMG and FEA. Part 1: Beam and arch mega‐elements—3D linear and 2D non‐linear

Computer‐aided mesh generation (CAMG) dictated solely by the minimal key set of requirements of geometry, material, loading and support condition can produce ‘mega‐sized’, arbitrary‐shaped distorted elements. However, this may result in substantial cost saving and reduced bookkeeping for the subsequent finite element analysis (FEA) and reduced engineering manpower requirement for final quality assurance. A method, denoted as c‐type, has been proposed by constructively defining a finite element space whereby the above hurdles may be overcome with a minimal number of hyper‐sized elements. Bezier (and de Boor) control vectors are used as the generalized displacements and the Bernstein polynomials (and B‐splines) as the elemental basis functions. A concomitant idea of coerced parametry and inter‐element continuity on demand unifies modelling and finite element method. The c‐type method may introduce additional control, namely, an inter‐element continuity condition to the existing h‐type and p‐type methods. Adaptation of the c‐type method to existing commercial and general‐purpose computer programs based on a conventional displacement‐based finite element method is straightforward. The c‐type method with associated subdivision technique can be easily made into a hierarchic adaptive computer method with a suitable a posteriori error analysis. In this context, a summary of a geometrically exact non‐linear formulation for the two‐dimensional curved beams/arches is presented. Several beam problems ranging from truly three‐dimensional tortuous linear curved beams to geometrically extremely non‐linear two‐dimensional arches are solved to establish numerical efficiency of the method. Incremental Lagrangian curvilinear formulation may be extended to overcome rotational singularity in 3D geometric non‐linearity and to treat general material non‐linearity. Copyright © 2003 John Wiley & Sons, Ltd.     

Smooth,second order,non‐negative meshfree approximants selected by maximum entropy

We present a family of approximation schemes, which we refer to as second‐order maximum‐entropy (max‐ent) approximation schemes, that extends the first‐order local max‐ent approximation schemes to second‐order consistency. This method retains the fundamental properties of first‐order max‐ent schemes, namely the shape functions are smooth, non‐negative, and satisfy a weak Kronecker‐delta property at the boundary. This last property makes the imposition of essential boundary conditions in the numerical solution of partial differential equations trivial. The evaluation of the shape functions is not explicit, but it is very efficient and robust. To our knowledge, the proposed method is the first higher‐order scheme for function approximation from unstructured data in arbitrary dimensions with non‐negative shape functions. As a consequence, the approximants exhibit variation diminishing properties, as well as an excellent behavior in structural vibrations problems as compared with the Lagrange finite elements, MLS‐based meshfree methods and even B‐Spline approximations, as shown through numerical experiments. When compared with usual MLS‐based second‐order meshfree methods, the shape functions presented here are much easier to integrate in a Galerkin approach, as illustrated by the standard benchmark problems. Copyright © 2009 John Wiley & Sons, Ltd.     

Least‐squares mixed finite elements for small strain elasto‐viscoplasticity

The main aim of this contribution is to provide a mixed finite element for small strain elasto‐viscoplastic material behavior based on the least‐squares method. The L₂‐norm minimization of the residuals of the given first‐order system of differential equations leads to a two‐field functional with displacements and stresses as process variables. For the continuous approximation of the stresses, lowest‐order Raviart–Thomas elements are used, whereas for the displacements, standard conforming elements are employed. It is shown that the non‐linear least‐squares functional provides an a posteriori error estimator, which establishes ellipticity of the proposed variational approach. Further on, details about the implementation of the least‐squares mixed finite elements are given and some numerical examples are presented. Copyright © 2008 John Wiley & Sons, Ltd.     

A fast implementation of the FETI‐DP method: FETI‐DP‐RBS‐LNA and applications on large scale problems with localized non‐linearities

As parallel and distributed computing gradually becomes the computing standard for large scale problems, the domain decomposition method (DD) has received growing attention since it provides a natural basis for splitting a large problem into many small problems, which can be submitted to individual computing nodes and processed in a parallel fashion. This approach not only provides a method to solve large scale problems that are not solvable on a single computer by using direct sparse solvers but also gives a flexible solution to deal with large scale problems with localized non‐linearities. When some parts of the structure are modified, only the corresponding subdomains and the interface equation that connects all the subdomains need to be recomputed. In this paper, the dual–primal finite element tearing and interconnecting method (FETI‐DP) is carefully investigated, and a reduced back‐substitution (RBS) algorithm is proposed to accelerate the time‐consuming preconditioned conjugate gradient (PCG) iterations involved in the interface problems. Linear–non‐linear analysis (LNA) is also adopted for large scale problems with localized non‐linearities based on subdomain linear–non‐linear identification criteria. This combined approach is named as the FETI‐DP‐RBS‐LNA algorithm and demonstrated on the mechanical analyses of a welding problem. Serial CPU costs of this algorithm are measured at each solution stage and compared with that from the IBM Watson direct sparse solver and the FETI‐DP method. The results demonstrate the effectiveness of the proposed computational approach for simulating welding problems, which is representative of a large class of three‐dimensional large scale problems with localized non‐linearities. Copyright © 2005 John Wiley & Sons, Ltd.     

Fatigue control of thin‐walled structures

The control of the ultimate fatigue behaviour of slender thin‐walled structures is treated in the paper. A macro‐ and micromechanical simulation model adopting the neural network approach is used for the numerical analysis of the problem. The numerical treatment of the non‐linear problems is made using the updated Lagrangian formulation of motion combined with the pseudo‐force technique in the FETM‐approach. Each step of the iteration approaches the solution of the linear problem and the feasibility of the parallel processing and neural network numerical techniques is established. The application on the actual slender bridge is made in order to demonstrate the efficiency of the procedures suggested. Copyright © 2003 John Wiley & Sons, Ltd.     

A class of parallel multiple‐front algorithms on subdomains

A class of parallel multiple‐front solution algorithms is developed for solving linear systems arising from discretization of boundary value problems and evolution problems. The basic substructuring approach and frontal algorithm on each subdomain are first modified to ensure stable factorization in situations where ill‐conditioning may occur due to differing material properties or the use of high degree finite elements (p methods). Next, the method is implemented on distributed‐memory multiprocessor systems with the final reduced (small) Schur complement problem solved on a single processor. A novel algorithm that implements a recursive partitioning approach on the subdomain interfaces is then developed. Both algorithms are implemented and compared in a least‐squares finite‐element scheme for viscous incompressible flow computation using h‐ and p‐finite element schemes. Copyright © 2003 John Wiley & Sons, Ltd.     

Non‐linear model reduction for uncertainty quantification in large‐scale inverse problems

We present a model reduction approach to the solution of large‐scale statistical inverse problems in a Bayesian inference setting. A key to the model reduction is an efficient representation of the non‐linear terms in the reduced model. To achieve this, we present a formulation that employs masked projection of the discrete equations; that is, we compute an approximation of the non‐linear term using a select subset of interpolation points. Further, through this formulation we show similarities among the existing techniques of gappy proper orthogonal decomposition, missing point estimation, and empirical interpolation via coefficient‐function approximation. The resulting model reduction methodology is applied to a highly non‐linear combustion problem governed by an advection–diffusion‐reaction partial differential equation (PDE). Our reduced model is used as a surrogate for a finite element discretization of the non‐linear PDE within the Markov chain Monte Carlo sampling employed by the Bayesian inference approach. In two spatial dimensions, we show that this approach yields accurate results while reducing the computational cost by several orders of magnitude. For the full three‐dimensional problem, a forward solve using a reduced model that has high fidelity over the input parameter space is more than two million times faster than the full‐order finite element model, making tractable the solution of the statistical inverse problem that would otherwise require many years of CPU time. Copyright © 2009 John Wiley & Sons, Ltd.