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.     

Isoparametric finite-element approximation of a Steklov eigenvalue problem

We study the isoparametric variant of the finite-element method(FEM) for an approximation of Steklov eigenvalue problems forsecond-order, selfadjoint, elliptic differential operators.Error estimates for eigenfunctions and eigenvalues are derived.We prove the same estimate for eigenvalues as that obtainedin the case of conforming finite elements provided that theboundary of the domain is well approximated. Some algorithmicaspects arising from the FE isoparametric discretization ofthe Steklov problems are analysed. We finish this paper withnumerical results confirming the considered theory.     

On the first eigenvalue of a fourth order Steklov problem

We prove some results about the first Steklov eigenvalue d ₁ of the biharmonic operator in bounded domains. Firstly, we show that Fichera’s principle of duality (Fichera in Atti Accad Naz Lincei 19:411–418, 1955) may be extended to a wide class of nonsmooth domains. Next, we study the optimization of d ₁ for varying domains: we disprove a long-standing conjecture, we show some new and unexpected features and we suggest some challenging problems. Finally, we prove several properties of the ball.     

Local and parallel finite element algorithms for the Steklov eigenvalue problem

Based on the work of Xu and Zhou [Math Comput 69 (2000) 881–909], we propose and analyze in this article local and parallel finite element algorithms for the Steklov eigenvalue problem. We also prove a local error estimate which is suitable for the case that the locally refined region contains singular points lying on the boundary of domain, which is an improvement of the existing results. Numerical experiments are reported finally to validate our theoretical analysis. © 2015 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 399–417, 2016     

Steklov特征值问题的一种有效的Legendre-Galerkin谱逼近

本文给出Steklov特征值问题基于Legendre-Galerkin逼近的一种有效的谱方法.首先利用Legendre多项式构造了一组适当的基函数使得离散变分形式中的矩阵是稀疏的,然后推导了2维及3维情形下离散变分形式基于张量积的矩阵形式,由此可以快速地计算出离散的特征值和特征向量.文章还给出了误差分析和数值试验,数值结果表明本文提出的方法是稳定和有效的.     

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.     

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.     

Nonconforming finite element approximations of the Steklov eigenvalue problem and its lower bound approximations

The paper deals with error estimates and lower bound approximations of the Steklov eigenvalue problems on convex or concave domains by nonconforming finite element methods. We consider four types of nonconforming finite elements: Crouzeix-Raviart, Q ₁ ^rot , EQ ₁ ^rot and enriched Crouzeix-Raviart. We first derive error estimates for the nonconforming finite element approximations of the Steklov eigenvalue problem and then give the analysis of lower bound approximations. Some numerical results are presented to validate our theoretical results.     

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.     

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.

     

Spectral Galerkin approximation and rigorous error analysis for the Steklov eigenvalue problem in circular domain

In this paper, we present spectral Galerkin approximation and rigorous error analysis for the Steklov eigenvalue problem in a circular domain. First of all, we use the polar coordinate transformation and technique of separation of variables to reduce the problem to a sequence of equivalent 1‐dimensional eigenvalue problems that can be solved individually in parallel. Then, we derive the pole conditions and introduce weighted Sobolev space according to pole conditions. Together with the approximate properties of orthogonal polynomials, we prove the error estimates of approximate eigenvalues for each 1‐dimensional eigenvalue problem. Finally, we provide some numerical experiments to validate the theoretical results and algorithms.     

A Reilly inequality for the first Steklov eigenvalue

Let M be a compact submanifold with boundary of a Euclidean space or a Sphere. In this paper, we derive an upper bound for the first non-zero eigenvalue p₁ of Steklov problem on M in terms of the r-th mean curvatures of its boundary ∂M. The upper bound obtained is sharp.     

The Cauchy process and the Steklov problem

Let X_t be a Cauchy process in . We investigate some of the fine spectral theoretic properties of the semigroup of this process killed upon leaving a domain D. We establish a connection between the semigroup of this process and a mixed boundary value problem for the Laplacian in one dimension higher, known as the “Mixed Steklov Problem.” Using this we derive a variational characterization for the eigenvalues of the Cauchy process in D. This characterization leads to many detailed properties of the eigenvalues and eigenfunctions for the Cauchy process inspired by those for Brownian motion. Our results are new even in the simplest geometric setting of the interval (−1,1) where we obtain more precise information on the size of the second and third eigenvalues and on the geometry of their corresponding eigenfunctions. Such results, although trivial for the Laplacian, take considerable work to prove for the Cauchy processes and remain open for general symmetric α-stable processes. Along the way we present other general properties of the eigenfunctions, such as real analyticity, which even though well known in the case of the Laplacian, are not available for more general symmetric α-stable processes.     

The first Steklov eigenvalue, conformal geometry, and minimal surfaces

We consider the relationship of the geometry of compact Riemannian manifolds with boundary to the first nonzero eigenvalue σ₁ of the Dirichlet-to-Neumann map (Steklov eigenvalue). For surfaces Σ with genus γ and k boundary components we obtain the upper bound σ₁L(∂Σ)?2(γ+k)π. For γ=0 and k=1 this result was obtained by Weinstock in 1954, and is sharp. We attempt to find the best constant in this inequality for annular surfaces (γ=0 and k=2). For rotationally symmetric metrics we show that the best constant is achieved by the induced metric on the portion of the catenoid centered at the origin which meets a sphere orthogonally and hence is a solution of the free boundary problem for the area functional in the ball. For a general class of (not necessarily rotationally symmetric) metrics on the annulus, which we call supercritical, we prove that σ₁(Σ)L(∂Σ) is dominated by that of the critical catenoid with equality if and only if the annulus is conformally equivalent to the critical catenoid by a conformal transformation which is an isometry on the boundary. Motivated by the annulus case, we show that a proper submanifold of the ball is immersed by Steklov eigenfunctions if and only if it is a free boundary solution. We then prove general upper bounds for conformal metrics on manifolds of any dimension which can be properly conformally immersed into the unit ball in terms of certain conformal volume quantities. We show that these bounds are only achieved when the manifold is minimally immersed by first Steklov eigenfunctions. We also use these ideas to show that any free boundary solution in two dimensions has area at least π, and we observe that this implies the sharp isoperimetric inequality for free boundary solutions in the two-dimensional case.     

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.     

Recovery type a posteriori estimates and superconvergence for nonconforming FEM of eigenvalue problems

The main goal of this paper is to present recovery type a posteriori error estimators and superconvergence for the nonconforming finite element eigenvalue approximation of self-adjoint elliptic equations by projection methods. Based on the superconvergence results of nonconforming finite element for the eigenfunction we derive superconvergence and recovery type a posteriori error estimates of the eigenvalue. The results are based on some regularity assumption for the elliptic problem and are applicable to the lowest order nonconforming finite element approximations of self-adjoint elliptic eigenvalue problems with quasi-regular partitions. Therefore, the results of this paper can be employed to provide useful a posteriori error estimators in practical computing under unstructured meshes.     

Estimates of the first Steklov eigenvalue of properly embedded minimal hypersurfaces with free boundary

We consider a properly embedded minimal hypersurfacewith free boundary in a compact n-dimensional Riemannian manifold M be with nonnegative Ricci curvature and strictly convex boundary. Here, we obtain a new estimate from below for the first nonzero Steklov eigenvalue.