This paper proposes a modified Morley element method for a fourth order elliptic singular perturbation problem. The method also uses Morley element or rectangle Morley element, but linear or bilinear approximation of finite element functions is used in the lower part of the bilinear form. It is shown that the modified method converges uniformly in the perturbation parameter.

This paper presents a class of high resolution local time step schemes for nonlinear hyperbolic conservation laws and the closely related convection-diffusion equations, by projecting the solution increments of the underlying partial differential equations (PDE) at each local time step. The main advantages are that they are of good consistency, and it is convenient to implement them. The schemes are $L^\infty$ stable, satisfy a cell entropy inequality, and may be extended to the initial boundary value problem of general unsteady PDEs with higher-order spatial derivatives. The high resolution schemes are given by combining the reconstruction technique with a second order TVD Runge-Kutta scheme or a Lax-Wendroff type method, respectively. The schemes are used to solve a linear convection-diffusion equation, the nonlinear inviscid Burgers' equation, the one- and two-dimensional compressible Euler equations, and the two-dimensional incompressible Navier-Stokes equations. The numerical results show that the schemes are of higher-order accuracy, and efficient in saving computational cost, especially, for the case of combining the present schemes with the adaptive mesh method [15]. The correct locations of the slow moving or stronger discontinuities are also obtained, although the schemes are slightly nonconservative.

In this paper we present some new absolute and relative perturbation bounds for the eigenvalue for arbitrary matrices, which improves some recent results. The eigenvalue inclusion region is also discussed.

The steepest descent method is the simplest gradient method for optimization. It is well known that exact line searches along each steepest descent direction may converge very slowly. An important result was given by Barzilar and Borwein, which is proved to be superlinearly convergent for convex quadratic in two dimensional space, and performs quite well for high dimensional problems. The BB method is not monotone, thus it is not easy to be generalized for general nonlinear functions unless certain non-monotone techniques being applied. Therefore, it is very desirable to find stepsize formulae which enable fast convergence and possess the monotone property. Such a stepsize $\alpha_k$ for the steepest descent method is suggested in this paper. An algorithm with this new stepsize in even iterations and exact line search in odd iterations is proposed. Numerical results are presented, which confirm that the new method can find the exact solution within 3 iteration for two dimensional problems. The new method is very efficient for small scale problems. A modified version of the new method is also presented, where the new technique for selecting the stepsize is used after every two exact line searches. The modified algorithm is comparable to the Barzilar-Borwein method for large scale problems and better for small scale problems.

This paper provides a proof for the uniform convergence rate (independently of the number of mesh levels) for the nonnested V-cycle multigrid method for nonsymmetric and indefinite second-order elliptic problems.

The main aim of this paper is to study the convergence of a nonconforming triangular plate element-Morley element under anisotropic meshes. By a novel approach, an explicit bound for the interpolation error is derived for arbitrary triangular meshes (which even need not satisfy the maximal angle condition and the coordinate system condition ), the optimal consistency error is obtained for a family of anisotropically graded finite element meshes.

This paper deals with the relationship between asymptotic behavior of the numerical solution and that of the true solution itself for fixed step-sizes. The numerical solution is viewed as a dynamical system in which the step-size acts as a parameter. We present a unified approach to look for bifurcations from the steady solutions into spurious solutions as step-size varies.

In this paper, we study natural boundary reduction for Laplace equation with Dirichlet or Neumann boundary condition in a three-dimensional unbounded domain, which is the outside domain of a prolate spheroid. We express the Poisson integral formula and natural integral operator in a series form explicitly. Thus the original problem is reduced to a boundary integral equation on a prolate spheroid. The variational formula for the reduced problem and its well-posedness are discussed. Boundary element approximation for the variational problem and its error estimates, which have relation to the mesh size and the terms after the series is truncated, are also presented. Two numerical examples are presented to demonstrate the effectiveness and error estimates of this method.

A nonoverlapping domain decomposition iterative procedure is developed and analyzed for generalized Stokes problems and their finite element approximate problems in $\boldsymbol{R}^N$(N=2,3). The method is based on a mixed-type consistency condition with two parameters as a transmission condition together with a derivative-free transmission data updating technique on the artificial interfaces. The method can be applied to a general multi-subdomain decomposition and implemented on parallel machines with local simple communications naturally.