Numerical solution for exterior problems

Summary We solve the Helmholtz equation in an exterior domain in the plane. A perfect absorption condition is introduced on a circle which contains the obstacle. This boundary condition is given explicitly by Bessel functions. We use a finite element method in the bounded domain. An explicit formula is used to compute the solution out of the circle. We give an error estimate and we present relevant numerical results.     

Monotone iterative methods for finite difference system of reaction-diffusion equations

Summary This paper presents an existence-comparison theorem and an iterative method for a nonlinear finite difference system which corresponds to a class of semilinear parabolic and elliptic boundary-value problems. The basic idea of the iterative method for the computation of numerical solutions is the monotone approach which involves the notion of upper and lower solutions and the construction of monotone sequences from a suitable linear discrete system. Using upper and lower solutions as two distinct initial iterations, two monotone sequences from a suitable linear system are constructed. It is shown that these two sequences converge monotonically from above and below, respectively, to a unique solution of the nonlinear discrete equations. This formulation leads to a well-posed problem for the nonlinear discrete system. Applications are given to several models arising from physical, chemical and biological systems. Numerical results are given to some of these models including a discussion on the rate of convergence of the monotone sequences.     

A multi-grid algorithm for mixed problems with penalty

Summary In this paper we describe a multi-grid algorithm for the finite element approximation of mixed problems with penalty by the MINI-element. It is proved that the convergence rate of the algorithm is bounded away from 1 independently of the meshsize and of the penalty parameter. For convenience, we only discuss Jacobi relaxation as smoothing operator in detail.The paper was written during the author's stay at the Ruhr-Universität Bochum and revised by D. Braess after the author's return to China     

Spectral methods with sparse matrices

Summary Spectral methods employ global polynomials for approximation. Hence they give very accurate approximations for smooth solutions. Unfortunately, for Dirichlet problems the matrices involved are dense and have condition numbers growing asO(N ⁴) for polynomials of degree N in each variable. We propose a new spectral method for the Helmholtz equation with a symmetric and sparse matrix whose condition number grows only asO(N ²). Certain algebraic spectral multigrid methods can be efficiently used for solving the resulting system. Numerical results are presented which show that we have probably found the most effective solver for spectral systems.     

A nonconforming combined method for solving Laplace's boundary value problems with singularities

Summary For solving Laplace's boundary value problems with singularities, a nonconforming combined approach of the Ritz-Galerkin method and the finite element method is presented. In this approach, singular functions are chosen to be admissible functions in the part of a solution domain where there exist singularities; and piecewise linear functions are chosen to be admissible functions in the rest of the solution domain. In addition, the admissible functions used here are constrained to be continuous only at the element nodes on the common boundary of both methods. This method is nonconforming; however, the nonconforming effect does not result in larger errors of numerical solutions as long as a suitable coupling strategy is used.In this paper, we will develop such an approach by using a new coupling strategy, which is described as follows: IfL+1=O(|lnh|), the average errors of numerical solutions and their generalized derivatives are stillO(h), whereh is the maximal boundary length of quasiuniform triangular elements in the finite element method, andL+1 is the total number of singular admissible functions in the Ritz-Galerkin method. The coupling relation,L+1=O(|lnh|), is significant because only a few singular functions are required for a good approximation of solutions.This material is from Chapter 5 in my Ph.D. thesis: Numerical Methods for Elliptic Boundary Value Problems with Singularities. Part I: Boundary Methods for Solving Elliptic Problems with Singularities. Part II: Nonconforming Combinations for Solving Elliptic Problems with Singularities, the Department of Mathematics and Applied Mathematics, University of Toronto, May 1986     

Stabilized mixed methods for the Stokes problem

Summary The solution of the Stokes problem is approximated by three stabilized mixed methods, one due to Hughes, Balestra, and Franca and the other two being variants of this procedure. In each case the bilinear form associated with the saddle-point problem of the standard mixed formulation is modified to become coercive over the finite element space. Error estimates are derived for each procedure.Dedicated to Ivo Babuka on the occasion of his sixtieth birthday     

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.     

On some boundary element methods for the heat equation

Summary The object of this paper is to study some boundary element methods for the heat equation. Two approaches are considered. The first, based on the heat potential, has been studied numerically by previous authors. Here the convergence analysis in one space dimension is presented. In the second approach, the heat equation is first descretized in time and the resulting elliptic problem is put in the boundary formulation. A straight forward implicit method and Crank-Nicolson's method are thus studied. Again convergence in one space dimension is proved.     

The instability of some gradient methods for ill-posed problems

Summary For the solution of linear ill-posed problems some gradient methods like conjugate gradients and steepest descent have been examined previously in the literature. It is shown that even though these methods converge in the case of exact data their instability makes it impossible to base a-priori parameter choice regularization methods upon them.     

AC 0-collocation-like method for two-point boundary value problems

Summary A method of a collocation type based onC ⁰-piecewise polynomial spaces is presented for a two-point boundary value problem of the second order. The method has an optimal order of convergence under smoothness requirements on the exact solution which are weaker than forC ¹-collocation methods. If the differential operator is symmetric, a modification of this method leads to a symmetric system of linear equations. It is shown that if the collocation solution is a piecewise polynomial of degree not greater thanr, the method is stable and convergent with orderh ^r inH ¹-norm. A similar symmetric modification forC ⁰-colloction-finite element method [7] is also obtained. Superconvergence at the nodes is established.     

Numerical computation of least constants for the Sobolev inequality

Summary Least constantsc for the well-known Sobolev inequality fcf _{m, G} ,fH ^m (G) are obtained in closed form by a reproducing kernel technique, where the Sobolev spaceH ^m (G) for a domainG in ⁿ is defined as the completion ofC ^m (G) with respect to the Sobolev norm given by , where is the norm ofL ₂ (G) and is the supremum norm onG. Numerical values for the case whereG is the ⁿ are given.     

On the regularization of projection methods for solving III-posed problems

Summary In this paper we consider a class of regularization methods for a discretized version of an operator equation (which includes the case that the problem is ill-posed) with approximately given right-hand side. We propose an a priori- as well as an a posteriori parameter choice method which is similar to the discrepancy principle of Ivanov-Morozov. From results on fractional powers of selfadjoint operators we obtain convergence rates, which are (in many cases) the same for both parameter choices.     

Mixed finite elements for second order elliptic problems in three variables

Summary Two families of mixed finite elements, one based on simplices and the other on cubes, are introduced as alternatives to the usual Raviart-Thomas-Nedelec spaces. These spaces are analogues of those introduced by Brezzi, Douglas, and Marini in two space variables. Error estimates inL ² andH ^–s are derived.     

Fully discrete Galerkin approximations of parabolic boundary-value problems with nonsmooth boundary data

Summary In this paper we study the convergence properties of a fully discrete Galerkin approximation with a backwark Euler time discretization scheme. An approach based on semigroup theory is used to deal with the nonsmooth Dirichlet boundary data which cannot be handled by standard techniques. This approach gives rise to optimal rates of convergence inL _p[O,T;L ₂()] norms for boundary conditions inL _p[O,T;L ₂()], 1p.     

A relaxation procedure for domain decomposition methods using finite elements

Summary We present the convergence analysis of a new domain decomposition technique for finite element approximations. This technique was introduced in [11] and is based on an iterative procedure among subdomains in which transmission conditions at interfaces are taken into account partly in one subdomain and partly in its adjacent. No global preconditioner is needed in the practice, but simply single-domain finite element solvers are required. An optimal strategy for an automatic selection of a relaxation parameter to be used at interface subdomains is indicated. Applications are given to both elliptic equations and incompressible Stokes equations.     

On the boundary element method for some nonlinear boundary value problems

Summary Here we analyse the boundary element Galerkin method for two-dimensional nonlinear boundary value problems governed by the Laplacian in an interior (or exterior) domain and by highly nonlinear boundary conditions. The underlying boundary integral operator here can be decomposed into the sum of a monotoneous Hammerstein operator and a compact mapping. We show stability and convergence by using Leray-Schauder fixed-point arguments due to Petryshyn and Neas.Using properties of the linearised equations, we can also prove quasioptimal convergence of the spline Galerkin approximations.This work was carried out while the first author was visiting the University of Stuttgart     

Regularity theorems and optimal error estimates for linear parabolic Cauchy problems

Summary We prove some regularity results for the solution of a linear abstract Cauchy problem of parabolic type. As an application, we study the approximation of the solution by means of an implicit-Euler discretization in time, which is stable with respect to a wide class of Galerkin approximation methods in space. The error is evaluated in norms of typeL ²(0, ,L ²) andL ²(0, ,V)(H ₀₀ ^1/2 (0, ,H)+H ¹(0, ,V)), whereVHV are Hilbert spaces (the embeddings are supposed to be dense and continuous). We prove error estimates which are optimal with respect to the regularity assumptions on the right-hand side of the equation.The author was supported by G.N.A.F.A. and I.A.N. of C.N.R. and by M.P.I.     

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 finite element lumped mass scheme for solving eigenvalue problems of circular arches

Summary This study is a continuation of a previous paper [4] in which the numerical results are given by using single precision arithmetic. In this paper, we show the numerical results which experess the sharper convergence properties than those of [4], by using double precision arithmetic.Dedicated to Prof. Masaya Yamaguti on the occasion of his 60th birthday     

A numerical method for detecting singular minimizers of multidimensional problems in nonlinear elasticity

Summary In this paper we describe and analyse a numerical method that detects singular minimizers and avoids the Lavrentiev phenomenon for three dimensional problems in nonlinear elasticity. This method extends to three dimensions the corresponding one dimensional method of Ball and Knowles.