TWO-DIMENSIONAL APPROXIMATION OF EIGENVALUE PROBLEMS IN SHELL THEORY： FLEXURAL SHELLS

1.IntroductionInthispaper,westudythelimitingbehaviourofeigenvaluesandeigenfunctionsdescribingthevibrationsofathinlinearlyelasticshell,clampedalongitslateralsurface,underageometricassumptiononthemiddlesurfaceoftheshellthatthespaceofinextensionaldisplacements(of.(4.2))isnonzero.Inthestationarycasegunderadditionalassumptionsontheorderofmagnitudeofthebodyforces,thisleadstothetwo-dimensionalmodelofthe"fie-curalshell"asshownbyCiarlet,LodsandMiara[5].Examplesofclampedshellswhichobeytheabovegeometric…     

On certain two-sided analogues of Newton’s method for solving nonlinear eigenvalue problems

Iterative algorithms for finding two-sided approximations to the eigenvalues of nonlinear algebraic eigenvalue problems are examined. These algorithms use an efficient numerical procedure for calculating the first and second derivatives of the determinant of the problem. Computational aspects of this procedure as applied to finding all the eigenvalues from a given complex-plane domain in a nonlinear eigenvalue problem are analyzed. The efficiency of the algorithms is demonstrated using some model problems.     

Sublinear eigenvalue problems associated to the Laplace operator revisited

Eigenvalue problems involving the Laplace operator on bounded domains lead to a discrete or a continuous set of eigenvalues. In this paper we highlight the case of an eigenvalue problem involving the Laplace operator which possesses, on the one hand, a continuous family of eigenvalues and, on the other hand, at least one more eigenvalue which is isolated in the set of eigenvalues of that problem.     

A geometric theory for preconditioned inverse iteration I: Extrema of the Rayleigh quotient

The discretization of eigenvalue problems for partial differential operators is a major source of matrix eigenvalue problems having very large dimensions, but only some of the smallest eigenvalues together with the eigenvectors are to be determined. Preconditioned inverse iteration (a “matrix-free” method) derives from the well-known inverse iteration procedure in such a way that the associated system of linear equations is solved approximately by using a (multigrid) preconditioner. A new convergence analysis for preconditioned inverse iteration is presented. The preconditioner is assumed to satisfy some bound for the spectral radius of the error propagation matrix resulting in a simple geometric setup. In this first part the case of poorest convergence depending on the choice of the preconditioner is analyzed. In the second part the dependence on all initial vectors having a fixed Rayleigh quotient is considered. The given theory provides sharp convergence estimates for the eigenvalue approximations showing that multigrid eigenvalue/vector computations can be done with comparable efficiency as known from multigrid methods for boundary value problems.     

Numerical methods for finding multiple eigenvalues of matrices depending on parameters

Summary. Let be a square matrix dependent on parameters and , of which we choose as the eigenvalue parameter. Many computational problems are equivalent to finding a point such that has a multiple eigenvalue at . An incomplete decomposition of a matrix dependent on several parameters is proposed. Based on the developed theory two new algorithms are presented for computing multiple eigenvalues of with geometric multiplicity . A third algorithm is designed for the computation of multiple eigenvalues with geometric multiplicity but which also appears to have local quadratic convergence to semi-simple eigenvalues. Convergence analyses of these methods are given. Several numerical examples are presented which illustrate the behaviour and applications of our methods. Received December 19, 1994 / Revised version received January 18, 1996     

Existence of an extremal ground state energy of a nanostructured quantum dot

This paper is concerned with two rearrangement optimization problems. These problems are motivated by two eigenvalue problems which depend nonlinearly on the eigenvalues. We consider a rational and a quadratic eigenvalue problem with Dirichlet’s boundary condition and investigate two related optimization problems where the goal function is the corresponding first eigenvalue. The first eigenvalue in the rational eigenvalue problem represents the ground state energy of a nanostructured quantum dot. In both the problems, the admissible set is a rearrangement class of a given function.     

DERIVATIVES OF EIGENPAIRS OF SYMMETRIC QUADRATIC EIGENVALUE PROBLEM

Derivatives of eigenvalues and eigenvectors with respect to parameters in symmetric quadratic eigenvalue problem are studied. The first and second order derivatives of eigenpairs are given. The derivatives are calculated in terms of the eigenvalues and eigenvectors of the quadratic eigenvalue problem, and the use of state space representation is avoided, hence the cost of computation is greatly reduced. The efficiency of the presented method is demonstrated by considering a spring-mass-damper system.     

Algorithm for min-range multiplication of affine forms

We consider an approximate method based on the alternate trapezoidal quadrature for the eigenvalue problem given by a periodic singular Fredholm integral equation of second kind. For some convolution-type integral kernels, the eigenvalues of the discrete eigenvalue problem provided by the alternate trapezoidal quadrature method have multiplicity at least two, except up to two eigenvalues of multiplicity one. In general, these eigenvalues exhibit some symmetry properties that are not necessarily observed in the eigenvalues of the continuous problem. For a class of Hilbert-type kernels, we provide error estimates that are valid for a subset of the discrete spectrum. This subset is further enlarged in an improved quadrature method presented herein. The results are illustrated through numerical examples.     

The properties of solutions of a class of isoperimetric problems of stability optimization

A class of isoperimetric problems of stability optimization is considered. These arise, for example, when maximizing the Euler force in the destabilization of a column (rod) of varying cross-section and given volume (Lagrange's problem). It is well known that an extremum which depends on the form of the boundary conditions can be achieved for both simple and double eigenvalues. A class of problems is identified for which a global maximum is found at a simple eigenvalue. The possibility of achieving a local extremum for the first (simple) eigenvalue at stationary points is analysed qualitatively in terms of the parameter values and the form of the boundary conditions.     

An integral method for solving nonlinear eigenvalue problems

We propose a numerical method for computing all eigenvalues (and the corresponding eigenvectors) of a nonlinear holomorphic eigenvalue problem that lie within a given contour in the complex plane. The method uses complex integrals of the resolvent operator, applied to at least k column vectors, where k is the number of eigenvalues inside the contour. The theorem of Keldysh is employed to show that the original nonlinear eigenvalue problem reduces to a linear eigenvalue problem of dimension k. No initial approximations of eigenvalues and eigenvectors are needed. The method is particularly suitable for moderately large eigenvalue problems where k is much smaller than the matrix dimension. We also give an extension of the method to the case where k is larger than the matrix dimension. The quadrature errors caused by the trapezoid sum are discussed for the case of analytic closed contours. Using well known techniques it is shown that the error decays exponentially with an exponent given by the product of the number of quadrature points and the minimal distance of the eigenvalues to the contour.     

On the perturbation theory of instable isolated eigenvalues

The problem of the perturbation of an operator having a continuous spectrum and an isolated eigenvalue λ₀ is considered by means of the theory on embedded eigenvalues. The perturbation is divided up into two parts. One part is used for embedding the isolated eigenvalue λ₀. This embedded eigenvalue becomes instable by the second part of the perturbation and spectral concentration is given near λ₀. The general model is illustrated by a simple example.     

Sufficient conditions of non‐uniqueness for the Coulomb friction problem

We consider the Signorini problem with Coulomb friction in elasticity. Sufficient conditions of non‐uniqueness are obtained for the continuous model. These conditions are linked to the existence of real eigenvalues of an operator in a Hilbert space. We prove that, under appropriate conditions, real eigenvalues exist for a non‐local Coulomb friction model. Finite element approximation of the eigenvalue problem is considered and numerical experiments are performed. Copyright © 2003 John Wiley & Sons, Ltd.     

多参数二次特征值问题重特征值的灵敏度分析

本文研究解析依赖于多参数的二次特征值问题重特征值的灵敏度分析,得到了重特征值的方向导数,证明了相应的特征向量矩阵和特征值平均值的解析性,给出了其一阶偏导数的表达式．然后以这些结论为基础,定义了二次特征值问题重特征值及其不变子空间的灵敏度,并给出了确定二次特征值问题所含矩阵中敏感元素的方法．     

A generalized Rayleigh quotient for eigenvalue problems nonlinear in the parameter

A functional is given which generalizes the Rayleigh quotient to eigenvalue problems for linear operators where the eigenvalue parameter appears nonlinearly. Particular emphasis is given to the development of perturbation-type results for eigenvalues and characteristic values which generalize the classical results. Applications are made to eigenvalue and characteristic value problems for integral and matrix operators and to the critical length problem for integral operators. Both symmetric and nonsymmetric operators are treated.The author would like to acknowledge the work of Gloria Golberg in the preparation of this paper.     

求解一类不连续的Sturm-Liouville问题

研究一类边界条件中有谱参数的不连续的Sturm-Liouville问题.首先在Hilbert空间中定义了一个自共轭的线性算子A,使得该类Sturm-Liouville问题的特征值与算子A的特征值相一致.进一步证明了算子A是自共轭的,且这类Sturm-Liouville问题特征值是解析单的.最后展示了一个具体问题的特征值以及特征函数的逼近解.     

Error estimate of eigenvalues of perturbed second-order discrete Sturm–Liouville problems

This paper is concerned with eigenvalues of perturbed second-order vector discrete Sturm–Liouville problems. By some variational properties of eigenvalues of discrete Sturm–Liouville problems, error estimates of eigenvalues of perturbed problems, sufficiently close to a given Sturm–Liouville problem, are given under a certain non-singularity condition. Perturbations of the coefficient functions of the difference equation, the weight function, and the coefficients of the boundary condition are all considered. This, together with higher-dimension involved, results in a certain complexity of the problem and difficulty of study. As a direct consequence, continuous dependence of eigenvalues on problems is obtained under the non-singularity condition. In addition, an example is presented to illustrate the necessity of the non-singularity condition.     

An eigenvalue problem for elastic cracks in free space

We study in this paper an eigenvalue problem for the linear elasticity equations in three‐dimensional space. The problem is defined in the whole space cut by a planar crack. The eigenvalue appears in a linear condition relating the traction to the jump in displacements across the crack. We prove for such problems that an eigenspace containing eigenfunctions, which do not average to zero over the crack is in general not simple. Then we prove for a more constrained eigenvalue problem, where the direction of slip over the crack is imposed, that the first eigenspace is in that case simple. Copyright © 2009 John Wiley & Sons, Ltd.     

Iterative method for a class of nonlinear eigenvalue problems

Let H Be a complex and separable Hilbert space and consider in H the nonlinear eigenvalue problem where A, B, and C belong to the class of unbounded nonsymmetric operators, which are K- positive K-symmetric. Sufficient conditions insuring the existence of the eigenvalues of (i) are investigated. An iterative method for approximating the eigenvalues of (i) is developed and its convergence proved. Some numerical examples are given to illustrate the theory.     

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.     

平板几何迁移算子的特征值问题

研究L^p(1相似文献