首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
求解陀螺系统特征值问题的收缩二阶Lanczos方法   总被引:1,自引:1,他引:0  
孔艳花  戴华 《计算数学》2011,33(3):328-336
本文研究陀螺系统特征值问题的数值解法,利用反对称矩阵Lanczos算法,提出了求解陀螺系统特征值问题的二阶Lanczos方法.基于提出的陀螺系统特征值问题的非等价低秩收缩技术,给出了计算陀螺系统极端特征值的收缩二阶Lanczos方法.数值结果说明了算法的有效性.  相似文献   

2.
Oleg Kirillov 《PAMM》2003,2(1):92-93
Eigenvalue problems for non‐selfadjoint linear differential operators smoothly dependent on a vector of real parameters are considered. Bifurcation of eigenvalues along smooth curves in the parameter space is studied. The case of a multiple eigenvalue with the Keldysh chain of arbitrary length is investigated. Explicit expressions describing bifurcation of eigenvalues are found. The obtained formulae use eigenfunctions and associated functions of the adjoint eigenvalue problems as well as the derivatives of the differential operator taken at the initial point of the parameter space. These results are important for the stability theory and sensitivity analysis of non‐conservative systems. Mechanical examples are considered and discussed in detail.  相似文献   

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

4.
周星月  戴华 《计算数学》2012,34(4):341-350
本文研究陀螺系统特征值问题的Jacobi-Davidson方法. 利用陀螺系统的结构性质,给出了求解Jacobi-Davidson方法中校正方程的有效方法. 基于非等价低秩收缩技术,给出了计算陀螺系统一些特征值的收缩Jacobi-Davidson方法. 数值结果表明本文所给算法是有效的.  相似文献   

5.
中厚板特征值问题的杂交/混合有限元分析   总被引:2,自引:0,他引:2  
本文采用杂交/混合有限元对中厚板的屈曲问题和自由振动问题进行了分析,首先推导了一个修正的Reissner变分原理,它仅要求构造C0类场变量,避免了闭锁现象的产生。所有的场变量皆采用线性插值。最后得到一个矩阵型的位移广义本征值方程,刚度矩阵对称、正定。计算结果表明本文采用的方法简单、可靠,较为令人满意。  相似文献   

6.
研究了赋予一般分离型边界条件的N维向量Sturm-Liouville方程的特征值问题,获得了该系统的一个正则迹公式.迹公式不仅形式美观,而且它在反谱理论中具有重要的作用.  相似文献   

7.
Hybrid control systems are considered, combining continuous-time dynamics and discrete-time dynamics, and modeled by differential equations or inclusions, by difference equations or inclusions, and by constraints on the resulting dynamics. Solutions are defined on hybrid time domains. Finite-horizon and infinite-horizon optimal control problems for such control systems are considered. Existence of optimal open-loop controls is shown. The assumptions used include, essentially, the existence for the (non-hybrid) continuous-time case; the existence for the (non-hybrid) discrete-time case; mild conditions on the endpoint penalties; and closedness and boundedness, in the finite-horizon case, of the set of admissible hybrid time domains. Examples involving switching systems and hybrid automata are included.  相似文献   

8.
The paper considers different formulations of inverse eigenvalue problems for matrices whose entries either polynomially or rationally depend on unknown parameters. An approach to solving inverse problems together with numerical algorithms is suggested. The solution of inverse problems is reduced to the problem of finding the so-called discrete solutions of nonlinear algebraic systems. The corresponding systems are constructed using the method of traces, and their discrete roots are found by applying the algorithms for solving nonlinear algebraic systems in several variables previously suggested by the author. Bibliography: 30 titles.  相似文献   

9.
The purpose of this paper is to study the eigenvalue problems for a class of positive nonlinear operators. Using projective metric techniques and the contraction mapping principle, we establish existence, uniqueness and continuity results for positive eigensolutions of a particular type of positive nonlinear operator. In addition, we prove the existence of a unique fixed point of the operator with explicit norm-estimates. Applications to nonlinear systems of equations and to matrix equations are considered.  相似文献   

10.
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  相似文献   

11.
The FEAST eigenvalue algorithm is a subspace iteration algorithm that uses contour integration to obtain the eigenvectors of a matrix for the eigenvalues that are located in any user‐defined region in the complex plane. By computing small numbers of eigenvalues in specific regions of the complex plane, FEAST is able to naturally parallelize the solution of eigenvalue problems by solving for multiple eigenpairs simultaneously. The traditional FEAST algorithm is implemented by directly solving collections of shifted linear systems of equations; in this paper, we describe a variation of the FEAST algorithm that uses iterative Krylov subspace algorithms for solving the shifted linear systems inexactly. We show that this iterative FEAST algorithm (which we call IFEAST) is mathematically equivalent to a block Krylov subspace method for solving eigenvalue problems. By using Krylov subspaces indirectly through solving shifted linear systems, rather than directly using them in projecting the eigenvalue problem, it becomes possible to use IFEAST to solve eigenvalue problems using very large dimension Krylov subspaces without ever having to store a basis for those subspaces. IFEAST thus combines the flexibility and power of Krylov methods, requiring only matrix–vector multiplication for solving eigenvalue problems, with the natural parallelism of the traditional FEAST algorithm. We discuss the relationship between IFEAST and more traditional Krylov methods and provide numerical examples illustrating its behavior.  相似文献   

12.
This paper is concerned with a numerical approach to the problem of finding the leftmost eigenvalues of large sparse nonsymmetric generalised eigenvalue problems which arise in stability studies of incompressible fluid flow problems. The matrices have a special block structure that is typical of mixed finite element discretizations for such problems. The numerical approach is an extension of the hybrid technique introduced by Saad [22] and utilizes the idea of preconditioning the eigenvalue problem before applying Arnoldi's method. Two preconditioners, one a modified Cayley transform, the other a Chebyshev polynomial transform, are compared in numerical experiments on a double diffusive convection problem and the Cayley transform proves superior. The Cayley transform is then used to provide numerical results for the finite Taylor problem.  相似文献   

13.
1. IntroductionLet fi be a unit sqllare domain in the ac-plane and Th = {eij}:j71 be a rectangularpartition of the domain .fi, where us m are two positive illtegers, eij ~ [xi-1 ) xi] x [yi-1, yi]are rectagular elements, and0~ xo < al < ..' < xu = 1, 0 = yo < yi < ... < ac = 1are two one-dimensional partitions on the x-axis and yials, respectively. Define hi =xi - fi-h hi = yi - ie-l, and the mesh size h = ma-c{hi, hi}::,. As usual, Th is said tobe quasi-uniform if there exists a constant c s…  相似文献   

14.
The Fu?ík spectrum for systems of second order ordinary differential equations with Dirichlet or Neumann boundary values is considered: it is proved that the Fu?ík spectrum consists of global C1 surfaces, and that through each eigenvalue of the linear system pass exactly two of these surfaces. Further qualitative, asymptotic and symmetry properties of these spectral surfaces are given. Finally, related problems with nonlinearities which cross asymptotically some eigenvalues, as well as linear-superlinear systems are studied.  相似文献   

15.
A complete treatment of the binary nonlinearizations of spectral problems of the nonlinear Schrödinger (NLS) equation with the choice of distinct eigenvalue parameters is presented. Two kinds of constraints between the potentials and the eigenfunctions of the NLS equation are considered. From the first constraint, a pair of new finite-dimensional completely integrable Hamiltonian systems which constitute an integrable decomposition of the NLS equation are obtained. From the second constraint, a novel finite-dimensional integrable Hamiltonian system, which includes the system of multiple three-wave interaction as a special case, is obtained. It is found that the eigenvalue parameters real or not can lead to completely different symplectic structures of the restricted NLS flows. In addition, a relationship between the binary restricted Ablowitz–Kaup–Newell–Segur flows and the restricted NLS flows is revealed.  相似文献   

16.
A hybrid method was given by Ram et al. (2011) [15] for solving the partial quadratic eigenvalue assignment problem of single-input vibratory systems. In this paper, we consider the partial quadratic eigenvalue assignment problem of multi-input vibratory systems. We solve the multi-input partial quadratic eigenvalue assignment problem by a multi-step hybrid method using both the system matrices and the receptance measurements. Our method can assign the partial expected eigenvalues and keep the no spillover property. We also extend our method to the case when there exists time delay between measurements of state and actuation of control. Numerical tests show the effectiveness of our method.  相似文献   

17.
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.  相似文献   

18.
It is shown that certain eigenvalue problems for ordinary differential operators with boundary conditions depending holomorphically on the eigenvalue parameter can be linearized by making use of the theory of operator colligations. As examples, first order systems with boundary conditions depending polynomially on and Sturm-Liouville problems with -holomorphic boundary conditions are considered.  相似文献   

19.
The eigenvalue and the stability of singular differential systems with delay are considered. Firstly we investigate some properties of the eigenvalue, then give the exact exponential estimation for the fundamental solution, and finally discuss the necessary and sufficient condition of uniform asymptotic stability.  相似文献   

20.
The general nonlinear self-adjoint eigenvalue problem for systems of ordinary differential equations is considered. A method is proposed for reducing the problem to one for a Hamiltonian system. Results for Hamiltonian systems previously obtained by the authors are extended to this system.  相似文献   

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

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