On finite element approximations to time-dependent problems

Best possible error estimates are proved for spline semi-discrete approximations to dissipative initial value problems. Error bounds are also established for suitable difference quotients.This work was supported in part by the Office of Naval Research.     

Nonconforming inf-sup conditions for finite element approximations

Nonconforming approximations are considered. Abstract error estimates for nonconforming finite element methods are derived using generalized stability results. Several applications are discussed with the emphasis on the various versions of the finite element method.     

Two-scale composite finite element method for Dirichlet problems on complicated domains

In this paper, we define a new class of finite elements for the discretization of problems with Dirichlet boundary conditions. In contrast to standard finite elements, the minimal dimension of the approximation space is independent of the domain geometry and this is especially advantageous for problems on domains with complicated micro-structures. For the proposed finite element method we prove the optimal-order approximation (up to logarithmic terms) and convergence estimates valid also in the cases when the exact solution has a reduced regularity due to re-entering corners of the domain boundary. Numerical experiments confirm the theoretical results and show the potential of our proposed method.     

Adaptive least-squares finite element approximations to transonic-flow problems

This work concerns solutions of compressible potential flow problems based on weighted least-squares finite element approximations. The model problem considered is that of the potential flow past a circular cylinder. To capture the transonic flow region, an adaptive algorithm based on mesh redistribution with local mesh refinement and smoothing is developed for suitably weighted least-squares approximations. Numerical results for the model problem are given for the transonic case with shocks. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Stabilized discontinuous finite element approximations for Stokes equations

In this paper, we derive two stabilized discontinuous finite element formulations, symmetric and nonsymmetric, for the Stokes equations and the equations of the linear elasticity for almost incompressible materials. These methods are derived via stabilization of a saddle point system where the continuity of the normal and tangential components of the velocity/displacements are imposed in a weak sense via Lagrange multipliers. For both methods, almost all reasonable pair of discontinuous finite element spaces can be used to approximate the velocity and the pressure. Optimal error estimate for the approximation of both the velocity of the symmetric formulation and pressure in L²$L^2$ norm are obtained, as well as one in a mesh-dependent norm for the velocity in both symmetric and nonsymmetric formulations.     

Superconvergence of finite element approximations to Maxwell's equations

We study superconvergence of edge finite element approximations to the magnetostatic problem and to the time-dependent Maxwell system. We show that in special discrete norms there is an increase of one power in the order of convergence of the finite element method compared to error estimates in standard Sobolev norms. Our results are restricted to an orthogonal grid in R ³, but the grid may be nonuniform. © 1994 John Wiley & Sons, Inc.     

Convergence of finite element approximations of large eddy motion

Fluid motion in many applications occurs at higher Reynolds numbers. In these applications dealing with turbulent flow is thus inescapable. One promising approach to the simulation of the motion of the large structures in turbulent flow is large eddy simulation in which equations describing the motion of local spatial averages of the fluid velocity are solved numerically. This report considers “numerical errors” in LES. Specifically, for one family of space filtered flow models, we show convergence of the finite element approximation of the model and give an estimate of the error. © 2002 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 18: 689–710, 2002; Published online in Wiley InterScience (www.interscience.wiley.com); DOI 10.1002/num.10027.     

Monotone convergence of finite element approximations of obstacle problems

The purpose of the work is to study the monotone convergence of numerical solutions of obstacle problems under mesh refinement when the obstacle is convex. We prove monotone convergence of piecewise linear finite element approximations for one-dimensional obstacle problems. We demonstrate by giving a example that such monotone convergence will not hold in the two-dimensional case.     

Nonconforming finite element approximations of the Steklov eigenvalue problem and its lower bound approximations

The paper deals with error estimates and lower bound approximations of the Steklov eigenvalue problems on convex or concave domains by nonconforming finite element methods. We consider four types of nonconforming finite elements: Crouzeix-Raviart, Q ₁ ^rot , EQ ₁ ^rot and enriched Crouzeix-Raviart. We first derive error estimates for the nonconforming finite element approximations of the Steklov eigenvalue problem and then give the analysis of lower bound approximations. Some numerical results are presented to validate our theoretical results.     

Fully discrete finite element approximations of the forced Fisher equation

We consider fully discrete finite element approximations of the forced Fisher equation that models the dynamics of gene selection/migration for a diploid population with two available alleles in a multidimensional habitat and in the presence of an artificially introduced genotype. Finite element methods are used to effect spatial discretization and a nonstandard backward Euler method is used for the time discretization. Error estimates for the fully discrete approximations are derived by applying the Brezzi-Rappaz-Raviart theory for the approximation of a class of nonlinear problems. The approximation schemes and error estimates are applicable under weaker regularity hypotheses than those that are typically assumed in the literature. The algorithms and analyses, although presented in the concrete setting of the forced Fisher equation, also apply to a wide class of semilinear parabolic partial differential equations.     

Some upwinding techniques for finite element approximations of convection-diffusion equations

Summary A uniform framework for the study of upwinding schemes is developed. The standard finite element Galerkin discretization is chosen as the reference discretization, and differences between other discretization schemes and the reference are written as artificial diffusion terms. These artificial diffusion terms are spanned by a four dimensional space of element diffusion matrices. Three basis matrices are symmetric, rank one diffusion operators associated with the edges of the triangle; the fourth basis matrix is skew symmetric and is associated with a rotation by /2. While finite volume discretizations may be written as upwinded Galerkin methods, the converse does not appear to be true. Our approach is used to examine several upwinding schemes, including the streamline diffusion method, the box method, the Scharfetter-Gummel discretization, and a divergence-free scheme.The work of this author was supported by the Office of Naval Research under contract N00014-89J-1440The work of this author was supported through KWF-Landis/Gyr Grant 1496, AT & T Bell Laboratories, and Cray Research     

Numerical comparison of preconditionings for large sparse finite element problems

A numerical study of the efficiency of the modified conjugate gradients (MCG) is performed using different preconditioning schemes. The MCG behavior is evaluated in connection with the solution of large linear sets of symmetric positive definite (p.d.) equations, arising from the finite element (f.e.) integration of partial differential equations of parabolic and elliptic type and the analysis of the leftmost eingenspectrum of the corresponding matrices. A simple incomplete Cholesky factorization ICCG(O) having the same sparsity pattern as the original problem is compared with a more complex technique ICAJ (Ψ) where the triangular factor is allowed to progressively fill in depending on a rejection parameter Ψ. The performance of the preconditioning algorithms is explored on finite element equations whose size N ranges between 150 and 2300. The results show that an optimal Ψ_opt may be found which minimizes the overall CPU time for the solution of both the linear system and the eigenproblem. The comparison indicates that ICAJ (Ψ_opt) is not significantly more efficient than ICCG(O), which therefore appears to be a simple, robust, and reliable method for the preconditioning of large sparse finite element models.     

A sparse finite element method with high accuracy Part I

Summary. In this paper, we develop and analyze a new finite element method called the sparse finite element method for second order elliptic problems. This method involves much fewer degrees of freedom than the standard finite element method. We show nevertheless that such a sparse finite element method still possesses the superconvergence and other high accuracy properties same as those of the standard finite element method. The main technique in our analysis is the use of some integral identities. Received October 1, 1995 / Revised version received August 23, 1999 / Published online February 5, 2001     

Adaptive multilevel finite element approximations of semilinear elliptic boundary value problems

Summary. In this paper we consider two aspects of the problem of designing efficient numerical methods for the approximation of semilinear boundary value problems. First we consider the use of two and multilevel algorithms for approximating the discrete solution. Secondly we consider adaptive mesh refinement based on feedback information from coarse level approximations. The algorithms are based on an a posteriori error estimate, where the error is estimated in terms of computable quantities only. The a posteriori error estimate is used for choosing appropriate spaces in the multilevel algorithms, mesh refinements, as a stopping criterion and finally it gives an estimate of the total error. Received April 8, 1997 / Revised version received July 27, 1998 / Published online September 24, 1999     

Regularization procedures of mixed finite element approximations of the stokes problem

We propose a theoretical framework for the study of regularization of the Stokes problem. This enables us to perform a general error analysis and to apply it to known schemes as well as to a new one pertaining to the use of the P1-P1 element. Finally we show that in the P1-case the theory can also be used to get convergence results for elements obtained by addition of bubble functions, without using the usual mixed finite element machinery.     

Convergence of mixed finite element approximations for the shallow arch problem

Summary The stability and convergence of mixed finite element methods are investigated, for an equilibrium problem for thin shallow elastic arches. The problem in its standard form contains two terms, corresponding to the contributions from the shear and axial strains, with a small parameter. Lagrange multipliers are introduced, to formulate the problem in an alternative mixed form. Questions of existence and uniqueness of solutions to the standard and mixed problems are addressed. It is shown that finite element approximations of the mixed problem are stable and convergent. Reduced integration formulations are equivalent to a mixed formulation which in general is distinct from the formulation shown to be stable and convergent, except when the order of polynomial interpolationt of the arch shape satisfies 1tmin (2,r) wherer is the order of polynomial approximation of the unknown variables.     

Two-grid methods for finite volume element approximations of nonlinear parabolic equations

Two-grid methods are studied for solving a two dimensional nonlinear parabolic equation using finite volume element method. The methods are based on one coarse-grid space and one fine-grid space. The nonsymmetric and nonlinear iterations are only executed on the coarse grid and the fine-grid solution can be obtained in a single symmetric and linear step. It is proved that the coarse grid can be much coarser than the fine grid. The two-grid methods achieve asymptotically optimal approximation as long as the mesh sizes satisfy h=O(H³|lnH|)$h=O\left(H^3|lnH|\right)$. As a result, solving such a large class of nonlinear parabolic equations will not be much more difficult than solving one single linearized equation.     

Interior penalty preconditioners for mixed finite element approximations of elliptic problems

It is established that an interior penalty method applied to second-order elliptic problems gives rise to a local operator which is spectrally equivalent to the corresponding nonlocal operator arising from the mixed finite element method. This relation can be utilized in order to construct preconditioners for the discrete mixed system. As an example, a family of additive Schwarz preconditioners for these systems is constructed. Numerical examples which confirm the theoretical results are also presented.

     

A framework for obtaining guaranteed error bounds for finite element approximations

We give an overview of our recent progress in developing a framework for the derivation of fully computable guaranteed posteriori error bounds for finite element approximation including conforming, non-conforming, mixed and discontinuous finite element schemes. Whilst the details of the actual estimator are rather different for each particular scheme, there is nonetheless a common underlying structure at work in all cases. We aim to illustrate this structure by treating conforming, non-conforming and discontinuous finite element schemes in a single framework. In taking a rather general viewpoint, some of the finer details of the analysis that rely on the specific properties of each particular scheme are obscured but, in return, we hope to allow the reader to ‘see the wood despite the trees’.     

Error analysis of finite element approximations of the stochastic Stokes equations

Numerical solutions of the stochastic Stokes equations driven by white noise perturbed forcing terms using finite element methods are considered. The discretization of the white noise and finite element approximation algorithms are studied. The rate of convergence of the finite element approximations is proved to be almost first order (h|ln h|) in two dimensions and one half order ( h^\frac12h^{\frac{1}{2}}) in three dimensions. Numerical results using the algorithms developed are also presented.