A two-grid discretization scheme for the Steklov eigenvalue problem

In the paper, a two-grid discretization scheme is discussed for the Steklov eigenvalue problem. With the scheme, the solution of the Steklov eigenvalue problem on a fine grid is reduced to the solution of the Steklov eigenvalue problem on a much coarser grid and the solution of a linear algebraic system on the fine grid. Using spectral approximation theory, it is shown theoretically that the two-scale scheme is efficient and the approximate solution obtained by the scheme maintains the asymptotically optimal accuracy. Finally, numerical experiments are carried out to confirm the considered theory.     

A two-grid discretization method for decoupling systems of partial differential equations

In this paper, we propose a two-grid finite element method for solving coupled partial differential equations, e.g., the Schrödinger-type equation. With this method, the solution of the coupled equations on a fine grid is reduced to the solution of coupled equations on a much coarser grid together with the solution of decoupled equations on the fine grid. It is shown, both theoretically and numerically, that the resulting solution still achieves asymptotically optimal accuracy.

     

Generalized Rayleigh quotient and finite element two-grid discretization schemes

This study discusses generalized Rayleigh quotient and high efficiency finite element discretization schemes. Some results are as follows: 1) Rayleigh quotient accelerate technique is extended to nonselfadjoint problems. Generalized Rayleigh quotients of operator form and weak form are defined and the basic relationship between approximate eigenfunction and its generalized Rayleigh quotient is established. 2) New error estimates are obtained by replacing the ascent of exact eigenvalue with the ascent of fin...     

A new superconvergent collocation method for eigenvalue problems

Here we propose a new method based on projections for the approximate solution of eigenvalue problems. For an integral operator with a smooth kernel, using an interpolatory projection at Gauss points onto the space of (discontinuous) piecewise polynomials of degree , we show that the proposed method exhibits an error of the order of for eigenvalue approximation and of the order of for spectral subspace approximation. In the case of a simple eigenvalue, we show that by using an iteration technique, an eigenvector approximation of the order can be obtained. This improves upon the order for eigenvalue approximation in the collocation/iterated collocation method and the orders and for spectral subspace approximation in the collocation method and the iterated collocation method, respectively. We illustrate this improvement in the order of convergence by numerical examples.

     

The projection Kantorovich method for eigenvalue problems

A modified projection method for eigenvalues and eigenvectors of a compact operator T on a Banach space is defined and analyzed. The method is derived from the Kantorovich regularization for second-kind equations involving the operator T. It is shown that when T is a positive self-adjoint operator on a Hilbert space and the projections are orthogonal, the modified method always gives eigenvalue approximations which are at least as accurate as those obtained from the projection method. For self-adjoint operators, the required computation is essentially the same for both methods. Numerical computations for two integral operators are presented. One has T positive self-adjoint, while in the other T is not self-adjoint. In both cases the eigenvalue approximations from the modified method are more accurate than those from the projection method.     

Positive solutions for systems of nonlinear eigenvalue problems for functional differential equations

Values of?λ?are determined for which there exist positive solutions of the system of functional differential equations, u″?+?λa(t)f(v _t )?=?0,v″?+?λb(t)g(u _t )?=?0, for 0?t?u(s)?=?v(s)?=?φ(s), ?r?≤?s?≤?0, and the boundary conditions u(0)?=?v(0)?=?φ(0)?=?u(1)?=?v(1)?=?0. A Guo–Krasnosel'skii fixed point theorem is applied.     

A two-grid method with expanded mixed element for nonlinear reaction-diffusion equations

Expanded mixed finite element approximation of nonlinear reaction-diffusion equations is discussed. The equations considered here are used to model the hydrologic and bio-geochemical phenomena. To linearize the mixed-method equations, we use a two-grid method involving a small nonlinear system on a coarse gird of size H and a linear system on a fine grid of size h. Error estimates are derived which demonstrate that the error is O(△t + h k+1 + H 2k+2 d/2 ) (k ≥ 1), where k is the degree of the approximating space for the primary variable and d is the spatial dimension. The above estimates are useful for determining an appropriate H for the coarse grid problems.     

A two-grid finite element method for the Allen-Cahn equation with the logarithmic potential

In this paper, we present a two-grid finite element method for the Allen-Cahn equation with the logarithmic potential. This method consists of two steps. In the first step, based on a fully implicit finite element method, the Allen-Cahn equation is solved on a coarse grid with mesh size H. In the second step, a linearized system whose nonlinear term is replaced by the value of the first step is solved on a fine grid with mesh size h. We give the energy stabilities of the traditional finite element method and the two-grid finite element method. The optimal convergence order of the two-grid finite element method in H¹ norm is achieved when the mesh sizes satisfy h = O(H²). Numerical examples are given to demonstrate the validity of the proposed scheme. The results show that the two-grid method can save the CPU time while keeping the same convergence rate.     

Boundary value problems for higher order linear impulsive differential equations

In this paper higher order linear impulsive differential equations with fixed moments of impulses subject to linear boundary conditions are studied. Green's formula is defined for piecewise differentiable functions. Properties of Green's functions for higher order impulsive boundary value problems are introduced. An appropriate example of the Green's function for a boundary value problem is provided. Furthermore, eigenvalue problems and basic properties of eigensolutions are considered.     

A large time‐step implicit moving mesh scheme for moving boundary problems

Velocity‐based moving mesh methods update the mesh at each time level by using a velocity equation with a time‐stepping scheme. A particular velocity‐based moving mesh method, based on conservation, uses explicit time‐stepping schemes with small time steps to avoid mesh tangling. However, this can prove to be impractical when long‐term behavior of the solution is of interest. Here, we present a semi‐implicit time‐stepping scheme which manipulates the structure of the velocity equation such that it resembles a variable‐coefficient heat equation. This enables the use of maximum/minimum principle which ensures that mesh tangling is avoided. It is also shown that this semi‐implicit scheme can be extended to a fully implicit time‐stepping scheme. Thus, the time‐step restriction imposed by explicit schemes is overcome without sacrificing mesh structure. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 321–338, 2014     

A direct approach to the finite element solution of elliptic optimal control problems

A general framework is developed for the finite element solution of optimal control problems governed by elliptic nonlinear partial differential equations. Typical applications are steady‐state problems in nonlinear continuum mechanics, where a certain property of the solution (a function of displacements, temperatures, etc.) is to be minimized by applying control loads. In contrast to existing formulations, which are based on the “adjoint state,” the present formulation is a direct one, which does not use adjoint variables. The formulation is presented first in a general nonlinear setting, then specialized to a case leading to a sequence of quadratic programming problems, and then specialized further to the unconstrained case. Linear governing partial differential equations are also considered as a special case in each of these categories. © 1999 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 15:371–388, 1999     

Positive solutions of fourth-order nonlinear singular Sturm-Liouville eigenvalue problems

We consider the existence of positive solutions for the following fourth-order singular Sturm-Liouville eigenvalue problems

     

An efficient discretization scheme for solving ill-posed problems

In this paper, we consider a finite-dimensional approximation scheme combined with Tikhonov regularization for solving ill-posed problems. Error estimates are obtained by an a priori parameter choice strategy and the results show that the amount of discrete information required for solving the problem is far less than the traditional finite-dimensional approach.     

Error estimates using the cell discretization method for second-order hyperbolic equations

The cell discretization algorithm provides approximate solutions to second-order hyperbolic equations with coefficients independent of time. We obtain error estimates that show general convergence for homogeneous problems using semi-discrete approximations. A polynomial implementation of the algorithm is described that is a nonconforming extension of the finite element method that can also produce the continuous approximations of an h–p finite element method. Numerical tests are made that confirm the theoretical estimates. © 1997 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 13: 531–548, 1997     

A Two-Level Method for Nonsymmetric Eigenvalue Problems

A two-level discretization method for eigenvalue problems is studied. Compared to the standard Galerkin finite element discretization technique performed on a fine grid this method discretizes the eigenvalue problem on a coarse grid and obtains an improved eigenvector (eigenvalue) approximation by solving only a linear problem on the fine grid (or two linear problems for the case of eigenvalue approximation of nonsymmetric problems). The improved solution has the asymptotic accuracy of the Galerkin discretization solution. The link between the method and the iterated Galerkin method is established. Error estimates for the general nonsymmetric case are derived.     

Mass‐lumping or not mass‐lumping for eigenvalue problems

In this article we analyze the effect of mass‐lumping in the linear triangular finite element approximation of second‐order elliptic eigenvalue problems. We prove that the eigenvalue obtained by using mass‐lumping is always below the one obtained with exact integration. For singular eigenfunctions, as those arising in non convex polygons, we prove that the eigenvalue obtained with mass‐lumping is above the exact eigenvalue when the mesh size is small enough. So, we conclude that the use of mass‐lumping is convenient in the singular case. When the eigenfunction is smooth several numerical experiments suggest that the eigenvalue computed with mass‐lumping is below the exact one if the mesh is not too coarse. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 19: 653–664, 2003     

Nonlinear eigenvalue problems for quasilinear operators on unbounded domains

We prove several existence results for eigenvalue problems involving the p-Laplacian and a nonlinear boundary condition on unbounded domains. We treat the non-degenerate subcritical case and the solutions are found in an appropriate weighted Sobolev space. Received May 2000     

Complete flux scheme for parabolic singularly perturbed differential‐difference equations

In this study, we investigate the concept of the complete flux (CF) obtained as a solution to a local boundary value problem (BVP) for a given parabolic singularly perturbed differential‐difference equation (SPDDE) with modified source term to propose an efficient complete flux‐finite volume method (CF‐FVM) for parabolic SPDDE which is μ‐ and ?‐uniform method where μ, ? are shift and perturbation parameters, respectively. The proposed numerical method is shown to be consistent, stable, and convergent and has been successfully implemented on three test problems.