关于Fuzzy拓扑线性空间的某些结果

本文给出了Ｆｕｚｚｙ拓扑线性空间的若干特征刻划，简化了判断Ｆｕｚｚｙ拓扑线性空间的条件，研究了Ｆｕｚｚｙ拓扑线性空间的层次结构，揭示了Ｆｕｚｚｙ拓扑线性空间与分明拓扑线性空间的内在联系，得到了Ｆｕｚｚｙ拓扑线性空间的“平移不变性”与“局部凸性”都是可截性质。     

On regular linear relations

For a closed linear relation in a Banach space the concept of regularity is introduced and studied. It is shown that many of the results of Mbekhta and other authors for operators remain valid in the context of multivalued linear operators. We also extend the punctured neighbourhood theorem for operators to linear relations and as an application we obtain a characterization of semiFredholm linear relations which are regular.     

二次损失下带线性等式约束的线性模型中的线性预测的可容许性

本文针对带线性等式约束的线性模型 ,在二次损失下研究了线性预测的可容许性 ,得到了条件线性可预测变量的线性预测 Lys(Lys+ a)是可容许线性预测的充要条件。     

单A直和子空间

引入单直和子空间的概念,证明了线性空间可唯一分解为单直和子空间的直和,并且给出了计算方法.     

关于仿射线性相关性的探讨

在线性空间中引入了仿射线性相关的概念,给出了它的特征刻画及若干重要性质,并用仿射线性相关性刻画了非齐线性方程组解的结构。     

线性正算子序列在空间C_m(D)的收敛性问题

本文将Коровкин关于线性正算子序列和线性连续多项式算子序列逼近一元连续函数的主要结果推广到ｍ维连续函数空间Ｃｍ（Ｄ）．     

矩阵损失下一般Gauss-Markov模型线性预测的可容许性

本文研究了一般Gauss-Markov模型中线性可预测变量的线性预测的可容许性.在给出线性预测可容许性定义的基础上,通过构造一个特殊的常量矩阵D0,分别得到了齐次和非齐次线性预测类中可容许的充要条件.     

向量组线性相关性的教学方法与技巧

向量组线性相关性是线性代数教学中的一项重要内容．由于概念比较抽象、定理难以理解,因此一直是线性代数教学环节中的一项难点．通过对向量组线性相关性的定义以及判断方法进行了形象的描述,建立向量组线性相关性与矩阵、线性方程组之间的关系,有利于学生理解向量组线性相关性的真正内涵与简便求解方法．     

非齐次线性方程组无解条件的应用

给出了非齐次线性方程组无解的条件在向量组的线性相关性、矩阵的秩及线性方程组解的判定上的一些应用.     

端单调线性泛函的存在性(英文)

讨论了偏序线性空间的代数对偶空间上的端单调线性泛函的延拓性．进一步,还推导出端单调线性泛函的存在性定理．     

On common linear copositive Lyapunov functions for pairs of stable positive linear systems

We study the common linear copositive Lyapunov functions of positive linear systems. Firstly, we present a theorem on pairs of second order positive linear systems, and give another proof of this theorem by means of properties of geometry. Based on the process of the proof, we extended the results to a finite number of second order positive linear systems. Then we extend this result to third order systems. Finally, for higher order systems, we give some results on common linear copositive Lyapunov functions.     

基于代数曲线上具有高广义联合线性复杂度的多重序列

多重序列的联合线性复杂度是衡量基于字的流密码体系安全的一个重要指标. 由元素取自F_q上的m 重序列和元素取自F_q^m 上的单个序列之间的一一对应, Meidl 和Özbudak 定义多重序列的广义联合线性复杂度为对应的单个序列的线性复杂度. 在本文中, 我们利用代数曲线的常数域扩张, 研究两类多重序列的广义联合线性复杂度. 更进一步, 我们指出这两类多重序列同时具有高联合线性复杂度和高广义联合线性复杂度.     

完备赋准范空间上一类无界线性随机算子的谱分解定理

本文利用随机内积空间方法给出了完备赋准范空间上一类无界线性随机算子的谱分解定理。此结果不仅推广了对称随机线性算子的谱分解定理，而且限于原情形也使其处理简明、清晰。     

Minimax linear programming problem

In this paper, we consider the following minimax linear programming problem: min z = max_{1 ≤ j ≤ n}{C_jX_j}, subject to Ax = g, x ≥ 0. It is well known that this problem can be transformed into a linear program by introducing n additional constraints. We note that these additional constraints can be considered implicitly by treating them as parametric upper bounds. Based on this approach we develop two algorithms: a parametric algorithm and a primal—dual algorithm. The parametric algorithm solves a linear programming problem with parametric upper bounds and the primal—dual algorithm solves a sequence of related dual feasible linear programming problems. Computation results are also presented, which indicate that both the algorithms are substantially faster than the simplex algorithm applied to the enlarged linear programming problem.     

Posynomial geometric programming as a special case of semi-infinite linear programming

This paper develops a wholly linear formulation of the posynomial geometric programming problem. It is shown that the primal geometric programming problem is equivalent to a semi-infinite linear program, and the dual problem is equivalent to a generalized linear program. Furthermore, the duality results that are available for the traditionally defined primal-dual pair are readily obtained from the duality theory for semi-infinite linear programs. It is also shown that two efficient algorithms (one primal based and the other dual based) for geometric programming actually operate on the semi-infinite linear program and its dual.     

线性变换的值域与核的维数关系定理的证法探析

本文首先证明了有限维线性空间上的线性变换是单射当且仅当它是满射这一结论,其次分析了通常高等代数教材中关于线性变换的值域与核的维数关系定理的两种证明方法,并给出了该定理的一种新的证明方法.     

Error linear complexity measures for multisequences

Complexity measures for sequences over finite fields, such as the linear complexity and the k-error linear complexity, play an important role in cryptology. Recent developments in stream ciphers point towards an interest in word-based stream ciphers, which require the study of the complexity of multisequences. We introduce various options for error linear complexity measures for multisequences. For finite multisequences as well as for periodic multisequences with prime period, we present formulas for the number of multisequences with given error linear complexity for several cases, and we present lower bounds for the expected error linear complexity.     

解空间结构与几何空间中线面关系的判定

讲述了如何通过分析线性方程组导出组的解空间结构去判定几何空间中的线面关系.     

两个线性模型间最优线性无偏预测的等价性

设M1和M2是两个带有预测量的线性模型,通过使用矩阵秩方法,本文给出了模型M1下预测量的最优线性无偏预测同时也是模型M2下的最优线性无偏预测的充分必要条件.作为这个结果的应用,我们给出了两个线性混合模型间最优线性无偏预测等价性的充分必要条件.     

矩阵损失函数下回归系数矩阵的非齐次线性估计的可容许性

在二次矩阵损失函数下研究了协方差矩阵未知的多元线性模型中回归系数矩阵的可估线性函数的矩阵非齐次线性估计的可容许性,给出了矩阵非齐次线性估计在线性估计类中可容许的一个充要条件.