首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 62 毫秒
1.
王培瑾  徐金利 《大学数学》2019,35(1):112-114
对立方矩阵定义了方向特征值与方向特征向量,并研究了其基本性质.证明了立方矩阵的特征值是随着方向连续变化的,同时也证明了超对称立方矩阵可以由其一些方向特征值和特征向量重建.  相似文献   

2.
Wilson元特征值下逼近准确特征值   总被引:1,自引:0,他引:1  
张智民  杨一都  陈震 《计算数学》2007,29(3):319-321
该文讨论矩形域上Laplace算子特征值问题有限元近似.证明了Wilson非协调有限元特征值下逼近准确特征值,从而解决了有限元法中长期存在的一个猜想.  相似文献   

3.
考虑时标上奇异三阶微分方程特征值问题.首先使用Krein-Rutmann定理得到正线性算子的第一特征值,再联合不动点指数定理证明了特征值问题正解的存在性,同时也给出了参数λ的取值区间.  相似文献   

4.
在有限元方法中,特征值的渐进展开式对于研究数值特征值的逼近性质有着非常重要的应用,使用林群等发展的广义Bramble-Hilbert引理,证明了Wilson砖特征值的渐进展开式.  相似文献   

5.
考虑了一类具有转移条件的向量Sturm-Liouville问题的特征值及其重数问题.首先构造了与问题相关的新内积和基本解,得到特征值的充要条件.在此基础上证明了二维情况下,问题特征值的代数重数与几何重数相等.  相似文献   

6.
给出了一类Toeplitz矩阵特征值的几种解法,利用复数域上矩阵的特征值的性质,建立并证明了一组三角函数恒等式.  相似文献   

7.
研究L^p(1相似文献   

8.
研究一类正则的具有混合边界条件并带有有限个转移条件的高阶不连续微分算子特征值问题以及特征函数系的完备性问题.通过结合转移条件定义的新的内积,把问题转换成一个新的Hilbert空间上的对称微分算子的特征值问题.使用分段定义的微分方程的基本解,给出了满足特征方程的特征值是一个整函数的零点,证明了问题的特征值至多可数,得到特征值的充要条件.在此基础上,结合紧算子的谱理论以及逆算子的相关性质,得到了Green函数,证明了特征函数系是完备的.  相似文献   

9.
研究了定义在有限区间内具有转移条件的m维向量型Sturm-Liouville问题.主要得到了该问题特征值重数的若干结论.证明了当矩阵值势函数Q满足一定的条件时,只能有有限个重数为m的特征值.作为重数结果的应用,证明了该问题的Ambarzumyan定理.  相似文献   

10.
自共轭全连续算子谱逼近的保序收敛性   总被引:2,自引:0,他引:2       下载免费PDF全文
讨论自共轭全连续算子T谱逼近的保序收敛性质. 在近似算子Th依范数收敛于T的条件下证明了Th$的第k个特征值收敛于T的第k个特征值(对正特征值按从大到小顺序排列, 对负特征值按从小到大顺序排列, 并按其重数重复计数). 并把这结果用于自共轭椭圆微分算子特征值问题协调有限元法、非协调有限元法与混合有限元法, 证明了用这些方法求得的第k个近似特征值都收敛于第k个准确特征值.  相似文献   

11.
曹阳  戴华 《计算数学》2014,36(4):381-392
本文研究求解非线性特征值问题的数值方法.基于矩阵值函数的二次近似,将非线性特征值问题转化为二次特征值问题,提出了求解非线性特征值问题的逐次二次近似方法,分析了该方法的收敛性.结合求解二次特征值问题的Arnoldi方法和Jacobi-Davidson方法,给出求解非线性特征值问题的一些二次近似方法.数值结果表明本文所给算法是有效的.  相似文献   

12.
We consider a nonlinear integral eigenvalue problem, which is a reformulation of the transmission eigenvalue problem arising in the inverse scattering theory. The boundary element method is employed for discretization, which leads to a generalized matrix eigenvalue problem. We propose a novel method based on the spectral projection. The method probes a given region on the complex plane using contour integrals and decides whether the region contains eigenvalue(s) or not. It is particularly suitable to test whether zero is an eigenvalue of the generalized eigenvalue problem, which in turn implies that the associated wavenumber is a transmission eigenvalue. Effectiveness and efficiency of the new method are demonstrated by numerical examples.  相似文献   

13.
In applications of linear algebra including nuclear physics and structural dynamics, there is a need to deal with uncertainty in the matrices. We focus on matrices that depend on a set of parameters ω and we are interested in the minimal eigenvalue of a matrix pencil ( A , B ) with A , B symmetric and B positive definite. If ω can be interpreted as the realization of random variables, one may be interested in statistical moments of the minimal eigenvalue. In order to obtain statistical moments, we need a fast evaluation of the eigenvalue as a function of ω . Because this is costly for large matrices, we are looking for a small parameterized eigenvalue problem whose minimal eigenvalue makes a small error with the minimal eigenvalue of the large eigenvalue problem. The advantage, in comparison with a global polynomial approximation (on which, e.g., the polynomial chaos approximation relies), is that we do not suffer from the possible nonsmoothness of the minimal eigenvalue. The small‐scale eigenvalue problem is obtained by projection of the large‐scale problem. Our main contribution is that, for constructing the subspace, we use multiple eigenvectors and derivatives of eigenvectors. We provide theoretical results and document numerical experiments regarding the beneficial effect of adding multiple eigenvectors and derivatives.  相似文献   

14.
Summary. This paper explores the relationship between certain inverse unitary eigenvalue problems and orthogonal functions. In particular, the inverse eigenvalue problems for unitary Hessenberg matrices and for Schur parameter pencils are considered. The Szeg? recursion is known to be identical to the Arnoldi process and can be seen as an algorithm for solving an inverse unitary Hessenberg eigenvalue problem. Reformulation of this inverse unitary Hessenberg eigenvalue problem yields an inverse eigenvalue problem for Schur parameter pencils. It is shown that solving this inverse eigenvalue problem is equivalent to computing Laurent polynomials orthogonal on the unit circle. Efficient and reliable algorithms for solving the inverse unitary eigenvalue problems are given which require only O() arithmetic operations as compared with O() operations needed for algorithms that ignore the structure of the problem. Received April 3, 1995 / Revised version received August 29, 1996  相似文献   

15.
We present several transformations that can be used to solve the quadratic two-parameter eigenvalue problem (QMEP), by formulating an associated linear multiparameter eigenvalue problem. Two of these transformations are generalizations of the well-known linearization of the quadratic eigenvalue problem and linearize the QMEP as a singular two-parameter eigenvalue problem. The third replaces all nonlinear terms by new variables and adds new equations for their relations. The QMEP is thus transformed into a nonsingular five-parameter eigenvalue problem. The advantage of these transformations is that they enable one to solve the QMEP using existing numerical methods for multiparameter eigenvalue problems. We also consider several special cases of the QMEP, where some matrix coefficients are zero  相似文献   

16.
We introduce the quadratic two-parameter eigenvalue problem and linearize it as a singular two-parameter eigenvalue problem. This, together with an example from model updating, shows the need for numerical methods for singular two-parameter eigenvalue problems and for a better understanding of such problems.There are various numerical methods for two-parameter eigenvalue problems, but only few for nonsingular ones. We present a method that can be applied to singular two-parameter eigenvalue problems including the linearization of the quadratic two-parameter eigenvalue problem. It is based on the staircase algorithm for the extraction of the common regular part of two singular matrix pencils.  相似文献   

17.
This paper discusses the order-preserving convergence for spectral approximation of the self-adjoint completely continuous operator T.Under the condition that the approximate operator Th converges to T in norm,it is proven that the k-th eigenvalue of Th converges to the k-th eigenvalue of T.(We sorted the positive eigenvalues in decreasing order and negative eigenvalues in increasing order.) Then we apply this result to conforming elements,nonconforming elements and mixed elements of self-adjoint elliptic differential operators eigenvalue problems,and prove that the k-th approximate eigenvalue obtained by these methods converges to the k-th exact eigenvalue.  相似文献   

18.
In the present paper, approximate analytical and numerical solutions to nonlinear eigenvalue problems arising in nonlinear fracture mechanics in studying stress-strain fields near a crack tip under mixed-mode loading are presented. Asymptotic solutions are obtained by the perturbation method (the artificial small parameter method). The artificial small parameter is the difference between the eigenvalue corresponding to the nonlinear eigenvalue problem and the eigenvalue related to the linear “undisturbed” problem. It is shown that the perturbation technique is an effective method of solving nonlinear eigenvalue problems in nonlinear fracture mechanics. A comparison of numerical and asymptotic results for different values of the mixity parameter and hardening exponent shows good agreement. Thus, the perturbation theory technique for studying nonlinear eigenvalue problems is offered and applied to eigenvalue problems arising in fracture mechanics analysis in the case of mixed-mode loading.  相似文献   

19.
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 method. We present error estimates that incorporate the discretization errors, approximation errors in the eigenvalue solver and roundoff errors, and use these for the adaptation process. We show that it is also possible to restrict to very few iterations of a Krylov subspace solver for the eigenvalue problem on coarse meshes. Several examples are presented to show that this new approach achieves much better complexity than the previous AFEM approaches which assume that the algebraic eigenvalue problem is solved to full accuracy. Copyright © 2010 John Wiley & Sons, Ltd.  相似文献   

20.
The second largest Laplacian eigenvalue of a graph is the second largest eigenvalue of the associated Laplacian matrix. In this paper, we study extremal graphs for the extremal values of the second largest Laplacian eigenvalue and the Laplacian separator of a connected graph, respectively. All simple connected graphs with second largest Laplacian eigenvalue at most 3 are characterized. It is also shown that graphs with second largest Laplacian eigenvalue at most 3 are determined by their Laplacian spectrum. Moreover, the graphs with maximum and the second maximum Laplacian separators among all connected graphs are determined.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号