A conjugate gradient method and a multigrid algorithm for Morley s finite element approximation of the biharmonic equation

Summary The numerical solution of the linear equations arising from Morley's nonconforming displacement method is studied. A suitable preconditioning for the conjugate gradient method is described. Furthermore, the nonconformity of the discretization necessitates some non-standard ingredients of multigrid algorithms.     

A primal hybrid finite element method for quasilinear second order elliptic problems

Summary The Robin problem for a nonlinear, second-order, elliptic equation is approximated by a primal hybrid method. Optimal order error estimates are established in various norms, with minimal regularity requirements in almost all cases.     

On the finite volume element method

Summary The finite volume element method (FVE) is a discretization technique for partial differential equations. It uses a volume integral formulation of the problem with a finite partitioning set of volumes to discretize the equations, then restricts the admissible functions to a finite element space to discretize the solution. this paper develops discretization error estimates for general selfadjoint elliptic boundary value problems with FVE based on triangulations with linear finite element spaces and a general type of control volume. We establishO(h) estimates of the error in a discreteH ¹ semi-norm. Under an additional assumption of local uniformity of the triangulation the estimate is improved toO(h ²). Results on the effects of numerical integration are also included.This research was sponsored in part by the Air Force Office of Scientific Research under grant number AFOSR-86-0126 and the National Science Foundation under grant number DMS-8704169. This work was performed while the author was at the University of Colorado at Denver     

Theh,p andh-p versions of the finite element method in 1 dimension

Summary This paper is the first one in the series of three which are addressing in detail the properties of the three basic versions of the finite element method in the one dimensional setting The main emphasis is placed on the analysis when the (exact) solution has singularity of x-type. The first part analyzes thep-version, the second theh-version and generalh-p version and the final third part addresses the problems of the adaptiveh-p version.Supported by the NSF Grant DMS-8315216Partially supported by ONR Contract N00014-85-K-0169     

An asymptotic finite element method for improvement of solutions of boundary layer problems

Summary A scheme that uses singular perturbation theory to improve the performance of existing finite element methods is presented. The proposed scheme improves the error bounds of the standard Galerkin finite element scheme by a factor of O(ⁿ⁺¹) (where is the small parameter andn is the order of the asymptotic approximation). Numerical results for linear second order O.D.E.'s are given and are compared with several other schemes.     

A family of higher order mixed finite element methods for plane elasticity

Summary The Dirichler problem for the equations of plane elasticity is approximated by a mixed finite element method using a new family of composite finite elements having properties analogous to those possessed by the Raviart-Thomas mixed finite elements for a scalar, second-order elliptic equation. Estimates of optimal order and minimal regularity are derived for the errors in the displacement vector and the stress tensor inL ²(), and optimal order negative norm estimates are obtained inH ^s () for a range ofs depending on the index of the finite element space. An optimal order estimate inL () for the displacement error is given. Also, a quasioptimal estimate is derived in an appropriate space. All estimates are valid uniformly with respect to the compressibility and apply in the incompressible case. The formulation of the elements is presented in detail.This work was performed while Professor Arnold was a NATO Postdoctoral Fellow     

An iterative substructuring algorithm for equilibrium equations

Summary The topic of iterative substructuring methods, and more generally domain decomposition methods, has been extensively studied over the past few years, and the topic is well advanced with respect to first and second order elliptic problems. However, relatively little work has been done on more general constrained least squares problems (or equivalent formulations) involving equilibrium equations such as those arising, for example, in realistic structural analysis applications. The potential is good for effective use of iterative algorithms on these problems, but such methods are still far from being competitive with direct methods in industrial codes. The purpose of this paper is to investigate an order reducing, preconditioned conjugate gradient method proposed by Barlow, Nichols and Plemmons for solving problems of this type. The relationships between this method and nullspace methods, such as the force method for structures and the dual variable method for fluids, are examined. Convergence properties are discussed in relation to recent optimality results for Varga's theory ofp-cyclic SOR. We suggest a mixed approach for solving equilibrium equations, consisting of both direct reduction in the substructures and the conjugate gradient iterative algorithm to complete the computations.Dedicated to R. S. Varga on the occasion of his 60th birthdayResearch completed while pursuing graduate studies sponsored by the Department of Mathematical Sciences, US Air Force Academy, CO, and funded by the Air Force Institute of Technology, WPAFB, OHResearch supported by the Air Force under grant no. AFOSR-88-0285 and by the National Science Foundation under grant no. DMS-89-02121     

On the construction of optimal mixed finite element methods for the linear elasticity problem

Summary The mixed finite element method for the linear elasticity problem is considered. We propose a systematic way of designing methods with optimal convergence rates for both the stress tensor and the displacement. The ideas are applied in some examples.     

Comparison of linear system solvers applied to diffusion-type finite element equations

Summary Various iterative methods for solving the linear systems associated with finite element approximations to self-adjoint elliptic differential operators are compared based on their performance on serial and parallel machines. The methods studied are all preconditioned conjugate gradient methods, differing only in the choice of preconditioner. The preconditioners considered arise from diagonal scaling, incomplete Cholesky decomposition, hierarchical basis functions, and a Neumann-Dirichlet domain decomposition technique. The hierarchical basis function idea is shown to be especially effective on both serial and parallel architectures.This work was supported by the Applied Mathematical Sciences Program of the US Department of Energy under contract DE-AC02-76ER03077     

A finite element method for the nonlinear Tricomi problem

Summary We consider a finite element procedure for numerical solution of the nonlinear problem:L[u]=yu _xx +u _yy +r(x,y)u=f(x, y, u) in a simply connected regionG in thex-y plane. The boundary ofG consists of ₀, ₁, and ₂ and we impose the boundary condition . ₀ is assumed to be a piecewises smooth curve lying in the half-planey>0 with endpointsA(–1, 0) andB(0, 0). ₁ and ₂ are characteristics of the operatorL issued fromA andB which intersect at the pointC(–1/2,y _c). An error analysis of the method is also given.     

The finite element method for nonlinear elliptic equations with discontinuous coefficients

Summary The study of the finite element approximation to nonlinear second order elliptic boundary value problems with discontinuous coefficients is presented in the case of mixed Dirichlet-Neumann boundary conditions. The change in domain and numerical integration are taken into account. With the assumptions which guarantee that the corresponding operator is strongly monotone and Lipschitz-continuous the following convergence results are proved: 1. the rate of convergenceO(h ) if the exact solutionuH ¹ () is piecewise of classH ¹⁺ (0<1);2. the convergence without any rate of convergence ifuH ¹ () only.     

The hierarchical basis multigrid method

Summary We derive and analyze the hierarchical basis-multigrid method for solving discretizations of self-adjoint, elliptic boundary value problems using piecewise linear triangular finite elements. The method is analyzed as a block symmetric Gauß-Seidel iteration with inner iterations, but it is strongly related to 2-level methods, to the standard multigridV-cycle, and to earlier Jacobi-like hierarchical basis methods. The method is very robust, and has a nearly optimal convergence rate and work estimate. It is especially well suited to difficult problems with rough solutions, discretized using highly nonuniform, adaptively refined meshes.     

L 2 estimates for the finite element method for the Dirichlet problem with singular data

Summary In this paper we consider the approximation by the finite element method of second order elliptic problems on convex domains and homogeneous Dirichlet condition on the boundary. In these problems the data are Borel measures. Using a quasiuniform mesh of finite elements and polynomials of degree 1, we prove that in two dimensions the convergence is of orderh inL ² and in three dimensions of orderh ^1/2.     

On the multi-level splitting of finite element spaces

Summary In this paper we analyze the condition number of the stiffness matrices arising in the discretization of selfadjoint and positive definite plane elliptic boundary value problems of second order by finite element methods when using hierarchical bases of the finite element spaces instead of the usual nodal bases. We show that the condition number of such a stiffness matrix behaves like O((log )²) where is the condition number of the stiffness matrix with respect to a nodal basis. In the case of a triangulation with uniform mesh sizeh this means that the stiffness matrix with respect to a hierarchical basis of the finite element space has a condition number behaving like instead of for a nodal basis. The proofs of our theorems do not need any regularity properties of neither the continuous problem nor its discretization. Especially we do not need the quasiuniformity of the employed triangulations. As the representation of a finite element function with respect to a hierarchical basis can be converted very easily and quickly to its representation with respect to a nodal basis, our results mean that the method of conjugate gradients needs onlyO(log n) steps andO(n log n) computer operations to reduce the energy norm of the error by a given factor if one uses hierarchical bases or related preconditioning procedures. Heren denotes the dimension of the finite element space and of the discrete linear problem to be solved.     

Compactness method in the finite element theory of nonlinear elliptic problems

Summary Finite element approximation of a nonlinear elliptic pseudomonotone second-order boundary value problem in a bounded nonpolygonal domain with mixed Dirichlet-Neumann boundary conditions is studied. In the discretization we approximate the domain by a polygonal one, use linear conforming triangular elements and evaluate integrals by numerical quadratures. We prove the solvability of the discrete problem and on the basis of compactness properties of the corresponding operator (which is not monotone in general) we prove the convergence of approximate solutions to an exact weak solutionuH ¹ ). No additional assumption on the regularity of the exact solution is needed.     

On finite element methods for the Neumann problem

Summary The Neumann problem for a second order elliptic equation with self-adjoint operator is considered, the unique solution of which is determined from projection onto unity. Two variational formulations of this problem are studied, which have a unique solution in the whole space. Discretization is done via the finite element method based on the Ritz process, and it is proved that the discrete solutions converge to one of the solutions of the continuous problem. Comparison of the two methods is done.     

Total flux estimates for a finite element approximation of the Dirichlet problem using the boundary penalty method

Summary This paper considers a fully practical piecewise linear finite element approximation of the Dirichlet problem for a second order self-adjoint elliptic equation,Au=f, in a smooth region< ⁿ (n=2 or 3) by the boundary penalty method. Using an unfitted mesh; that is ^h , an approximation of with dist (, ^h )Ch ² is not in general a union of elements; and assuminguH ⁴ () we show that one can recover the total flux across a segment of the boundary of with an error ofO(h ²⁾. We use these results to study a fully practical piecewise linear finite element approximation of an elliptic equation by the boundary penalty method when the prescribed data on part of the boundary is the total flux.Supported by a SERC research studentship     

The treatment of nonhomogeneous Dirichlet boundary conditions by thep-version of the finite element method

Summary The paper addresses the problem of the implementation of nonhomogeneous essential Dirichlet type boundary conditions in thep-version of the finite element method.Partially supported by the Office of Naval Research under Grant N-00014-85-K-0169Research partially supported by the Air Force Office of Scientific Research, Air Force Systems Command, USAF, under Grant Number AFOSR 85-0322     

Some new families of finite elements for the stokes equations

Summary We introduce a way of using the mixed finite element families of Raviart, Thomas and Nedelec [13, 14], and Brezzi et al. [5–7], for constructing stable and optimally convergent discretizations for the Stokes problem.     

Pointwise error estimates for a streamline diffusion finite element scheme

Summary Pointwise error estimates for a streamline diffusion scheme for solving a model convection-dominated singularly perturbed convection-diffusion problem are given. These estimates improve pointwise error estimates obtained by Johnson et al.[5].