回系数的广义根方估计及其模拟

文献［１，２］中提出了回归系数的根方估计β＾（ｋ），当回归自变量间存在复共线关系时，β＾（ｋ）较回归系数的最小二乘估计β有所改善。本文将根方估计作一拓广，得出了回归系数的广义根方估计β＾（Ｋ），其中Ｋ为对角阵。文中证明了广义根方估计β＾（Ｋ）较β＾（ｋ）能更有效地改善最小二乘估计，并给出了广义根方估计的显式解，在此基础上，提出了广义根方估计的显式解和一种确定ｋｉ的方法。     

回归系数的广义根方估计及其模拟

文献[1,2]中提出了回归系数的根方估计~(k),当回归自变量间存在复共线关系时,~(k)较回归系数的最小二乘估计有所改善,本文将根方估计作一拓广,得出了回归系数的广义根方估计~(K),其中K为对角阵,文中证明了广义根方估计~(K)较~(k)能更有效地改善最小二乘估计,并给出了广义根方估计的显式解,在此基础上,提出了广义根方估计的显式解和一种确定k_i的方法。     

方差分量谱分解估计的几个性质

对于线性混合模型中方差分量的估计，虽有多种方法，但一般情况下只有方差分析估计和谱分解估计有显式解，本文就线性混合模型中含两个方差分量的情形，对方差分析估计和谱分解估计进行了比较，证明了在一些条件下两个估计的方差相等，由此推出谱分解估计也具有方差分析估计的某些优良性．文末用实例进一步说明了文中的结果．     

平衡随机模型中方差分量的非负估计

众所周知, 对于平衡随机模型, 方差分量的方差分析估计为一致最小方差无偏估计. 本文基于方差分量的方差分析估计, 构造了一个二次不变估计类, 它包含了一些常用重要估计. 证明了该估计类在一定条件下在均方误差意义下一致优于方差分析估计, 并在此估计类基础上, 给出了方差分量的两种非负估计, 它们在均方误差意义下分别一致优于方差分析估计和限制极大似然估计, 且有显式解、容易计算.     

特征值问题混合有限元法的一个误差估计

设（λh,σh,uh）是一个混合有限元特征对.Babuska和Osborn建立了（λh,uh）的误差估计.本文导出了σh的抽象误差估计式.并把该估计式应用于二阶椭圆特征值问题Raviart-Thomas混合有限元格式和重调和算子特征值问题Ciarlet-Raviart混合有限元格式,得到了一些新的误差估计.     

有界解析函数的n阶导数估计

本文研究了有界解析函数的n阶导数估计.利用有界解析函数泰勒展开式的系数估计,得到了n阶导数估计的一般式,改进了已有的相关结果.     

有界正则函数的导数估计

在这篇文章中,主要讨论了n阶导数的估计式,即对有界正则函数φ（z)=c0 c1z … cnz^n …(在│z│1内正则）,从已知的三阶、四阶导数估计式,利用归纳法原理及有界正则函数的性质推出n阶导数的一般估计式,并推出在│z│＜1内正则的正实部函数的n阶导数的一般估计式。     

线性模型中回归参数的最佳逼近M－估计

本文首先提出了选取回归参数Ｍ－估计中函数ρ的一种新原则，然后利用ρ的最佳逼近函数定义了一种新估计－ＢＡＭＥ．并证明了其强相合性；讨论了其稳健性，较比通常的Ｍ－估计，ＢＡＭＥ有以下优点：（１）ρ的选取充分利用了误差的分布信息；（２）具有显式表达，其算法方便；（３）相合性的证明相当于ＬＳ－估计的复杂程度，比Ｍ－估计简单得多．     

一类线性混合模型的谱分解估计

谱分解估计(SDE)是新近提出的关于线性混合模型参数的一种新的估计方法,此方法的一个突出特点是同时给出固定效应参数和方差分量的显式解估计．本文就含两个方差分量的线性混合模型,对谱分解估计的性质做了进一步的研究,获得了方差分量的SDE和方差分析估计相等的充分必要条件,证明了在一定的条件下方差分量的SDE为一致最小方差无偏估计．     

左（右）逆矩阵计算的误差估计

我们在实际中常常遇到满秩长方矩阵的求逆问题,并希望知道所求逆矩阵的精度。目前常用的估计式仅给出了一个粗糙的上界(见[1]),这个上界往往放大许多,因而极不准确,本文给出了实用和较准确的估计式。     

Products of Nevanlinna-Pick kernels and operator colligations

An example is given which clarifies the present situation of the operator norm convergence of Trotter-Kato product formula. It shows that the rate of convergence of the formula with respect to the operator norm obtained in [NZ2] is best possible. It also yields a counter-example of the operator norm convergence of the formula in another case.     

A new Newton-like iterative method for roots of analytic functions

A new Newton-like iterative formula for the solution of non-linear equations is proposed. To derive the formula, the convergence criteria of the one-parameter iteration formula, and also the quasilinearization in the derivation of Newton's formula are reviewed. The result is a new formula which eliminates the limitations of other methods. There is now no need to first ensure a good initial approximation to the root, complex roots are found without necessarily starting from a complex formulation of the iteration formula, and the convergence is faster. The rate of convergence is discussed, and examples given.     

Analyzing the convergence factor of residual inverse iteration

We will establish here a formula for the convergence factor of the method called residual inverse iteration, which is a method for nonlinear eigenvalue problems and a generalization of the well-known inverse iteration. The formula for the convergence factor is explicit and involves quantities associated with the eigenvalue to which the iteration converges, in particular the eigenvalue and eigenvector. Residual inverse iteration allows for some freedom in the choice of a vector w _k and we can use the formula for the convergence factor to analyze how it depends on the choice of w _k . We also use the formula to illustrate the convergence when the shift is close to the eigenvalue. Finally, we explain the slow convergence for double eigenvalues by showing that under generic conditions, the convergence factor is one, unless the eigenvalue is semisimple. If the eigenvalue is semisimple, it turns out that we can expect convergence similar to the simple case.     

基于等距节点积分公式的牛顿迭代法及其收敛阶

利用等距节点的数值积分公式构造牛顿迭代法的变形格式.我们证明了利用4等分5个节点的Newton-Cotes公式构造的变形牛顿迭代法收敛阶为3,并进一步证明了对于最常用的3等分4节点、5等分6节点、6等分7节点、7等分8节点积分公式,所得到的变形牛顿迭代法收敛阶都是3.最后,本文猜想,利用任意等分的积分公式构造变形牛顿迭代法,所得的迭代格式收敛阶都是3.     

大数定律MATLB随机模拟的规律性

第二作者等用一个哲学公式及0.9规格化了收敛过程,从而形象化地解释了概率论与随机计算中的若干定理,使模拟的数值规律化.基于数学软件MATLB进行了大数定律的随机模拟,直观形象地展示了1/n∑_(i=1)~nX_i到数学期望μ的收敛过程,与第二作者等的哲学公式相吻合,从而有助于学生理解和掌握大数定律.     

基于Samelson逆的向量值连分式的收敛准则

The aim of this work is to give some criteria on the convergence of vector valued continued fractions defined by Samelson inverse. We give a new approach to prove the convergence theory of continued fractions. First, by means of the modified classical backward recurrence relation, we obtain a formula between the m-th and n-th convergence of vector valued continued fractions. Second, using this formula, we give necessary and sufficient conditions for the convergence of vector valued continued fractions.     

Convergence of multi-level iterative aggregation-disaggregation methods

This paper introduces an error propagation formula of a certain class of multi-level iterative aggregation-disaggregation (IAD) methods for numerical solutions of stationary probability vectors of discrete finite Markov chains. The formula can be used to investigate convergence by computing the spectral radius of the error propagation matrix for specific Markov chains. Numerical experiments indicate that the same type of the formula could be used for a wider class of the multi-level IAD methods. Using the formula we show that for given data there is no relation between convergence of two-level and of multi-level IAD methods.     

一种Gauss型求积公式的收敛性

构造一种有理插值型求积公式(RIQFs),并证明其收敛性.该方法是Gauss求积公式在有理函数空间(Γ)2n中的推广.     

Zeno Product Formula Revisited

We introduce a new product formula which combines an orthogonal projection with a complex function of a non-negative operator. Under certain assumptions on the complex function the strong convergence of the product formula is shown. Under more restrictive assumptions even operator-norm convergence is verified. The mentioned formula can be used to describe Zeno dynamics in the situation when the usual non-decay measurement is replaced by a particular generalized observables in the sense of Davies.     

First applications of a formula for the error of finite sinc interpolation

In former articles we have given a formula for the error committed when interpolating a several times differentiable function by the sinc interpolant on a fixed finite interval. In the present work we demonstrate the relevance of the formula through several applications: correction of the interpolant through the insertion of derivatives to increase its order of convergence, improvement of the barycentric formula, rational sinc interpolants (with and without replacement of the (usually unknown) derivatives with finite differences), convergence acceleration through extrapolation and improvement of one-sided interpolants. Work partly supported by the Swiss National Science Foundation under grant Nr 200021-116122.