二元域上线性群的纯数量刻画

本文给出了仅用元的阶之集对二元域上小阶线性群及其自同构群的刻画.指出并纠正了文[5]中的错误.     

一般KdV方程的群分析

对于一般KdV方程(0,1)给出统一的相似约化,利用所得的三参数Lie点变换群,从已知解产生新的单参数解族,对于非可积情形(n=2,4,σ=-1)给出一系列的精确解或解的渐近态。     

一类线性errors－in－variables模型的参数强相合估计及其a．s．收敛速度

本文讨论了如下一类线性ｅｒｒｏｒｓ－ｉｎ－ｖａｒｉａｂｌｅｓ模型——多元线性结构关系模型β′ｘｋ＋α＝０，ξｋ＝ｘｋ＋εｋ．｛ｋ＝１，２，…，ｎ．其中，｛ｘｋ：ｋ＝１，２，…，ｎ｝为一组ｉ．ｉ．ｄ．的ｍ维随机向量，｛εｋ：ｋ＝１，２，…，ｎ｝是ｉ．ｉ．ｄ．的随机误差，Ｅ（ε１）＝０，Ｖａｒ（ε１）＝σ２Ｉｍ．且｛ｘｋ：ｋ＝１，２，…，ｎ｝与｛εｋ：ｋ＝１，２，…，ｎ｝相互独立．在一些条件下，我们证明了估计量β，α，σ２的强相合性、唯一性，并给出了估计量的收敛速度为ｏ（ｎ－１－１ｑ），这里ｑ∈［１，２）．对于Ｅ（ｘ１）ｕ１和Ｖａｒ（ｘ１）Ｖｘ的估计也得出了同样的结果     

ON THE MONOTONE CONVERGENCE OF THE PROJECTED ITERATION METHODS FOR LINEAR COMPLEMENTARITY PROBLEMS

Under suitable conditions,the monotone convergence about the projected iteration method for solving linear complementarity problem is proved and the influence of the involved parameter matrix on the convergence rate of this method is investigated.     

A NOTE ON THE SINGULAR AND EXPONENTIAL SPECTRUM IN BANACH ALGEBRAS

Abstract

Let A be a unitary Banach algebra and let B be a closed subalgebra of A that contains the unit. For an element of B we show in this note how both the singular and exponential spectrum depends on the algebra.     

关于二次规划问题分段线性同伦算法的改进

本文利用Ｃｈｏｌｅｓｋｙ分解，Ｇａｕｓｓ消去等技术和定义适当的同伦映射，将关于二次规划问题的分段线性同伦算法加以改进，改进后的算法，对于严格凸二次规划来说，计算效率与Ｇｏｌｄｆａｒｂ－Ｉｄｎａｎｉ的对偶法相当。     

关于剩余类环Zn和Galois环GR（p^e，n）上的理想双同态门限体制

本文讨论了两类特殊环上的理想双同志门限体制．利用门限体制的完善性及同态性，证明了以剩余类环Zn，和Galois环GR(p^e，n)为密钥空间的理想双同志(t，ι)-门限体制是平凡的．     

增加试验数据对岭估计的均方误差的影响

在线性模型中,对于回归系数的岭估计和广义岭估计,本文给出了选择岭参数的条件,在此条件下,岭估计和广义岭估计不仅能改善LS估计,而且增加试验数据时,它们的均方误差都会减少。同时,本文将增加试验数据换成增加附加信息,从而讨论了附加信息对混合岭估计和混合广义岭估计的影响问题。     

线性流形上D对称矩阵反问题的最小二乘解

本研究了线性流形上D对称矩阵反问的最小二乘解及其逼近问题，给出了最小二乘解的一般表达式，并就该问题的特殊情况－矩阵反问题，获得了有解的充分必要条件，并在有解的条件下得到了解的一段表达式。     

EXPERIMENTAL STUDY OF THE ASYNCHRONOUS MULTISPLITTING RELAXATION METHODS FOR THE LINEAR COMPLEMENTARITY PROBLEMS

We study the numerical behaviours of the relaxed asynchronous multisplitting methods for the linear complementarity problems by solving some typical problems from practical applications on a real multiprocessor system. Numerical results show that the parallel multisplitting relaxation methods always perform much better than the corresponding sequential alternatives, and that the asynchronous multisplitting relaxation methods often outperform their corresponding synchronous counterparts. Moreover, the two-sweep relaxed multisplitting methods have better convergence properties than their corresponding one-sweep relaxed ones in the sense that they have larger convergence domains and faster convergence speeds. Hence, the asynchronous multisplitting unsymmetric relaxation iterations should be the methods of choice for solving the large sparse linear complementarity problems in the parallel computing environments.     

DISCRETE MINUS ONE NORM LEAST-SQUARES FOR THE STRESS FORMULATION OF LINEAR ELASTICITY WITH NUMERICAL RESULTS

This paper studies the discrete minus one norm least-squares methods for the stress formulation of pure displacement linear elasticity in two dimensions. The proposed leastsquares functional is defined as the sum of the L^2 -and H^-l -norms of the residual equations weighted appropriately. The minus one norm in the functional is replaced by the discrete minus one norm and then the discrete minus one norm least-squares methods are analyzed with various numerical results focusing on the finite element accuracy and multigrid convergence performances.     

实对称矩阵广义特征值反问题

本文研究如下实对称矩阵广义特征值反问题: 问题IGEP,给定X∈R~(n×m),1=diag(λ_II_k_I,…,λ_pI_k_p)∈R~(n×m),并且λ_I,…,λ_p互异,sum from i=1 to p(k_i=m,求K,M∈SR~(n×n),或K∈SR~(n×n),M∈SR_0~(n×m),或K,M∈SR_0~(n×n),或K∈SR~(n×n),M∈SR_+~(n×n),或K∈SR_0~(n×n),M∈SR_+~(n×n),或K,M∈SR_+~(n×m), (Ⅰ)使得 KX=MXA, (Ⅱ)使得 X~TMX=I_m,KX=MXA,其中SR~(n×n)={A∈R~(n×n)|A~T=A},SR_0~(n×n)={A∈SR~(n×n)|X~TAX≥0,X∈R~n},SR_+~(n×n)={A∈SR~(n×n)|X~TAX>0,X∈R~n,X≠0}. 利用矩阵X的奇异值分解和正交三角分解,我们给出了上述问题的解的表达式.     

带线性约束的回归模型参数的Liu估计方法

针对一般带约束的最小二乘估计(ORLSE)在参数估计中处理复共线性的不足,通过引入附加随机线性约束,提出了约束Liu型估计方法.经理论证明,此方法在均方误差下较已经提出的ORLSE和约束岭估计(RRE)效果更好,并且它可以作为两种方法的推广形式.讨论了其中k, d的确定原则,并将此方法推广到了广义形式和典则形式下的估计公式.     

THE STABILITY OF LINEAR MULTISTEP METHODS FOR LINEAR SYSTEMS OF NEUTRAL DIFFERENTIAL EQUATIONS

1. IntroductionFor a large class of electrical ~ks containing IOssless transmission lines the describingequations can be reduced to a system of neutral differential equations.This paper deals with the numerical solution of initial value problems for syste…     

算子空间中秩一算子的稠密性

设u是Hilbert空间上的σ-弱闭算子空间,称u具有性质（P）,如果u中秩－算子生成的子空间在u中是σ－弱稠密的,称u具有扩张性质（P）,如果u以及包含u的每个σ－弱闭子空间都具有性质（P）,本文研究了性质（P）和扩张性质（P）,给出了它们的等从描述。     

关于Orlicz空间的H性质的注记

该文给出了Orlicz函数空间具有H性质的充分必要条件．     

Approximate Bayesian Approach to Non-Gaussian Estimation in a Linear Model with Dependent State and Noise Vectors

This paper extends the results of Masreliez [8] on the design of non-Gaussian estimators for a more general class of the parameter estimation problem when the system state and the observation noise may be dependent and non-Gaussian simultaneously. It is shown that the proposed non-Gaussian algorithms can approximate with high precision the minimum mean square estimator. Application of the approach to the design of different optimal (and stable) estimation algorithms is illustrated. The efficiency of the proposed algorithms is tested in some simulation experiments. Accepted 5 September 2000. Online publication 26 February 2001.     

Linear functional differential equations with Property A

In the paper the general linear functional differential equation with several distributed deviations is considered. Sufficient conditions for the equation to have Property A (see Definition 1.2 below) are established. The obtained results are new even for Eq. (1.4).     

A#H^＊rat为中心单代数的条件

本文用ＭｏｒｉｔａＣｏｎｔｅｘｔ的方法得到域上余ＦｒｏｂｅｎｉｕｓＨｏｐｆ代数Ｈ与Ｈ－余摸代数Ａ的Ｓｍａｓｈ积Ａ＃Ｈ＊ｒａｔ是中心单代数的条件：若Ａ／ＡＣｏＨ是Ｈ－Ｇａｌｏｉｓ扩张，且ＡＣｏＨ是中心单代数，则Ａ＃Ｈ＊ｒａｔ也是中心单代数，特别地，若ＡＣｏＨｋ，则Ａ＃Ｈ＊ｒａｔ是中心单代数，且为ｋ－空间Ａ上线性变换稠密环．作为推论给出Ｈ＃Ｈ＊ｒａｔ是本原中心单代数新的证明．     

Optimality criteria of the disk modulo allocation method for Cartesian product files

Cartesian product (CP) files have been shown to be very effective for partial match retrieval. Further the Disk Modulo (DM) allocation method has been shown to be a simple and effective method for allocating CP files onto multiple independently accessible disks to further facilitate partial match retrieval. In this paper, a useful criterion for the DM method to be the best allocation method for a given CP file is presented. The presented criterion is much more general than that suggested previously which makes the DM allocation method much more applicable for real applications.