关于特征值的平方和的注记

探讨了特征值的平方和这一计算问题,指出了常用方法的不足之处,并在深入研究方阵相似的基础之上弥补了这一不足,彻底解决了这一问题,此外运用这种方法还能解决特征值高次幂之和与多项式之和的计算问题.最后文中给出了一种新的计算特征值平方和的方法,这种方法能够回避第一种方法的不足,但缺点是不易推广.     

三维Poisson方程特征值的四种有限元解及比较

应用三维EQ1rot元、三维Crouzeix-Raviart元、八节点等参数元、四面体线性元计算三维Poisson方程的近似特征值.计算结果表明:三维EQ1rot元和三维Crouzeix-Raviart元特征值下逼近准确特征值,八节点等参数元、四面体线性元特征值上逼近准确特征值,三维EQr1ot元和三维Crouzeix-Raviart元外推特征值下逼近准确特征值.计算结果还表明三维Crouzeix-Raviart元是一种计算效率较高的非协调元.     

多参数结构特征二阶灵敏度

提出了一种有效计算多参数结构特征值与特征向量二阶灵敏度矩阵--Hessian矩阵的方法.将特征值和特征向量二阶摄动法转变为多参数形式,推导出二阶摄动灵敏度矩阵,由此得到特征值和特征向量的二阶估计式.该法解决了无法用直接求导法计算特征值和特征向量二阶灵敏度矩阵的问题.数值算例说明了该算法的应用和计算精度.     

二次特征值问题特征对的一阶与二阶偏导数

本文研究了解析依赖于多参数的二次特征值问题特征对偏导数的计算.利用计算广义特征值问题特征向量偏导数的模态法.提出了一种计算二次特征值问题特征对一阶、二阶偏导数的方法.本文最后以弹簧质点阻尼系统为例验证了所给结论的正确性和方法的有效性.     

基于矩阵幂运算的重特征值存在性定理

对于判断矩阵重特征值的存在性问题,运用“若λ是矩阵A的特征值,则入“是Ak的特征值”这一性质,通过矩阵的迹与特征值的关系,得到了实数域上矩阵重特征值的存在性定理并给出了证明．定理实现了“由矩阵幂运算来判断矩阵重特征值的存在性”这样一个计算过程,对讨论矩阵特征值问题具有一定的启示意义．     

具有混合型边界条件的左定Sturm-Liouville问题特征值的下标计算(英文)

本文研究具有混合型边界条件的左定Sturm-Liouvile问题特征值的下标计算问题.首先给出具有分离型边界条件和混合型边界条件的左定Sturm-Liouville问题的特征值之间的不等式;然后利用这个结果给出一种计算混合型边界条件下左定Sturm-Liouville问题特征值下标的方法.     

亏损特征值的灵敏度分析

研究了广义特征问题中特征值和不变特征子空间对参数的导数,利用隐函数定理证明了亏损广义特征值问题的平均特征值对参数的解析性,并利用标准特征值的灵敏度分析得到了可约化广义亏损特征值的平均值和相应的不变子空间对参数的导数.这一结果在结构优化、模型修正、以及故障诊断等领域中有着重要应用,为工程计算提供了理论依据.     

二阶矩阵的特征值和特征向量常考题型例析

矩阵的特征值和特征向量是矩阵与变换的一个非常重要的内容,利用矩阵的特征值和特征向量,可以方便地计算多次矩阵变换的结果,而且在实际工程计算和工程控制中也发挥着重要作用.二阶矩阵的特征值和特征向量有两个基本内容.一是二阶矩阵的特征值和特征向量的概念：设A是一个二阶矩阵,如果对于实数λ,存在一个非零向量α,使得Aα=λα,那么λ称为A的一个特征值,而α称为A的属于特征值λ的一个特征向量.     

三对角矩阵的特征值及其应用

给出了计算一种三对角矩阵的特征值和特征向量的公式.利用矩阵的特征值理论证明了一些三角恒等式,特别是一些与Fibonacci数和第二类Chebyshev多项式有关的三角恒等式.     

一种通用的复模态矩阵摄动法

对于非自伴随系统,提出了一种通用的复模态矩阵摄动法.该法能同时适用于孤立特征值,重特征值及密集(相近)特征值三种复特征值情况.由复特征子空间缩聚技术求解低阶摄动项,高阶摄动项则由逐次逼近过程求得.三个计算实例表明,该通用方法合理可靠,精度高.     

A hybrid iterative method for symmetric positive definite linear systems

A hybrid iterative scheme that combines the Conjugate Gradient (CG) method with Richardson iteration is presented. This scheme is designed for the solution of linear systems of equations with a large sparse symmetric positive definite matrix. The purpose of the CG iterations is to improve an available approximate solution, as well as to determine an interval that contains all, or at least most, of the eigenvalues of the matrix. This interval is used to compute iteration parameters for Richardson iteration. The attraction of the hybrid scheme is that most of the iterations are carried out by the Richardson method, the simplicity of which makes efficient implementation on modern computers possible. Moreover, the hybrid scheme yields, at no additional computational cost, accurate estimates of the extreme eigenvalues of the matrix. Knowledge of these eigenvalues is essential in some applications.Research supported in part by NSF grant DMS-9409422.Research supported in part by NSF grant DMS-9205531.     

An eigenvalue problem arising in a patch formation model

A simple numerical scheme has been developed for the solution of the eigenvalue problem arising in a patch formation model given by Del Grosso et al. [1]. The scheme is based on finding bounds which separate the eigenvalues. The exact eigenvalues are obtained by solving an algebraic equation given by the corresponding regular Frobenius series solution. At the same time eigenfunctions may also be obtained from this series solution.     

The Difference Laplace Operator on a Seven-Point Nonorthogonal Pattern of a Rectangular Grid and Its Spectral Properties

We found an explicit form of eigenfunctions and eigenvalues of the difference Laplace operator on a seven-point nonorthogonal pattern of a rectangular grid for the second boundary-value problem. Estimates for maximal and minimal eigenvalues are found. Dispersion properties of an explicit difference scheme are studied for the two-dimensional wave equation. The scheme uses an approximation of the Laplace operator on a seven-point pattern.     

Operator-splitting methods in respect of eigenvalue problems for nonlinear equations and applications for Burgers equations

In this article we consider iterative operator-splitting methods for nonlinear differential equations with respect to their eigenvalues. The main focus of the proposed idea is the fixed-point iterative scheme that linearizes our underlying equations. On the basis of the approximated eigenvalues of such linearized systems we choose the order of the operators for our iterative splitting scheme. The convergence properties of such a mixed method are studied and demonstrated. We confirm with numerical applications the effectiveness of the proposed scheme in comparison with the standard operator-splitting methods by providing improved results and convergence rates. We apply our results to deposition processes.     

An inverse Sturm-Liouville problem for an impedance

A numerical method for reconstructing an impedance in a Sturm-Liouville operator from finitely many eigenvalues is investigated. The method constructs an impedance that has the given eigenvalues by finding a zero of a nonlinear finite dimensional map. A Newton scheme is investigated and numerical examples are considered.     

A mixed method of subspace iteration for Dirichlet eigenvalue problems

A full multigrid scheme was used in computing some eigenvalues of the Laplace eigenvalue problem with the Dirichlet boundary condition. We get a system of algebraic equations with an aid of finite difference method and apply subspace iteration method to the system to compute first some eigenvalues. The result shows that this is very effective in calculating some eigenvalues of this problem.     

Algebraic Multiplicities Arising from Static Feedback Control Systems of Parabolic Type

In stabilization studies of linear parabolic control systems, a successful approach is a scheme employing dynamic compensators in the feedback loop. An essential reason is the fact that both sensors and actuators cannot be designed freely, especially in the case of boundary observation/boundary feedback. Most fundamental in this scheme is a simple stabilization result under the static feedback control scheme. In this scheme, little attention has been paid to how to assign new eigenvalues of the feedback system. In this article, we show a new feature of pole assignment that shows some choices of new eigenvalues cause a deterioration of the stability property. An algebraic growth rate is added to the feedback system in such a choice.     

Geometric construction of some families of two-class and three-class association schemes from nondegenerate quadrics in characteristic two

1.IntroductionThetheoryoflinearspacesintriteprojectivegeometryhasbeenusedbyseveralauthorsinconstructingBIBandPBIBdesigns.BoseI21firstusedthepropertiesofquadricsurfaCesinfiniteprojectivegeometryoftwoandthreedimensionsforconstr-netingexperimelltaldesigns.D.K.Ray-Chaudhurils]usedthegeometryofquadricstoconstructseveralseriesofPBIBdesignswithtwoassociateclasses.I.M.Chakravartila]usednondegenerateanddegenerateHebotianvarietiestoconstructsomefamiliesoftwo-classandthree-classassociationschemes…     

Enthalpy damping for the steady Euler equations

For inviscid steady flow problems where the enthalpy is constant at steady state, it has been proposed by Jameson, Schmidt, and Turkel to use the difference between the local enthalpy and the steady state enthalpy as a driving term to accelerate convergence of iterative schemes. This idea is analyzed here, both on the level of the partial differential equation and on the level of a particular finite difference scheme. It is shown that for the two-dimensional unsteady Euler equations, a hyperbolic system with eigenvalues on the imaginary axis, there is no enthalpy damping strategy which can move all the eigenvalues into the open left half plane. For the numerical scheme, however, the analysis shows and examples verify that enthalpy damping can be effective in accelerating convergence to steady state.     

半简单本征值有限元外推

林群等的工作(见[1—3])奠定了本征值有限元外推的理论基础,证明了外推方法对简单本征值有效.本文要证明外推对半简单本征值也有效.由[1—3]的证明过程易知,只要证明存在λ_h,λ_(h/2)的本征函数 u_h,u_(h/2),它们都逼近λ的同一个本征函数 u 就可以了.但由于重本征值在离散化后一般被分离,给证明造成困难.本文提出了一个实施林群外推方法的新方案,巧妙地解决了这个问题.这方案花较少代价就能提高半简单本征值有限元近似解的精度阶.