乘幂法的改进算法

本文提出了一种改进的乘幂法,一方面大大加快了收敛速度,另一方面可以方便地计算全部的特征值,最后给出一个计算的特征值通用算法。     

Stratified random walks on the n-cube

In this paper we present a method for analyzing a general class of random walks on the n-cube (and certain subgraphs of it). These walks all have the property that the transition probabilities depend only on the level of the point at which the walk is. For these walks, we derive sharp bounds on their mixing rates, i.e., the number of steps required to guarantee that the resulting distribution is close to the (uniform) stationary distribution. © 1997 John Wiley & Sons, Inc. Random Struct. Alg., 11 , 199–222, 1997     

Homogenization of eigenvalue problems in perforated domains

In this paper, we treat some eigenvalue problems in periodically perforated domains and study the asymptotic behaviour of the eigenvalues and the eigenvectors when the number of holes in the domain increases to infinity Using the method of asymptotic expansion, we give explicit formula for the homogenized coefficients and expansion for eigenvalues and eigenvectors. If we denote by ε the size of each hole in the domain, then we obtain the following aysmptotic expansion for the eigenvalues: Dirichlet: λ_ε = ε⁻² λ + λ₀ +O (ε), Stekloff: λ_ε = ελ₁ +O (ε²), Neumann: λ_ε = λ₀ + ελ₁ +O (ε²). Using the method of energy, we prove a theorem of convergence in each case considered here. We briefly study correctors in the case of Neumann eigenvalue problem.     

一类三对角矩阵任意正整数幂的计算

给出一类带有一个零行或两个零行的三对角矩阵的任意正整数幂的一般表达式.本文所用的方法较Leonaite和Rimas的方法简单,而结果既简洁又更具一般性.     

Nearest q-Flat to m Points

Recently, Bradley and Mangasarian studied the problem of finding the nearest plane to m given points in ⁿ in the least square sense. They showed that the problem reduces to finding the least eigenvalue and associated eigenvector of a certain n×n symmetric positive-semidefinite matrix. We extend this result to the general problem of finding the nearest q-flat to m points, with 0qn–1.     

基于Lanczos方法的结构动力学灵敏度分析

利用数学理论得到结构动力学重特征值的灵敏度表达式,从而解决了奇异性问题.然后,为降低计算工作量,基于Lanczos方法得到降阶的结构系统,从而得到降阶的灵敏度分析近似解.用一个算例证明的方法正确性.     

米粒组织的分歧与跃迁

运用线性全连续场的谱理论及跃迁理论讨论了太阳米粒组织的分歧和跃迁,并且从数学上证明了米粒组织的存在性.同时在一定的假设条件下了,得到了特征值,特征向量和分歧解的表达式.最后根据模型给出了米粒组织直径的估计,同时验证了该估计与实际数据基本相符.     

On the Randomized Error of Polynomial Methods for Eigenvector and Eigenvalue Estimates

In this paper we consider the problem of estimating the largest eigenvalue and the corresponding eigenvector of a symmetric matrix. In particular, we consider iterative methods, such as the power method and the Lanczos method. These methods need a starting vector which is usually chosen randomly. We analyze the behavior of these methods when the initial vector is chosen with uniform distribution over the unitn-dimensional sphere. We extend and generalize the results reported earlier. In particular, we give upper and lower bounds on the _pnorm of the randomized error, and we improve previously known bounds with a detailed analysis of the role of the multiplicity of the largest eigenvalue.     

A Computational Approach for Fluid Queues Driven by Truncated Birth–Death Processes

In this paper, we analyze fluid queues driven by truncated birth-death processes with general birth and death rates. We compute the equilibrium distribution of the content of the fluid buffer by providing efficient numerical procedures to compute the eigenvalues and the eigenvectors of the associated real sign-asymmetric tridiagonal matrix. We illustrate the effectiveness of the procedures through tables and graphs.     

On a special basis of approximate eigenvectors with local supports for an isolated narrow cluster of eigenvalues of a symmetric tridiagonal matrix

Let $ \tilde \lambda Let be an approximate eigenvalue of multiplicity m _c = n − r of an n × n real symmetric tridiagonal matrix T having nonzero off-diagonal entries. A fast algorithm is proposed (and numerically tested) for deleting m _c rows of T− I so that the condition number of the r × n matrix B formed of the remaining r rows is as small as possible. A special basis of m _c vectors with local supports is constructed for the subspace kerB. These vectors are approximate eigenvectors of T corresponding to . Another method for deleting m _c rows of T− I is also proposed. This method uses a rank-revealing QR decomposition; however, it requires a considerably larger number of arithmetic operations. For the latter algorithm, the condition number of B is estimated, and orthogonality estimates for vectors of the special basis of kerB are derived. Original Russian Text ? S.K. Godunov, A.N. Malyshev, 2008, published in Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki, 2008, Vol. 48, No. 7, pp. 1156–1166.     

Leading students towards the formal world of mathematical thinking: a mathematician’s reflections on teaching eigentheory

ABSTRACT

In this study, we analysed a mathematician’s teaching journals on eigenvalues and eigenvectors in a first-year linear algebra course. The research team employed Tall’s [How humans learn to think mathematically: Exploring the three worlds of mathematics. Cambridge University Press] three-world model of embodied, symbolic and formal as a framework for understanding the mathematician and teacher’s pedagogical reflections as he led the class to the formal world. In order to reach the formal world, he used a sequence of tasks that emphasized embodied and symbolic, as well as formal thinking. The analysis of the journals showed that the mathematician faced challenges in leading the class towards the formal world. The study also revealed that the mathematician strived to build a concept image, that, while perhaps mirroring his own, did not resonate with the students.     

从2010年考研之三道线性代数试题说起

从灵活解答2010年三道线性代数考研试题,谈理解数学基本概念及培养灵活运用数学知识处理问题能力的重要性.     

Eigenvalue-Eigenvector analysis for a class of patterned correlation matrices with an application: A comment

A correlation matrix analyzed by Kotz, Pearn and Wichern (1984) is reanalyzed with known results on balanced ANOVA models.