نتایج جستجو برای: eigenvalue assignment

تعداد نتایج: 62197  

Journal: :Journal of Discrete Algorithms 2007

Journal: :The Computer Journal 1964

2007
Bennett Palmer

We study the eigenvalues of the biharmonic operators and the buckling eigenvalue on complete, open Riemannian manifolds. We show that the first eigenvalue of the biharmonic operator on a complete, parabolic Riemannian manifold is zero. We give a generalization of the buckling eigenvalue and give applications to studying the stability of minimal Lagrangian submanifolds in Kähler manifolds. MSC 1...

Journal: :SIAM J. Matrix Analysis Applications 2012
Zhaojun Bai Ren-Cang Li

We present two theoretical results for the linear response eigenvalue problem. The first result is a minimization principle for the sum of the smallest eigenvalues with the positive sign. The second result is Cauchy-like interlacing inequalities. Although the linear response eigenvalue problem is a nonsymmetric eigenvalue problem, these results mirror the well-known trace minimization principle...

Journal: :Journal d'Analyse Mathématique 1959

Journal: :Bulletin of the Australian Mathematical Society 1988

Journal: :Journal of Mathematical Analysis and Applications 1993

Journal: :Numerical Lin. Alg. with Applic. 2011
Volker Mehrmann Agnieszka Miedlar

We consider a new adaptive finite element (AFEM) algorithm for self-adjoint elliptic PDE eigenvalue problems. In contrast to other approaches we incorporate the inexact solutions of the resulting finite dimensional algebraic eigenvalue problems into the adaptation process. In this way we can balance the costs of the adaptive refinement of the mesh with the costs for the iterative eigenvalue met...

2006
HEHU XIE

In this paper, we derive an asymptotic error expansion for the eigenvalue approximations by the lowest order Raviart-Thomas mixed finite element method for the general second order elliptic eigenvalue problems. Extrapolation based on such an expansion is applied to improve the accuracy of the eigenvalue approximations. Furthermore, we also prove the superclose property between the finite elemen...

Journal: :transactions on combinatorics 2012
mohsen mollahajiaghaei

a graph is called textit{circulant} if it is a cayley graph on a cyclic group, i.e. its adjacency matrix is circulant. let $d$ be a set of positive, proper divisors of the integer $n>1$. the integral circulant graph $icg_{n}(d)$ has the vertex set $mathbb{z}_{n}$ and the edge set e$(icg_{n}(d))= {{a,b}; gcd(a-b,n)in d }$. let $n=p_{1}p_{2}cdots p_{k}m$, where $p_{1},p_{2},cdots,p_{k}$ are disti...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید