Computable bounds for eigenvalues and eigenfunctions of elliptic differential operators

Summary We are concerned with bounds for the error between given approximations and the exact eigenvalues and eigenfunctions of self-adjoint operators in Hilbert spaces. The case is included where the approximations of the eigenfunctions don't belong to the domain of definition of the operator. For the eigenvalue problem with symmetric elliptic differential operators these bounds cover the case where the trial functions don't satisfy the boundary conditions of the problem. The error bounds suggest a certain defectminization method for solving the eigenvalue problems. The method is applied to the membrane problem.     

Conformal upper bounds for the eigenvalues of the Laplacian and Steklov problem

In this paper, we find upper bounds for the eigenvalues of the Laplacian in the conformal class of a compact Riemannian manifold (M,g). These upper bounds depend only on the dimension and a conformal invariant that we call “min-conformal volume”. Asymptotically, these bounds are consistent with the Weyl law and improve previous results by Korevaar and Yang and Yau. The proof relies on the construction of a suitable family of disjoint domains providing supports for a family of test functions. This method is interesting for itself and powerful. As a further application of the method we obtain an upper bound for the eigenvalues of the Steklov problem in a domain with C¹ boundary in a complete Riemannian manifold in terms of the isoperimetric ratio of the domain and the conformal invariant that we introduce.     

A New Implicit Iteration Process with Errors for the Family of Strongly Pseudocontractive Mappings

A method is presented for generating a sequence of lower and upper bounds for the eigenvalues of the problem (i) Tu-λSu = 0, where T and S belong to a class of unbounded and nonsymmetric operators in a separable Hilbert space. Sufficient conditions are derived for the convergence of the sequence of bounds to the eigenvalues of (i), and the applicability of the method is illustrated by approximating the smallest eigenvalue of a non-selfadjoint differential eigenvalue problem.     

Two-sided bounds of eigenvalues of second-and fourth-order elliptic operators

This article presents an idea in the finite element methods (FEMs) for obtaining two-sided bounds of exact eigenvalues. This approach is based on the combination of nonconforming methods giving lower bounds of the eigenvalues and a postprocessing technique using conforming finite elements. Our results hold for the second and fourth-order problems defined on two-dimensional domains. First, we list analytic and experimental results concerning triangular and rectangular nonconforming elements which give at least asymptotically lower bounds of the exact eigenvalues. We present some new numerical experiments for the plate bending problem on a rectangular domain. The main result is that if we know an estimate from below by nonconforming FEM, then by using a postprocessing procedure we can obtain two-sided bounds of the first (essential) eigenvalue. For the other eigenvalues λ_l, l = 2, 3, …, we prove and give conditions when this method is applicable. Finally, the numerical results presented and discussed in the paper illustrate the efficiency of our method.     

Lower bounds for the eigenvalues of first-order nonlinear Hamiltonian systems on time scales

We study first-order nonlinear planar Hamiltonian boundary value problems on time scales. Estimates on lower bounds for the eigenvalues of the problems are established by way of the Lyapunov inequality method. Our results are interpreted to nonlinear differential and difference planar Hamiltonian boundary value problems. As a special case, an estimate on lower bounds for eigenvalues of half-linear dynamic equations is obtained which generalizes and improves the existing ones to nonlinear Hamiltonian systems. Based on the main results, we establish existence and uniqueness of solutions of a related linear boundary value problem.     

On low eigenvalues of the Laplacian with mixed boundary conditions

By means of the so-called α-symmetrization we study the eigenvalue problem for the Laplace operator with mixed boundary conditions. We obtain various bounds for combinations of the low eigenvalues and some sharp comparison results for the first eigenfunction in terms of Bessel functions.     

Verified numerical computations for multiple and nearly multiple eigenvalues of elliptic operators

In this paper, we propose a numerical method to verify bounds for multiple eigenvalues for elliptic eigenvalue problems. We calculate error bounds for approximations of multiple eigenvalues and base functions of the corresponding invariant subspaces. For matrix eigenvalue problems, Rump (Linear Algebra Appl. 324 (2001) 209) recently proposed a validated numerical method to compute multiple eigenvalues. In this paper, we extend his formulation to elliptic eigenvalue problems, combining it with a method developed by one of the authors (Jpn. J. Indust. Appl. Math. 16 (1998) 307).     

Rigorous convex underestimators for general twice-differentiable problems

In order to generate valid convex lower bounding problems for nonconvex twice-differentiable optimization problems, a method that is based on second-order information of general twice-differentiable functions is presented. Using interval Hessian matrices, valid lower bounds on the eigenvalues of such functions are obtained and used in constructing convex underestimators. By solving several nonlinear example problems, it is shown that the lower bounds are sufficiently tight to ensure satisfactory convergence of the BB, a branch and bound algorithm which relies on this underestimation procedure [3].     

Inequalities for eigenvalues of the polyharmonic operator Δ p

In this paper we consider the bounds of the eigenvalues for a class of polyharmonic operators and obtain the bounds for (n+1)th eigenvalue interm of the firstn eigenvalues. Those estimates do not depend on the domain in which the problem is considered.     

ESTIMATES OF EIGENVALUES FOR UNIFORMLY ELLIPTIC OPERATOR OF SECOND ORDER

ＥＳＴＩＭＡＴＥＳＯＦＥＩＧＥＮＶＡＬＵＥＳＦＯＲＵＮＩＦＯＲＭＬＹＥＬＬＩＰＴＩＣＯＰＥＲＡＴＯＲＯＦＳＥＣＯＮＤＯＲＤＥＲＱＩＡＮＣＨＵＮＬＩＮ（钱椿林）ＣＨＥＮＺＵＣＨＩ（陈祖墀）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｔｎａｔｉｃｓ，Ｕｎｉｖｅｒ...     

Eigenvalues for infinite matrices

This paper is concerned with the problem of determining the location of eigenvalues for diagonally dominant infinite matrices; upper and lower bounds for eigenvalues are established. For tridiagonal matrices, a numerical procedure for improving the bounds is given, and the approximation of the eigenvectors is also discussed. The techniques are illustrated for the solution of the well-known Mathieu's equation.     

Methods for computing lower bounds to eigenvalues of self-adjoint operators

Summary. New approaches for computing tight lower bounds to the eigenvalues of a class of semibounded self-adjoint operators are presented that require comparatively little a priori spectral information and permit the effective use of (among others) finite-element trial functions. A variant of the method of intermediate problems making use of operator decompositions having the form is reviewed and then developed into a new framework based on recent inertia results in the Weinstein-Aronszajn theory. This framework provides greater flexibility in analysis and permits the formulation of a final computational task involving sparse, well-structured matrices. Although our derivation is based on an intermediate problem formulation, our results may be specialized to obtain either the Temple-Lehmann method or Weinberger's matrix method. Received December 12, 1992 / Revised version received October 5, 1994     

Bounds on Non-Real Eigenvalues of Indefinite Sturm-Liouville Problems

It is known since the early 20th century that regular indefinite Sturm-Liouville problems may possess non-real eigenvalues. However, finding bounds for this set in terms of the coefficients of the differential expression has remained an open problem until recently. In this note we prove a variant of a recent result in [1] on the bounds for the non-real eigenvalues of an indefinite Sturm-Liouville problem with Dirichlet boundary conditions. (© 2013 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Error bounds and estimates for eigenvalues of integral equations

Summary Approximate solutions of the linear integral equation eigenvalue problem can be obtained by the replacement of the integral by a numerical quadrature formula and then collocation to obtain a linear algebraic eigenvalue problem. This method is often called the Nyström method and its convergence was discussed in [7]. In this paper computable error bounds and dominant error terms are derived for the approximation of simple eigenvalues of nonsymmetric kernels.     

On the eigenvalue distribution of preconditioned nonsymmetric saddle point matrices

In this paper, we derive bounds for the complex eigenvalues of a nonsymmetric saddle point matrix with a symmetric positive semidefinite (2,2) block, that extend the corresponding previous bounds obtained by Bergamaschi. For the nonsymmetric saddle point problem, we propose a block diagonal preconditioner for the conjugate gradient method in a nonstandard inner product. Numerical experiments are also included to test the performance of the presented preconditioner. Copyright © 2013 John Wiley & Sons, Ltd.     

Bounds on the error of an approximate invariant subspace for non-self-adjoint matrices

Summary. Suppose one approximates an invariant subspace of an matrix in which in not necessarily self--adjoint. Suppose that one also has an approximation for the corresponding eigenvalues. We consider the question of how good the approximations are. Specifically, we develop bounds on the angle between the approximating subspace and the invariant subspace itself. These bounds are functions of the following three terms: (1) the residual of the approximations; (2) singular--value separation in an associated matrix; and (3) the goodness of the approximations to the eigenvalues. Received December 1, 1992 / Revised version received October 20, 1993     

Computing eigenspaces with specified eigenvalues of a regular matrix pair (A,B) and condition estimation: theory,algorithms and software

Theory, algorithms and LAPACK-style software for computing a pair of deflating subspaces with specified eigenvalues of a regular matrix pair (A, B) and error bounds for computed quantities (eigenvalues and eigenspaces) are presented. Thereordering of specified eigenvalues is performed with a direct orthogonal transformation method with guaranteed numerical stability. Each swap of two adjacent diagonal blocks in the real generalized Schur form, where at least one of them corresponds to a complex conjugate pair of eigenvalues, involves solving a generalized Sylvester equation and the construction of two orthogonal transformation matrices from certain eigenspaces associated with the diagonal blocks. The swapping of two 1×1 blocks is performed using orthogonal (unitary) Givens rotations. Theerror bounds are based on estimates of condition numbers for eigenvalues and eigenspaces. The software computes reciprocal values of a condition number for an individual eigenvalue (or a cluster of eigenvalues), a condition number for an eigenvector (or eigenspace), and spectral projectors onto a selected cluster. By computing reciprocal values we avoid overflow. Changes in eigenvectors and eigenspaces are measured by their change in angle. The condition numbers yield bothasymptotic andglobal error bounds. The asymptotic bounds are only accurate for small perturbations (E, F) of (A, B), while the global bounds work for all (E, F.) up to a certain bound, whose size is determined by the conditioning of the problem. It is also shown how these upper bounds can be estimated. Fortran 77software that implements our algorithms for reordering eigenvalues, computing (left and right) deflating subspaces with specified eigenvalues and condition number estimation are presented. Computational experiments that illustrate the accuracy, efficiency and reliability of our software are also described.     

On upper bounds for high order Neumann eigenvalues of convex domains in Euclidean space

We derive sharp upper bounds for eigenvalues of the Laplacian under Neumann boundary conditions on convex domains with given diameter in Euclidean space. We use the Brunn-Minkowski theorem in order to reduce the problem to a question about eigenvalues of certain classes of Sturm-Liouville problems.

     

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.     

Universal Inequalities for Eigenvalues of the Buckling Problem of Arbitrary Order

We investigate the eigenvalues of the buckling problem of arbitrary order on compact domains in Euclidean spaces and spheres. We obtain universal bounds for the kth eigenvalue in terms of the lower eigenvalues independently of the particular geometry of the domain.