带约束线性模型中的可容许线性估计

带约束线性模型中的可容许线性估计张双林（黑龙江大学数学系，哈尔滨１５００８０）１．引言及主要结果考虑线性模型当参数不受约束时，Ｒａｏ［１］，吴启光［２］，朱显海和鹿长余［３］等给出了Ｓｎ×Ｐβ的线性估计在线性类中是可容许的充要条件，当参数在约束条件，...     

不同混合线性模型下线性函数的最佳线性无偏预测相等的条件

考虑一个不仅对协方差矩阵没有任何秩假设,而且对随机效应向量和随机误差向量之间的关系没有任何限制的混合线性模型.给出了线性统计量Ay是线性函数f（L,N）的最佳线性无偏预测的充要条件;同时也给出了在混合线性模型M1下BLUP（f（L,N））仍是在混合线性模型M2下BLUP（f（L,N））的充要条件;最后给出在两混合线性模型下BLUP（f（L,N））相等的条件.     

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

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

组合线性算子

本文给出一种构造组合线性逼近算子的方法，由此可得到具有特殊逼近性质的线性算子．     

线性矩阵方程与线性矩阵方程组

研究了线性矩阵方程(组)的解的结构理论和求解方法.     

关于线性算子的右有界拟线性内逆

对于从线性空间到赋范线性空间的线性算子T引入右有界拟线性内逆的概念.在算子值域的闭包R(T)为切比雪夫子空间的条件下,给出右度量内逆的表示.证得:如果算子的值域R(T)非闭且闭包R(T)为切比雪夫的,则必存在不同的右有界拟线性内逆.     

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

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

线性微分方程的一个反问题

讨论了线性微分方程的一个反问题.给定一个线性无关的函数组,可以得到一个高阶线性微分方程,该微分方程的基本解组恰好是此函数组.另外,对一阶线性微分方程组也进行了类似的讨论.     

F连续线性映象空间

本文采用（１）中给出的Ｆｕｚｚｙ拓扑线性空间的定义，并利用Ｆｕｚｚｙ拓扑线性空间的有关理论，对Ｆｕｚｚｙ连续线性映象空间作了较深入的研究。     

线性等式约束下奇异线性模型参数的条件BLU估计

考虑带线性等式约束的奇异线性模型对任一条伯可估函数Ｃ’β，本文给出了它的所有条件ＢＬＵ估计，并建立了Ｃ‘（Ｘ’Ｘ）＋Ｘ‘ｙ为Ｃ’β的条件ＢＬＵ估计的一个充分条件。最后研究了带线性等式约束的多元线性模型参数阵的条件ＢＬＵ估计。     

探讨线性代数的核心

本文从关于线性代数基本结构的各种不同看法出发，探讨线性代数在整个数学学习中的基本问题，并根据线性代数基本问题讨论线性代数的结构安排.     

On the stability of linear systems with an exact constraint set

This paper deals with the stability of the intersection of a given set with the solution, , of a given linear system whose coefficients can be arbitrarily perturbed. In the optimization context, the fixed constraint set X can be the solution set of the (possibly nonlinear) system formed by all the exact constraints (e.g., the sign constraints), a discrete subset of (as or { 0,1} ⁿ , as it happens in integer or Boolean programming) as well as the intersection of both kind of sets. Conditions are given for the intersection to remain nonempty (or empty) under sufficiently small perturbations of the data. Research supported by Fondecyt Grant 1020(7020)-646. Research supported by DGES and FEDER, Grant BFM2002-04114-C02-01     

A Characterization of Partially Ordered Sets with Linear Discrepancy Equal to 2

The linear discrepancy of a poset P is the least k such that there is a linear extension L of P such that if x and y are incomparable in P, then |h _L (x)–h _L (y)|≤k, where h _L (x) is the height of x in L. Tanenbaum, Trenk, and Fishburn characterized the posets of linear discrepancy 1 as the semiorders of width 2 and posed the problem of characterizing the posets of linear discrepancy 2. We show that this problem is equivalent to finding the posets with linear discrepancy equal to 3 having the property that the deletion of any point results in a reduction in the linear discrepancy. Howard determined that there are infinitely many such posets of width 2. We complete the forbidden subposet characterization of posets with linear discrepancy equal to 2 by finding the minimal posets of width 3 with linear discrepancy equal to 3. We do so by showing that, with a small number of exceptions, they can all be derived from the list for width 2 by the removal of specific comparisons. The first and second authors were supported during this research by National Science Foundation VIGRE grant DMS-0135290.     

A note on an open problem in linear complementarity

LetK be the class ofn × n matricesM such that for everyn-vectorq for which the linear complementarity problem (q, M) is feasible, then the problem (q, M) has a solution. Recently, a characterization ofK has been obtained by Mangasarian [5] in his study of solving linear complementarity problems as linear programs. This note proves a result which improves on such a characterization.Research sponsored by the United States Army under Contract No. DAAG29-75-C-0024 and the National Science Foundation under Grant No. MCS75-17385.     

A remark on linear permutation polynomials

We give an explicit representation of the class of linear permutation polynomials. By the representation, the number of them can be computed easily.     

An index formula for the product of linear relations

Let , and be linear spaces and let A and B be linear relations from to and from to , respectively. The main result of this note is a formula which relates the nullities and the defects of the relations A and B with those of the product relation BA.     

Average relational distance in linear extensions of posets

We consider a natural analogue of the graph linear arrangement problem for posets. Let P=(X,?) be a poset that is not an antichain, and let λ:X→[n] be an order-preserving bijection, that is, a linear extension of P. For any relation a?b of P, the distance between a and b in λ is λ(b)−λ(a). The average relational distance of λ, denoted , is the average of these distances over all relations in P. We show that we can find a linear extension of P that maximises in polynomial time. Furthermore, we show that this maximum is at least , and this bound is extremal.     

An algorithm for computing equilibria in a linear monetary economy

An algorithm is presented for computing equilibria in a linear monetary economy, that is, an exchange economy in which all individuals have linear utility functions and in which goods are bought and sold only in exchange for money. The algorithm computes the equilibrium prices by solving a finite sequence of linear programming problems.     

模糊粗糙线性空间

将粗糙集理论引入到线性空间与模糊线性空间中,分别给出了上粗与下粗线性空间及模糊上粗与模糊下粗线性空间的概念,并研究了它们的有关性质,获得了一系列有意义的结果。     

A new method for a class of linear variational inequalities

In this paper we introduce a new iterative scheme for the numerical solution of a class of linear variational inequalities. Each iteration of the method consists essentially only of a projection to a closed convex set and two matrix-vector multiplications. Both the method and the convergence proof are very simple.This work is supported by the National Natural Science Foundation of the P.R. China and NSF of Jiangsu.