Symmetry theorems for the overdetermined eigenvalue problems

The well-known Schiffer conjecture saying that for a smooth bounded domain Ω⊂Rn, if there exists a positive Neumann eigenvalue such that the corresponding Neumann eigenfunction u is constant on the boundary of Ω, then Ω is a ball. In this paper, we shall prove that the Schiffer conjecture holds if and only if the third order interior normal derivative of the corresponding Neumann eigenfunction is constant on the boundary. We also prove a similar result to the Berenstein conjecture for the overdetermined Dirichlet eigenvalue problem.     

A duality theorem for an overdetermined eigenvalue problem

We prove an equivalent integral formulation of an eigenvalue problem for the Laplacian operator, with overdetermined boundary conditions. A special case of this problem, that with homogeneous Neumann condition, is known in the literature as Schiffer's problem, due to the still open conjecture, attributed to him, that the only domains possessing nontrivial solutions aren-balls. It is hoped that this integral formulation may provide a new tool with which to analyse Schiffer's conjecture.Research sponsored by NSERC of Canada via a post-doctoral fellowship.     

An anisotropic eigenvalue problem of Stekloff type and weighted Wulff inequalities

We study the Stekloff eigenvalue problem for the so-called pseudo p-Laplacian operator. After proving the existence of an unbounded sequence of eigenvalues, we focus on the first nontrivial eigenvalue σ_2,p , providing various equivalent characterizations for it. We also prove an upper bound for σ_2,p in terms of geometric quantities. The latter can be seen as the nonlinear analogue of the Brock–Weinstock inequality for the first nontrivial Stekloff eigenvalue of the (standard) Laplacian. Such an estimate is obtained by exploiting a family of sharp weighted Wulff inequalities, which are here derived and appear to be interesting in themselves.     

Variational formula and overdetermined problem for the principle eigenvalue of k-Hessian operator

We first deduce the first variational formula and some overdetermined problems for the principle eigenvalue of the k-Hessian operator, and then prove Serrin type symmetry result for our overdetermined problems.     

Cauchy problem for overdetermined systems

Sunto Si caratterizzano le nozioni di direzioni caratteristiche, formalmente caratteristiche, di iperbolicità e di evoluzione in una, direzione per sistemi a coefficienti costanti, connesse allo studio delle soluzioni del problema di Cauchy in un semispazio.     

Symmetry for a general class of overdetermined elliptic problems

Let \({\Omega}\) a bounded domain in \({\mathbb{R} ^N }\), and let \({u\in C^1 (\overline{\Omega})}\) a weak solution of the following overdetermined BVP: \({-\nabla (g(|\nabla u|)|\nabla u|^{-1}\nabla u)=f(|x|,u)}\), \({ u > 0 }\) in \({\Omega }\) and \({u=0, \ |\nabla u(x)|=\lambda (|x|)}\) on \({\partial \Omega }\), where \({g\in C([0,+\infty)\cap C^1 ((0,+\infty ) ) }\) with \({g(0)=0}\), \({g'(t) > 0}\) for \({t > 0}\), \({f\in C([0,+\infty ) \times [0, +\infty ) )}\), f is nonincreasing in \({|x|}\), \({\lambda \in C([0, +\infty )) }\) and \({\lambda }\) is positive and nondecreasing. We show that \({\Omega }\) is a ball and u satisfies some “local” kind of symmetry. The proof is based on the method of continuous Steiner symmetrization.     

Radial symmetry and uniqueness for an overdetermined problem

Consider a function u, harmonic in a ring‐shaped domain and taking two constant (distinct) values on the two connected components of the boundary. If we know in advance that one of the components is a sphere, and that u satisfies some overdetermined condition on the other one, can we conclude that u is radial? This paper answers this question for certain overdetermined conditions on the gradient of u, generalizing some previous results. Conditions depending on the principal curvatures of the boundary are also investigated. Existence and uniqueness of a radial solution to the overdetermined problem are discussed. Some extensions to ellipsoidal domains, as well as to quasilinear elliptic equations, are carried out. Copyright © 2001 John Wiley & Sons, Ltd.     

A linear eigenvalue algorithm for the nonlinear eigenvalue problem

The Arnoldi method for standard eigenvalue problems possesses several attractive properties making it robust, reliable and efficient for many problems. The first result of this paper is a characterization of the solutions to an arbitrary (analytic) nonlinear eigenvalue problem (NEP) as the reciprocal eigenvalues of an infinite dimensional operator denoted ${\mathcal {B}}$ . We consider the Arnoldi method for the operator ${\mathcal {B}}$ and show that with a particular choice of starting function and a particular choice of scalar product, the structure of the operator can be exploited in a very effective way. The structure of the operator is such that when the Arnoldi method is started with a constant function, the iterates will be polynomials. For a large class of NEPs, we show that we can carry out the infinite dimensional Arnoldi algorithm for the operator ${\mathcal {B}}$ in arithmetic based on standard linear algebra operations on vectors and matrices of finite size. This is achieved by representing the polynomials by vector coefficients. The resulting algorithm is by construction such that it is completely equivalent to the standard Arnoldi method and also inherits many of its attractive properties, which are illustrated with examples.     

Symmetry theorems for some overdetermined boundary value problems on ring domains

In this paper we study various overdetermined boundary value problems for elliptic equations. In particular, we introduce overdetermined problems for the Saint-Venant equation whose only solution domain is the concentric circular annulus. The proofs depend on a generalisation of the reflection method of James Serrin. We then use these results to generalise, to the case of doubly connected ring domains, the recent work of L. Payne and G. Philippin for the Stekloff eigenvalue problem: we present overdetermining conditions which permit solution only when the domain is a concentric circular annulus. Here, the proof employs an integral characterisation of the annulus by harmonic functions.     

The classical overdetermined Serrin problem

Abstract

In this survey, we consider the classical overdetermined problem which was studied by Serrin in 1971. The original proof relies on Alexandrov’s moving plane method, maximum principles, and a refinement of Hopf’s boundary point Lemma. Since then other approaches to the same problem have been devised. Among them we consider the one due to Weinberger which strikes for the elementary arguments used and became very popular. Then we discuss also a duality approach involving harmonic functions, a shape derivative approach and a purely integral approach, all of them not relying on maximum principle. For each one, we consider pros and cons as well as some generalizations.     

Uniqueness for an overdetermined boundary value problem for the p-Laplacian

For set , and let be a measure with compact support. Suppose, for , there are functions and (bounded) domains , both containing the support of with the property that in (weakly) and in the complement of . If in addition is convex, then and .

     

Symmetry results for overdetermined boundary value problems of nonlinear elliptic equations

We prove the radial symmetry of the solutions of second-order nonlinear elliptic equations for overdetermined Dirichlet and Neumann boundary value problems. In addition, a global uniqueness theorem of Holmgren type is given for nonlinear elliptic equations.     

Solving the eigenvalue problem for matrices

One presents some algorithms related among themselves for solving the partial and the complete eigenvalue problem for an arbitrary matrix. Algorithm 1 allows us to construct the invariant subspaces and to obtain with their aid a matrix whose eigenvalues coincide with the eigenvalues of the initial matrix and belong to a given semiplane. Algorithm 2 solves the same problem for a given strip. The algorithms 3 and 4 reduces the complete eigenvalue problem of an arbitrary matrix to some problem for a quasitriangular matrix whose diagonal blocks have eigenvalues with identical real parts. Algorithm 4 finds also the unitary matrix which realizes this transformation. One gives Algol programs which realize the algorithms 1–3 for real matrices and testing examples.     

Nonlocal overdetermined boundary value problem for stationary Navier-Stokes equations

A stationary system of Stokes and Navier-Stokes equations describing the flow of a homogeneous incompressible fluid in a bounded domain is considered. The vector of the flow velocity and a finite number of nonlocal conditions are defined at a part of the domain boundary. It is proved that, in the linear case, the problem has at least one stable solution. In the nonlinear case, the local solvability of the problem is proved.     

Numerical enclosure for each eigenvalue in generalized eigenvalue problem

An algorithm for enclosing all eigenvalues in generalized eigenvalue problem Ax=λBx is proposed. This algorithm is applicable even if A∈C^n×n is not Hermitian and/or B∈C^n×n is not Hermitian positive definite, and supplies nerror bounds while the algorithm previously developed by the author supplies a single error bound. It is proved that the error bounds obtained by the proposed algorithm are equal or smaller than that by the previous algorithm. Computational cost for the proposed algorithm is similar to that for the previous algorithm. Numerical results show the property of the proposed algorithm.     

The eigenvalue problem for the Laplacian equations

This article studies the Dirichlet eigenvalue problem for the Laplacian equations △u = -λu, x ∈Ω, u = 0, x ∈ (δ)Ω, where Ω (∩) Rn is a smooth bounded convex domain. By using the method of appropriate barrier function combined with the maximum principle, authors obtain a sharp lower bound of the difference of the first two eigenvalues for the Dirichlet eigenvalue problem. This study improves the result of S.T.Yau et al.     

Solving the eigenvalue problem for sparse matrices

A modification of the Danilewski method is presented, permitting the solution of the eigenvalue problem for a constant sparse matrix of large order to be reduced to the solution of the same problem for a polynomial matrix of lower order. Certain solution algorithms are proposed for a partial eigenvalue problem for the polynomial matrix. Questions of the realization of the algorithms on a model PRORAB computer are examined.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 58, pp. 92–110, 1976.