A parallel finite element procedure for contact-impact problems

An efficient parallel finite element procedure for contact-impact problems is presented within the framework of explicit finite element analysis with thepenalty method. The procedure concerned includes a parallel Belytschko-Lin-Tsay shell element generation algorithm and a parallel contact-impact algorithm based on the master-slave slideline algorithm. An element-wise domain decomposition strategy and a communication minimization strategy are featured to achieve almost perfect load balancing among processors and to show scalability of the parallel performance. Throughout this work, a prototype code, named GT-PARADYN, is developed on the IBM SP2 to implement the procedure presented, under message-passing paradigm. Some examples are provided to demonstrate the timing results of the algorithms, discussing the accuracy and efficiency of the code.     

A finite element approach for multiphase fluid flow in porous media

The main scope of this work is to carry out a mathematical framework and its corresponding finite element (FE) discretization for the partially saturated soil consolidation modelling in presence of an immiscible pollutant. A multiphase system with the interstitial voids in the grain matrix filled with water (liquid phase), water vapour and dry air (gas phase) and with pollutant substances, is assumed. The mathematical model addressed in this work was developed in the framework of mixture theory considering the pollutant saturation-suction coupling effects. The ensuing mathematical model involves equations of momentum balance, energy balance and mass balance of the whole multiphase system. Encouraging outcomes were achieved in several different examples.     

A finite element overlapping scheme for turbomachinery flows on parallel platforms

Two- and three-dimensional turbomachinery flows in stationary and rotating compressor cascades are studied by using a one-level inexact explicit Schwarz method, and a cubic eddy viscosity turbulence closure. The message passing paradigm is used for the parallel implementation of the domain decomposition algorithm, allowing the solver portability on different parallel platforms. A convergence accelerator is proposed, based on a condensed cycle structure that merges the additive Schwarz iterations with the fixed point non-linear ones. The use of a stable finite element formulation on higher-order elements Q2-Q1 is addressed as a mean for retaining non-oscillatory and accurate solutions. Furthermore, the elementwise quadratic approximation is used to enable the exact implementation of higher-order integrals arising in the anisotropic turbulence closure adopted. Numerical campaigns are carried out on IBM SP2 and SP3, and CRAY T3E architectures, in order to demonstrate the portability. The accompanying performance improvement is assessed. Finally, the predicting capabilities are discussed with reference to challenging turbomachinery test cases: a transitional linear compressor cascade, and an isolated compressor rotor designed for non-free vortex operation. Convergence speed-up in such configurations is discussed.     

Adaptive finite volume methods for displacement problems in porous media

In this paper we consider adaptive numerical simulation of miscible and immiscible displacement problems in porous media, which are modeled by single and two phase flow equations. Using the IMPES formulation of the two phase flow equation both problems can be treated in the same numerical framework. We discretise the equations by an operator splitting technique where the flow equation is approximated by Raviart-Thomas mixed finite elements and the saturation or concentration equation by vertex centered finite volume methods. Using a posteriori error estimates for both approximation schemes we deduce an adaptive solution algorithm for the system of equations and show the applicability in several examples.     

A mesh-refinement scheme for finite element computations

The paper considers the use of unorthodox grids where rapid transition from refined zones to coarser zones is effected, thus introducing exposed nodal freedoms at the zone interfaces. A technique for automated mesh enrichment of finite element discretizations is devised. Suitable convergence criteria are designed to delineate those subregions of a domain where refinement is necessary. Enriched and unaltered regions are separated by a fringe of semirefined elements. A valid finite element theory is provided for the fringe elements. A pilot numerical study illustrates the practical implementation of the automated refinement strategy. The principal features of the program are described.     

Fully discrete mixed finite element approximations for non-Darcy flows in porous media

A numerical approximation procedure is proposed to solve equations describing non-Darcy flow of a single-phase fluid in a porous medium in two or three spacial dimensions, including the generalized Forchheimer equation. Fully discrete mixed finite element methods are considered and analyzed for the approximation. Existence and uniqueness of the approximation are discussed and optimal order error estimates in L² are derived for the three relevant functions.     

Multipoint flux mixed finite element methods for slightly compressible flow in porous media

In this paper, we consider multipoint flux mixed finite element discretizations for slightly compressible Darcy flow in porous media. The methods are formulated on general meshes composed of triangles, quadrilaterals, tetrahedra or hexahedra. An inexact Newton method that allows for local velocity elimination is proposed for the solution of the nonlinear fully discrete scheme. We derive optimal error estimates for both the scalar and vector unknowns in the semidiscrete formulation. Numerical examples illustrate the convergence behavior of the methods, and their performance on test problems including permeability coefficients with increasing heterogeneity.     

A space-time least-square finite element scheme for advection-diffusion equations

A space-time least-square finite element scheme is presented for the advection-diffusion problems at moderate to high Peclet numbers. This scheme is designed to eliminate spurious oscillations and can be used to define the steady-state solution as the asymptotic transient solution for large time. Numerical results, using linear elements in a 1D space and bilinear elements in a 2D space, demonstrate the accuracy and the stability of the new scheme.     

A Newton-like finite element scheme for compressible gas flows

Semi-implicit and Newton-like finite element methods are developed for the stationary compressible Euler equations. The Galerkin discretization of the inviscid fluxes is potentially oscillatory and unstable. To suppress numerical oscillations, the spatial discretization is performed by a high-resolution finite element scheme based on algebraic flux correction. A multidimensional limiter of TVD type is employed. An important goal is the efficient computation of stationary solutions in a wide range of Mach numbers, which is a challenging task due to oscillatory correction factors associated with TVD-type flux limiters. A semi-implicit scheme is derived by a time-lagged linearization of the nonlinear residual, and a Newton-like method is obtained in the limit of infinite CFL numbers. Special emphasis is laid on the numerical treatment of weakly imposed characteristic boundary conditions. Numerical evidence for unconditional stability is presented. It is shown that the proposed approach offers higher accuracy and better convergence behavior than algorithms in which the boundary conditions are implemented in a strong sense.     

A triangular finite difference scheme for large deflection problems

A lumped triangular element formulation is developed based on a finite difference approach for the large deflection analysis of plates and shallow shells. The presented formulation is independent of the boundary condition (unlike the finite difference formulation) and uses energy principles to derive a set of nonlinear algebraic equations which are solved by using an incremental Newton-Raphson iterative procedure. A study of the large deflection behaviour of thin plates is made for various edge conditions and aspect ratios, and the results obtained are compared with those using a finite element scheme. Representative nondimensional solutions for deflections and stresses are presented in the form of graphs.     

Stochastic mixed multiscale finite element methods and their applications in random porous media

We present a framework for stochastic mixed multiscale finite element methods (mixed MsFEMs) for elliptic equations with heterogeneous random coefficients. The use of some global information is necessary in multiscale simulations when there is no scale separation for the heterogeneity. The methods in the proposed framework for the stochastic mixed MsFEMs use some global information. The media properties in a stochastic environment drastically vary among realizations and, thus, many global fields are needed for multiscale simulation. The computations of these global fields on a fine grid can be very expensive. One can utilize upscaling methods to compute the global information on an intermediate coarse grid that reduces the computational cost. We investigate two approaches of stochastic mixed MsFEMs in the framework. First approach entails no stochastic interpolation and the second approach uses stochastic interpolation. If the random media have deterministic features that play significant roles in the flow, we can use the deterministic features of the random media as the global information. This reduces the computational cost of the simulations. We make convergence analysis of the stochastic mixed MsFEMs and investigate their applications to incompressible two-phase flows in random porous media. The numerical results demonstrate the effectiveness of the proposed methods and confirm the convergence.     

A quasioptimal finite element method for elliptic interface problems

In [1] Babu?ka proposed perturbed variational methods for elliptic problems, with discontinuous coefficients. However, these methods are not quasioptimal, i.e. the approximate solutions generated by such methods do not reproduce the properties of “best approximation” possessed by the subspace of admissable approximants. In this paper we consider certain extrapolates obtained by use of a particular method of [1] and obtain “optimal” asymptotic error estimates. Our approach is similar to that of [7] where we proposed extrapolation methods for elliptic problems with smooth coefficients.     

A high-continuity finite element model for two-dimensional elastic problems

A finite element model for the analysis of two-dimensional elastic problems is presented. The proposed discretization is based on a biquadratic interpolation for the displacement components and takes advantage of the enforcement of the interelement continuity to obtain a profitable reduction of the total number of the degrees of freedom. One node (two kinematical parameters) per element only is required.Numerical results obtained for some test problems show the accuracy of the model in analyzing both the deformations and the stress distribution.     

Subdomain generation for non-convex parallel finite element domains

In this paper the Subdomain Generation Method (SGM), originally formulated in Khan & Topping (1993; Khan, A. I. & Topping, B. H. V., Subdomain generation for parallel finite element analysis. Comput. Syst. Engng, 1993, 4(4/6), 473–488) for convex finite element domains, is generalized for arbitrary shaped domains. Modifications to the original SGM are described which allow partitioning of non-convex domains. These modifications have been made to the formulation of the optimization module and the predictive module. The examples presented in Khan & Topping (1993) have been re-worked and two more examples have been added which demonstrate the application of the method to arbitrary shaped domains. It is shown with the aid of the examples that the method provides well-balanced subdomains very efficiently and allows parallel adaptive mesh generation. The method in its present form may be used to partition unstructured graphs in two or three dimensions. Since the computational cost for the mesh partitioning with this method depends solely upon the initial coarse mesh, hence the computational cost does not increase with the increase in the mesh density of the final mesh. The method in its present form is unsuitable for relatively coarse grained parallel computers, however the modifications which would impart a greater degree of scalability to this method are discussed.     

A numerically expedient scheme for elastic-plastic calculations in incremental finite element analysis

A numerically expedient scheme developed by Yang [1]for the modification of a Cholesky decomposed stiffness matrix is outlined. When used in conjunction with an incremental elastic-plastic finite element program, this method may result in a substantial reduction of computer time. The technique is appropriate for small strain problems, and optimal benefits are realized in situations involving contained plastic flow. The numerical efficiency of the technique is substantiated by case studies.     

A finite volume scheme for cardiac propagation in media with isotropic conductivities

A finite volume method for solving the monodomain and bidomain models for the electrical activity of myocardial tissue is presented. These models consist of a parabolic PDE and a system of a parabolic and an elliptic PDE, respectively, for certain electric potentials, coupled to an ODE for the gating variable. The existence and uniqueness of the approximate solution is proved, and it is also shown that the scheme converges to the corresponding weak solutions for the monodomain model, and for the bidomain model when considering diagonal conductivity tensors. Numerical examples in two and three space dimensions are provided, indicating experimental rates of convergence slightly above first order for both models.     

A parallel preconditioned conjugate gradient solution method for finite element problems with coarse–fine mesh formulation

The object of this paper is a parallel preconditioned conjugate gradient iterative solver for finite element problems with coarse-mesh/fine-mesh formulation. An efficient preconditioner is easily derived from the multigrid stiffness matrix. The method has been implemented, for the sake of comparison, both on a IBM-RISC590 and on a Quadrics-QH1, a massive parallel SIMD machine with 128 processors. Examples of solutions of simple linear elastic problems on rectangular grids are presented and convergence and parallel performance are discussed.     

An h-p-n adaptive finite element scheme for shell problems

We propose an adaptive finite element algorithm for shells which, in addition to the usual h-p adaption also shows adaptivity with respect to the order n of the dimension reduction. The idea of the algorithm is to adaptively capture and resolve the various length scales that may occur in shells. The algorithm presented in the paper is limited to axisymmetric problems, which reduces the h-p part of the problem to one dimension only. The performance of the algorithm is tested in some example cases where the shell is cylindrical. For comparison, we test the algorithm also when n is limited so that n k, where K = 1, 2 or 3. Choosing k = 2 essentially corresponds to the classical shell models.     

A finite element method for a class of contact-impact problems

We present a finite element method for a class of contact-impact problems. Theoretical background and numerical implementation features are discussed. In particular, we consider the basic ideas of contact-impact, the assumptions which define the class of problems we deal with, spatial and temporal discretizations of the bodies involved, special problems concerning the contact of bodies of different dimensions, discrete impact and release conditions, and solution of the nonlinear algebraic problem. Several sample problems are presented which demonstrate the accuracy and versatility of the algorithm.