A two-grid discretization scheme for eigenvalue problems

A two-grid discretization scheme is proposed for solving eigenvalue problems, including both partial differential equations and integral equations. With this new scheme, the solution of an eigenvalue problem on a fine grid is reduced to the solution of an eigenvalue problem on a much coarser grid, and the solution of a linear algebraic system on the fine grid and the resulting solution still maintains an asymptotically optimal accuracy.

     

Acceleration of two-grid stabilized mixed finite element method for the Stokes eigenvalue problem

This paper provides an accelerated two-grid stabilized mixed finite element scheme for the Stokes eigenvalue problem based on the pressure projection. With the scheme, the solution of the Stokes eigenvalue problem on a fine grid is reduced to the solution of the Stokes eigenvalue problem on a much coarser grid and the solution of a linear algebraic system on the fine grid. By solving a slightly different linear problem on the fine grid, the new algorithm significantly improves the theoretical error estimate which allows a much coarser mesh to achieve the same asymptotic convergence rate. Finally, numerical experiments are shown to verify the high efficiency and the theoretical results of the new method.     

A Multilevel Correction Method for Steklov Eigenvalue Problem by Nonconforming Finite Element Methods

In this paper, a multilevel correction scheme is proposed to solve the Steklov eigenvalue problem by nonconforming finite element methods. With this new scheme, the accuracy of eigenpair approximations can be improved after each correction step which only needs to solve a source problem on finer finite element space and an Steklov eigenvalue problem on the coarsest finite element space. This correction scheme can increase the overall efficiency of solving eigenvalue problems by the nonconforming finite element method. Furthermore, as same as the direct eigenvalue solving by nonconforming finite element methods, this multilevel correction method can also produce the lower-bound approximations of the eigenvalues.     

An accurate a posteriori error estimator for the Steklov eigenvalue problem and its applications

In this paper, a type of accurate a posteriori error estimator is proposed for the Steklov eigenvalue problem based on the complementary approach, which provides an asymptotic exact estimate for the approximate eigenpair. Besides, we design a type of cascadic adaptive finite element method for the Steklov eigenvalue problem based on the proposed a posteriori error estimator. In this new cascadic adaptive scheme, instead of solving the Steklov eigenvalue problem in each adaptive space directly, we only need to do some smoothing steps for linearized boundary value problems on a series of adaptive spaces and solve some Steklov eigenvalue problems on a low dimensional space. Furthermore, the proposed a posteriori error estimator provides the way to refine mesh and control the number of smoothing steps for the cascadic adaptive method. Some numerical examples are presented to validate the efficiency of the algorithm in this paper.

     

Steklov eigenvalue problem and its applications An accurate a posteriori error estimator for the

In this paper, a type of accurate a posteriori error estimator is proposed for the Steklov eigenvalue problem based on the complementary approach, which provides an asymptotic exact estimate for the approximate eigenpair. Besides, we design a type of cascadic adaptive finite element method for the Steklov eigenvalue problem based on the proposed a posteriori error estimator. In this new cascadic adaptive scheme, instead of solving the Steklov eigenvalue problem in each adaptive space directly, we only need to do some smoothing steps for linearized boundary value problems on a series of adaptive spaces and solve some Steklov eigenvalue problems on a low dimensional space. Furthermore, the proposed a posteriori error estimator provides the way to refine meshes and control the number of smoothing steps for the cascadic adaptive method. Some numerical examples are presented to validate the efficiency of the algorithm in this paper.     

基于形状优化框架下的Steklov特征值问题研究

<正>1引言特征值问题在应用数学分支和工程中,尤其是在最优设计问题中,有很多的应用,所以特征值问题的最优化已经有了较为深入的研究,见在我们的研究当中,最优设计问题常常以一种指定载荷的设计下、能量的极小化问题的形式出现.在大多数关于最优设计的文章里面,我们更重视在一个固定载荷下条件下结构的最     

Local and Parallel Finite Element Algorithms for Eigenvalue Problems

Abstract Some new local and parallel finite element algorithms are proposed and analyzed in this paper foreigenvalue problems.With these algorithms, the solution of an eigenvalue problem on a fine grid is reduced tothe solution of an eigenvalue problem on a relatively coarse grid together with solutions of some linear algebraicsystems on fine grid by using some local and parallel procedure.A theoretical tool for analyzing these algorithmsis some local error estimate that is also obtained in this paper for finite element approximations of eigenvectorson general shape-regular grids.     

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.     

A Fast and Stable Algorithm for Linear Parabolic Partial Differential Equations

In the paper, a two-grid finite element scheme is discussed for distributed optimal control governed by elliptic equations. With this new scheme, the solution of the elliptic optimal control problem on a fine grid is reduced to the solution of the elliptic optimal control problem on a much coarser grid and the solution of a linear algebraic system on the fine grid and the resulting solution still maintains an asymptotically optimal accuracy. Finally, numerical experiments are carried out to confirm the considered theory.     

Steklov-Neumann eigenproblems and nonlinear elliptic equations with nonlinear boundary conditions

We study the solvability of nonlinear second order elliptic partial differential equations with nonlinear boundary conditions. We introduce the notion of “eigenvalue-lines” in the plane; these eigenvalue-lines join each Steklov eigenvalue to the first eigenvalue of the Neumann problem with homogeneous boundary condition. We prove existence results when the nonlinearities involved asymptotically stay, in some sense, below the first eigenvalue-lines or in a quadrilateral region (depicted in Fig. 1) enclosed by two consecutive eigenvalue-lines. As a special case we derive the so-called nonresonance results below the first Steklov eigenvalue as well as between two consecutive Steklov eigenvalues. The case in which the eigenvalue-lines join each Neumann eigenvalue to the first Steklov eigenvalue is also considered. Our method of proof is variational and relies mainly on minimax methods in critical point theory.     

Steklov特征值问题的边界元近似

本文将Ｌａｐｌａｃｅ算子的Ｓｔｅｋｌｏｖ特征值问题归化为一个边界变分问题，从而使原问题的空间维数降低了一维，基于此变分问题给出了Ｓｔｅｋｌｏｖ特征值问题的边界元近似解，计算实例表明此方法是十分有效的。     

Simulation of a nonlinear Steklov eigenvalue problem using finite-element approximation

Elliptic problems with parameters in the boundary conditions are called Steklov problems. With the tool of computational approximation (finite-element method), we estimate the solution of a nonlinear Steklov eigenvalue problem for a second-order, self-adjoint, elliptic differential problem. We discussed the behavior of the nonlinear problem with the help of computational results using Matlab.     

Three-scale finite element eigenvalue discretizations

Some three-scale finite element discretization schemes are proposed and analyzed in this paper for a class of elliptic eigenvalue problems on tensor product domains. With these schemes, the solution of an eigenvalue problem on a fine grid may be reduced to the solutions of eigenvalue problems on a relatively coarse grid and some partially mesoscopic grids, together with the solutions of linear algebraic systems on a globally mesoscopic grid and several partially fine grids. It is shown theoretically and numerically that this type of discretization schemes not only significantly reduce the number of degrees of freedom but also produce very accurate approximations. AMS subject classification (2000)  65N15, 65N25, 65N30, 65N50     

BOUNDARY ELEMENT APPROXIMATION OF STEKLOV EIGENVALUE PROBLEM FOR HELMHOLTZ EQUATION

1.IntroductionWeconsiderthefollowingStekloveigenvalueproblem:FindnonzerouandnumberA,suchthat--An u=0,infi,on,on=An,onr,(1.1)wherefiCRZisaboundeddomainwithsufficientsmoothboundaryr,4istheonoutwardllormalderivativeonr.CourantandHilb..tll]studiedthefollowingeigenvalueproblem:onac=0,infi,--~An,onr,(1.2)OnwhichwasreducedtotheeigenvalueproblemofanintegralequationbyusingtheGreen'sfunctionofAn=0withNuemannboundarycondition.FromFredholmtheorem,weknowthat(1)theproblem(1.2)hasinfinitenumberofeigenv…     

The Mechanical Quadrature Methods and Their Extrapolation for Solving BIE of Steklov Eigenvalue Problems

By means of the potential theory Steklov eigenvalue problems are transformed into general eigenvalue problems of boundary integral equations (BIE) with the logarithmic singularity.Using the quadrature rules, the paper presents quadrature methods for BIE of Steklov eigenvalue problem, which possess high accuracies O(h^3) and low computing complexities. Moreover, an asymptotic expansion of the errors with odd powers is shown. Using h^3-Richardson extrapolation, we can not only improve the accuracy order of approximations, but also derive a posterior estimate as adaptive algorithms. The efficiency of the algorithm is illustrated by some examples.     

TWO-GRID DISCRETIZATION SCHEMES OF THE NONCONFORMING FEM FOR EIGENVALUE PROBLEMS

This paper extends the two-grid discretization scheme of the conforming finite elements proposed by Xu and Zhou （Math. Comput., 70 （2001）, pp.17-25） to the nonconforming finite elements for eigenvalue problems. In particular, two two-grid discretization schemes based on Rayleigh quotient technique are proposed. By using these new schemes, the solution of an eigenvalue problem on a fine mesh is reduced to that on a much coarser mesh together with the solution of a linear algebraic system on the fine mesh. The resulting solution still maintains an asymptotically optimal accuracy. Comparing with the two-grid discretization scheme of the conforming finite elements, the main advantages of our new schemes are twofold when the mesh size is small enough. First, the lower bounds of the exact eigenvalues in our two-grid discretization schemes can be obtained. Second, the first eigenvalue given by the new schemes has much better accuracy than that obtained by solving the eigenvalue problems on the fine mesh directly.     

On the first eigenvalue of the Dirichlet-to-Neumann operator on forms

We study a Dirichlet-to-Neumann eigenvalue problem for differential forms on a compact Riemannian manifold with smooth boundary. This problem is a natural generalization of the classical Dirichlet-to-Neumann (or Steklov) problem on functions. We derive a number of upper and lower bounds for the first eigenvalue in several contexts: many of these estimates will be sharp, and for some of them we characterize equality. We also relate these new eigenvalues with those of other operators, like the Hodge Laplacian or the biharmonic Steklov operator.     

Rearrangements and minimization of the principal eigenvalue of a nonlinear Steklov problem

This paper, motivated by Del Pezzo et al. (2006) [1], discusses the minimization of the principal eigenvalue of a nonlinear boundary value problem. In the literature, this type of problem is called Steklov eigenvalue problem. The minimization is implemented with respect to a weight function. The admissible set is a class of rearrangements generated by a bounded function. We merely assume the generator is non-negative in contrast to [1], where the authors consider weights which are positively away from zero, in addition to being two-valued. Under this generality, more physical situations can be modeled. Finally, using rearrangement theory developed by Geoffrey Burton, we are able to prove uniqueness of the optimal solution when the domain of interest is a ball.     

The First Biharmonic Steklov Eigenvalue: Positivity Preserving and Shape Optimization

We consider the Steklov problem for the linear biharmonic equation. We survey existing results for the positivity preserving property to hold. These are connected with the first Steklov eigenvalue. We address the problem of minimizing this eigenvalue among suitable classes of domains. We prove the existence of an optimal convex domain of fixed measure.