一般Gauss-Markov模型中可估函数的线性Minimax估计

设Y是具有均值Xβ和协方差阵σ2V的n维随机向量,Sβ是线性可估函数,这里X,S和V≥0是已知矩阵,β∈Rp和σ2＞0是未知参数.本文分别在给定的矩阵损失和二次损失下研究了线性估计的Minimax性.在适当的假设下,得到了Sβ的唯一线性Minimax估计(有关唯一性在几乎处处意义下理解).     

二次损失下一般Gauss-Markov模型中可估函数的线性Minimax估计

设Y是具有均值Xβ和协方差阵σ~2V的n维随机向量,Sβ是线性可估函数,这里X,S和V≥0是已知矩阵,β∈R~p和σ~2>0是未知参数。本文在二次损失下研究了线性估计的Minimax性。在适当的假设下,得到了Sβ的唯一线性Minimax估计(有关唯一性在几乎处处意义下理解)     

一般正态线性模型中可估函数的线性Minimax估计

对于一般正态线性模型y～N(Xβ,σ2V),这里X和V≥0是已知矩阵,β∈Rp和σ2＞0是未知参数,在二次损失下我们研究了可估函数DXβ的线性估计在一切估计类中的Minimax性,得到了DXβ的唯一线性Minimax估计(有关唯一性在几乎处处意义下理解).     

矩阵损失下随机回归系数和参数的线性Minimax估计

对于一般的随机效应线性模型Y=Xβ+ε,这里β和ε分别是p维和n维的随机向量,且E(βε)=(Aa0),Cov(βε)=σ2(V10 0V2),(Vi≥0,i=1,2)我们定义了Sα+Qβ的线性Minimax估计,在一定条件下得到了Sα+Qβ在线性估计类中的Minimax估计,并在几乎处处意义下证明了它的唯一性.     

正态总体中线性可预测变量的Minimax预测

在二次损失下研究了任意秩有限总体中线性可预测变量Ay的线性预测在一切预测类中的Minimax性．对于一般随机效应线性模型y=Xβ ε，(ε^β)-N(0^Ba)，σ(W′^U V^W))，这里X，B，U，V和W是已知矩阵，a∈R^k和σ^2＞0是未知参数，文中得到了Ay的惟一Minimax预测。     

二次损失下回归系数的线性Minimax估计

设有线性模型 EY=Xβ CovY=σ~2V, 这里X: _(nxp),和V: _(nxn)>0已知矩阵,β∈R~P和σ~2>0都是参数。本文估计Sβ,选取损失函数 L(d,Sβ)=((d-Sβ)′(d-Sβ))/(σ~2+β′X′V~(-1)Xβ), 其中Sβ是可估的,并给出了在线性估计类中唯一的一个线性minimax估计。     

二次损失下回归系数的线性Minimax估计

设有线性模型EY=Xβ,CovY=σ~2V,这里X和 V_(:nxn)>0已知矩阵,β∈R~p 和σ~2>0都是参数.本文估计 Sβ,选取损失函数L(d,Sβ)=其中 Sβ是可估的,并给出了在线性估计类中唯一的一个线性 minimax 估计.     

矩阵损失下回归系数的线性MINIMAX估计

这里 Y∶n×1为随机向量,X∶n×p,V∶n×n>0已知,β∈R~p,σ~2>0为未知参数,我们要估计β的可估函数 Sβ,S∶k×p 是常数矩阵,且存在 D,使 S=DX.吴启光采用矩阵损失(d-Sβ)(d-Sβ)′,考虑一个线性(齐次的或非齐次的)估计在线性(齐次的或非齐次的)估计类中的可容许性.本文对矩阵损失作了修改,考虑一个线性(齐次的或非齐次的)估计在线性(齐次的或非齐次的)估计类中的 Minimax 性.设     

矩阵损失下多元统计中期望向量的线性Minimax估计

设yi，y2，…，yn，i．i．d，Ey1＝β，Cov（y1）＝∑，这里ε∈RP和∑＞0未知，我们估计β，估计类为L＝｛Liyi：Li为p阶常数方阵，i＝1，2，…，n｝，损失函数为其中V1，V2＞0已知，我们研究β的一个线性估计在L中的Minimax性．主要结果是1．当V2＝kV1，k＞0时，β的唯一的Ⅰ-型线性Minimax估计为Y／（1＋），其中Y＝＝2．当V2＝kV1对所有k＞0不成立，但V1V2＝V2V1时，β的Ⅰ-型线性Minimax估计不存在．3．当V1V2＝V2V1时，β的Ⅱ-型线性Minimax估计为，这个估计在V1，V2满足条件V1V2＝V2V1下变化时，构成了集合｛AY：A对称，A的特征根均在（0，1）中｝．4．对于一般的V1，V2；Y仍是β的Ⅱ-型线性Minimnax估计，这个估计在V1，V2任意变化时，构成了集会｛AY:A的特征根是实的，特征根全在（0，1）中，且A只具有线性初等因子｝．     

增长曲线模型中系数矩阵的线性容许Minimax估计

对于生长曲线模型Y＝X_1B_1X_2＋ε，Cov（ε）＝σV，本文分别在某种齐次线性估计类L0和非齐次线性估计类L_1中找到了系数矩阵的线性可估函数KBL的容许Minimax估计，并且证明了这种估计是唯一的．     

RECENT PROGRESS ON SPHERICAL HARMONIC APPROXIMATION MADE BY BNU RESEARCH GROUP ——In memory of Professor Sun Yongsheng

As early as in 1990, Professor Sun Yongsheng, suggested his students at Beijing Normal University to consider research problems on the unit sphere. Under his guidance and encouragement his students started the research on spherical harmonic analysis and approximation. In this paper, we incompletely introduce the main achievements in this area obtained by our group and relative researchers during recent 5 years （2001-2005）. The main topics are： convergence of Cesaro summability, a.e. and strong summability of Fourier-Laplace series; smoothness and K-functionals; Kolmogorov and linear widths.     

A unified approach to certain problems of best local approximation

In this paper we study best local quasi-rational approximation and best local approximation from finite dimensional subspaces of vectorial functions of several variables. Our approach extends and unifies several problems concerning best local multi-point approximation in different norms.     

Boundedness for commutators of multipliers on Hardy type spaces

In this paper, we study the commutators generalized by multipliers and a BMO function. Under some assumptions, we establish its boundedness properties from certain atomic Hardy space Hb^p（R^n） into the Lebesgue space L^p with p 〈 1.     

THE 8~(th) INTERNATIONAL CONGRESS ON INDUSTRIAL AND APPLIED MATHEMATICS

<正>August 10-14,2015Beijing,ChinaThe International Congress on Industrial and Applied Mathematics(ICIAM)is the premier international congress in the field of applied mathematics held every four years under the auspices of the International Council for Industrial and Applied Mathematics.From August 10 to 14,2015,mathematicians,scientists     

Towards Excellence in Science Chinese Academy of Sciences

<正>May 26,2014,Beijing Science is a human enterprise in the pursuit of knowledge.The scientific revolution that occurred in the 17th Century initiated the advances of modern science.The scientific knowledge system created by     

Bounds for the zeros of polynomials

Let P(z)=∑↓j=0↑n ajx^j be a polynomial of degree n. In this paper we prove a more general result which interalia improves upon the bounds of a class of polynomials. We also prove a result which includes some extensions and generalizations of Enestrǒm-Kakeya theorem.     

Boundedness of commutators related to Marcinkiewicz integrals on hardy type spaces

In this paper, the authors study the boundedness of the operator [μΩ, b], the commutator generated by a function b ∈ Lipβ(Rn)(0 ＜β≤ 1) and the Marcinkiewicz integrals μΩ, on the classical Hardy spaces and the Herz-type Hardy spaces in the case Ω∈ Lipα(Sn-1)(0 ＜α≤ 1).     

Jacobi polynomials used to invert the laplace transform

Given the Laplace transform F(s) of a function f(t), we develop a new algorithm to find an approximation to f(t) by the use of the classical Jacobi polynomials. The main contribution of our work is the development of a new and very effective method to determine the coefficients in the finite series expansion that approximation f(t) in terms of Jacobi polynomials. Some numerical examples are illustrated.     

Generalization of the interaction between Haar approximation and polynomial operators to higher order methods

In applications it is useful to compute the local average empirical statistics on u. A very simple relation exists when of a function f（u） of an input u from the local averages are given by a Haar approximation. The question is to know if it holds for higher order approximation methods. To do so, it is necessary to use approximate product operators defined over linear approximation spaces. These products are characterized by a Strang and Fix like condition. An explicit construction of these product operators is exhibited for piecewise polynomial functions, using Hermite interpolation. The averaging relation which holds for the Haar approximation is then recovered when the product is defined by a two point Hermite interpolation.