分配格上矩阵的特征向量

设(L,≤,∨,∧)为一分配格。满足Ax=x的向量x称为方阵A的特征向量。本文的主工目的是通过矩阵的伴随有向图来刻画矩阵的特征向量并给出矩阵特征向量的界。同时我们将定义矩阵A的上基本特征向量并讨论它的性质。     

分配格上矩阵的特征向量

主要讨论分配格上的矩阵A的标准特征向量问题.从基本概念出发,给出了全部标准特征向量的计算方法。     

关于完全完备分配格上矩阵相对于特征值的特征向量

借助于伪补和矩阵的幂序列研究了完全完备分配格上矩阵相对于特征值的特征向量的计算方法,利用特征向量的性质证明了最大特征向量的计算公式,并给出了一般特征向量的计算方法.     

关于方阵多项式的特征问题

对方阵及其矩阵多项式,给出了它们特征值、特征向量之间关系的刻画.     

求n阶实方阵A的全部模最大的特征值及其相应特征向量的幂法

本文给出并论证了 ,当 n阶实方阵 A具有 i ( 1≤ i≤ n)个 (即任意多个 )模最大的特征值时 ,用幂法求出这些模最大的特征值及其相应特征向量的方法 .该方法是对幂法理论的进一步完善     

求n阶实方阵的任意个模最大的特征值及其相应特征向量的规范化幂法

本给出并论证了当n阶实方阵A具有r(1≤r≤n）个模最大的特征值及其相应特征向量的方法，实验规范化措施，使得行范数等于1，在电子计算机上不会产生溢出停机，这是一种有实用价值的算法。     

一类特殊矩阵可对角化的判别及特征向量的求法

讨论了仅有两个互异的特征根的n阶方阵的可对角化的问题及特征向量的一种简单求法.     

矩阵特征值、特征向量的确定

首先对由 A的特征值、特征向量求 A- 1 ,AT,A* ( A的伴随矩阵 )、P- 1 AP以及 A的多项式φ( A)的特征值和特征向量的结论作了个归纳 ;对相反的情形 ,我们给出了部分已有的结果 ,并通过四道例题着重讨论了如何由 φ( A)的特征值来求 A的特征值 .     

Jordan标准形过渡矩阵的一种算法

给出Jordan定理的一个证明,以及Jordan标准形过渡矩阵的一种算法:求出一线性方程组解空间的基,解空间即是矩阵关于某特征值的特征向量、广义特征向量所张成的子空间,在该解空间中依次找出各特征向量及所对应的广义特征向量.一个8阶矩阵的计算实例表明算法简便实用.     

特征值与特征向量

特征值与特征向量的两种不同定义是一致的：线性变换/A与其对应的n阶矩阵A有相同的特征值,而n阶矩阵A的特征向量x是/A的特征向量ξ在基ε1,…εn下的坐标。     

ON A THEOREM OF A.A. LYAPUNOV

Abstract

In this note we obtain some extensions and an approximation of the Lyapunov convexity theorem by means of the bilinear integration of a set-valued function. The integration is performed successively with respect to a non-atomic, a direct sum and a Darboux vector measure. The necessary counterexamples are provided.     

A Priori and A Posteriori: A Bootstrapping Relationship

The distinction between a priori and a posteriori knowledge has been the subject of an enormous amount of discussion, but the literature is biased against recognizing the intimate relationship between these forms of knowledge. For instance, it seems to be almost impossible to find a sample of pure a priori or a posteriori knowledge. In this paper, it will be suggested that distinguishing between a priori and a posteriori is more problematic than is often suggested, and that a priori and a posteriori resources are in fact used in parallel. We will define this relationship between a priori and a posteriori knowledge as the bootstrapping relationship. As we will see, this relationship gives us reasons to seek for an altogether novel definition of a priori and a posteriori knowledge. Specifically, we will have to analyse the relationship between a priori knowledge and a priori reasoning, and it will be suggested that the latter serves as a more promising starting point for the analysis of aprioricity. We will also analyse a number of examples from the natural sciences and consider the role of a priori reasoning in these examples. The focus of this paper is the analysis of the concepts of a priori and a posteriori knowledge rather than the epistemic domain of a posteriori and a priori justification.     

NAMING A COLUMN ON A SPREADSHEET

Spreadsheets use a meaningful algebra-like notation which, research suggests, can support pupils in developing an understanding of variables. This paper discusses the activity of Year 8 pupils who were taught to name a column on a spreadsheet, and who were asked to reflect upon their activity in a stimulated recall interview. More specifically, it considers the pupils' understanding of notation, such as 'A2' and 'm', which they used when constructing spreadsheet formulae. It is suggested that experience of naming columns may help pupils to develop a clearer sense of the notation as a variable, and to make links between their spreadsheet activity and use of standard algebraic notation [1].     

A REMARK ON A BMO MARTINGALE

Let M = (Mt,Ft) be a uniformly integrable continuous martingale with MO = 0. For1 5 p < cot we setIIMllBMO. = '3p II[E[IMoo ~ MTIplFT]]'/Pll.,where the supremum is taken over all stopping times T.Set BMO. = {M: IIMllBMO. < co}. It is well known that BMO. = BMO, (VI S p 5 q).F'urthermore, all 11.llBMO. norms are equivalent andIIi ~~if;llMllBMO. = SUP T P(T < co)i'where the supremum is taken over all stopping times T satisfying P(T < co) > 0. In the laterwe shall simply …     

有限群的一个类函数的模构造

本文研究了有限群上的一个类函数.通过计算它和不可约特征标的内积,证明了它是特征标并且通过复群代数的中心的正则表示给出了它的一个模构造.     

A new characterization of A 5

Let G be a group and τ _e (G) the set of numbers of elements of G of the same order. In this paper, by τ _e (G), we give a new characterization of A ₅, where A ₅ is the alternating group of degree 5. We get the theorem following: Theorem. Let G be a group, ${G\cong A_5}$ if and only if τ _e (G) = τ _e (A ₅) = {1, 15, 20, 24}.