关于两总体均值差的一种半参数假设检验方法

近年来, 已有一些在半参数密度函数比模型下建立半参数统计分析方法的报道, 这些方法往往比参数方法稳健, 比非参数方法有效. 在本文里, 我们提出一种半参数的假设检验方法用于对两总体均值差进行假设检验. 该方法主要建立在对两总体均值差进行半参数估计的基础上. 我们报告了一些理论和统计模拟的结果, 得出该方法在数据符合正态性假设时, 比常用的参数和非参数方法略好; 而在数据不符合正态性假设时, 它的优势就非常明显. 我们还将提出的方法用到了两组真实数据的分析上.     

线性模型中M检验原假设分布的随机加权逼近

在线性模型中M-方法可以用于线性假设检验, 其中M检验、Wald检验和Rao的计分型检验是最常用的检验准则. 但是在计算这些检验的临界值时都涉及到未知参数的估计. 在本文中我们利用随机加权的方法来逼近这些检验的原假设分布. 结果表明在原假设和局部对立假设之下随机加权统计量的渐近分布与原检验统计量在原假设之下的渐近分布相同. 因此我们不需要对冗余参数进行估计,利用随机加权的方法就可以得到这些检验的临界值. 而且在局部对立假设之下可以实现对功效的计算. 当取不同的误差分布和不同的随机权时, 我们对本文的方法进行了蒙特卡洛模拟. 结果表明用随机加权方法来逼近原假设分布是非常精确的.     

有关一类H_+矩阵线性互补问题的修正模系矩阵分裂迭代方法

我们在本文建立了一类H+矩阵线性互补问题的修正模系矩阵分裂迭代方法并且给出了其收敛性分析.此外,我们也考虑了在给定方法下的最优参数选取问题.我们得出的修正方法是对[Xu W W, Liu H, A modified general modulus-based matrix splitting method for linear complementarity problems of H-matrices, Linear Algebra. Appl., 2014, 458:626-637]中方法2.1的一个修正.同时,我们也对[Xu W W,Modified modulus-based matrix splitting iteration methods for linear complementarity problems, Numer. Linear Algebra. Appl., 2015, 5:748-760]中方法3.1和方法3.2有关解的等价性证明作了补充说明.最后,我们给出的数值例子也表明了修正方法的有效性.     

美式期权定价中非局部问题的有限元方法

在本文中 ,我们关心的是美式期权的有限元方法 .首先 ,根据 [4 ]我们对所讨论的问题引进一个新奇的实用的方法 ,它涉及到对原问题重新形成准确的数学公式 ,使得数值解的计算可以在非常小的区域上进行 ,从而该算法计算速度快精度高 .进而 ,我们利用超逼近分析技术得到了有限元解关于 L2 -模的最优估计 .     

正态总体方差的最短区间估计与最佳双边检验

用传统方法得到的正态总体的方差的置信区间显然不是最短的 ,因而在这个意义上说也不是最佳的 .对从 3到 45的 n及α=0 .2 5 ,0 .2 0 ,0 .1 5 ,0 .1 0 ,0 .0 5 ,0 .0 1 ,0 .0 0 5 ,我们得到了附表一 ,由此可以查出相应的最短置信区间 .同样 ,在对正态总体的方差进行双边检验时 ,传统的方法给出的临界值也不是最佳的 .对如下的 n和 α我们得到了附表二 ,由此可以查出最佳的临界值 .进行计算所需的程序由我们自己编写     

鞍点问题的一种新的SOR迭代法（英文）

鞍点问题广泛出现在科学计算和工程应用的许多领域中,对这类线性系统的数值解法的研究已成为近年来的一个热点.基于鞍点问题系数矩阵的一个一般性的分裂,我们提出一种新的SOR迭代法,该方法是之前有关方法的推广和延伸.我们在一定的条件下讨论新方法的收敛性,数值实验表明该方法是有效的.     

薛定谔方程的整体几何光学近似

整体几何光学方法是一种新的求解高频线性波动方程初值问题的渐进近似理论.该理论最初是对WKB初值数据问题提出来的.在本文中,我们将采用不同的方法,对这一方法予以重新推导,使得该理论同样适用于初值为扩展WKB函数的情形.特别地,我们将建立的理论用于薛定谔方程传播子的半经典近似上来.结果表明,整体几何光学方法提供的波场近似恰好是Kay提出的半相空间公式的一个实例.作为副产品,我们指出Van Vleck近似中起到关键作用的Maslov指标可以通过一个简单的代数关系式来确定.     

老问题 新变式

<正>在解题方面,波利亚堪称"高人".他认为,我们可以选择一道有意义又不太复杂的题目,去发掘它的各个方面,在解题过程中提高我们的才智和推理能力.这些见解启示我们,通过解题活动和反思过程,总结归纳解题方法,提炼图形的本质特征,概括思想方法,达到举一反三、触类旁通的效果,其中对问题进行变式练习是发掘题目价值的重要途径之一.下面我们通过对一道平面几何问题的变式探究,体会变中不变的性质.     

非参数自回归模型异方差的小波检验

本文讨论了非参数自回归模型异方差的检验问题.在非参数自回归模型的建模过程中,通常假定方差为常数.然而在建模前,我们应该首先检验这-假定是否成立.本文将利用小波方法来检验异方差问题.我们首先利用核估计方法定义经验小波系数,然后讨论其渐近性质.在此基础上,我们提出了异方差性检验的统计量.数值模拟结果表明,我们的方法表现良好.     

质量工程试验的数据分析(上)

引言 本文介绍质量工程试验中的数据分析方法.所谓质量工程试验是为优化生产工序而进行的试验;这里,只讨论有确定目标值的.我们提出了一整套数据分析方法,它分为三个阶段:探索阶段,模型化阶段,优化阶段.在这三个阶段,我们都强调用图示法来指导分析及对结果作出解释.我们讨论了数据变换以及变换后数据的分析与田口的信噪比分析的关系.我们的介绍将按使用者易于接受的方式进行,并通过一个实例来解释. 结构数据方法 试验设计方法传统上总是致力于找出影响生产工序水平的因子.这里,我们还需要来找出影响生产工序变异性的因子.这在日本,特别是田…     

Markov decision processes for infinite horizon problems solved with the cosine simplex method

This article presents a new method of linear programming (LP) for solving Markov decision processes (MDPs) based on the simplex method (SM). SM has shown to be the most efficient method in many practical problems; unfortunately, classical SM has an exponential complexity. Therefore, new SMs have emerged for obtaining optimal solutions in the most efficient way. The cosine simplex method (CSM) is one of them. CSM is based on the Karush Kuhn Tucker conditions, and is able to efficiently solve general LP problems. This work presents a new method named the Markov Cosine Simplex Method (MCSM) for solving MDP problems, which is an extension of CSM. In this article, the efficiency of MCSM is compared to the traditional revised simplex method (RSM); experimental results show that MCSM is far more efficient than RSM.     

Application of sequential quadratic programming software program to an actual problem

We produced a nonlinear optimization software program which is based on a Sequential Quadratic Programming (SQP) method (Schittkowski, 1981a). Our program has several original characteristics: (1) automatic choice between two QP solvers, the Goldfarb—Idnani (GI) method (Goldfarb and Idnani, 1983) and the Least Squares (LS) method (Schittkowski, 1981b); (2) an augmented Lagrange function (Schittkowski, 1981a) as the objective function for line search; (3) adaptive Armijo method for line search; (4) direct definition of upper and lower bounds for variables and constraint functions; and (5) accurate numerical differentials. These characteristics ensure the reliability of our program for solving standard problems. In this paper, point (3) is described in detail. Then, the program is applied to an actual problem, the optimal placement of blocks. A model for this problem has been suggested by Sha and Dutton (1984), but it was unsuited to treatment by the SQP method. Thus we modify it to ensure program applicability.     

Convergence of a generalized MSSOR method for augmented systems

Recently, Wu et al. [S.-L. Wu, T.-Z. Huang, X.-L. Zhao, A modified SSOR iterative method for augmented systems, J. Comput. Appl. Math. 228 (1) (2009) 424-433] introduced a modified SSOR (MSSOR) method for augmented systems. In this paper, we establish a generalized MSSOR (GMSSOR) method for solving the large sparse augmented systems of linear equations, which is the extension of the MSSOR method. Furthermore, the convergence of the GMSSOR method for augmented systems is analyzed and numerical experiments are carried out, which show that the GMSSOR method with appropriate parameters has a faster convergence rate than the MSSOR method with optimal parameters.     

基于非结构自适应网格的复合有限体积法

利用文献[1]中将Lax-Wendroff格式和Lax-Friedrichs格式整体复合作用构成二维无结构网格上的复合型有限体积法,同时利用Delaunay方法,根据流场流动特性变化的梯度值为指示器对网格进行加密和粗化,实现自适应,并将此方法应用到二维浅水波方程的求解上,进行了二维部分溃坝,倾斜水跃的数值实验.结果表明,该方法是一个计算稳定、能适应复杂的求解域、能很好地捕捉激波、且计算速度快的算法.     

基于三角范数的模糊逻辑中的三Ⅰ方法

三I推理方法是一种新的模糊推理方法,通过已有的研究成果表明,在许多方面它优于传统的CRI推理方法,它将成为模糊系统和人工智能的理论和应用研究中一个比较理想的推理机制。最近,国外学者提出了一个新的模糊逻辑形式系统,叫做Monoidal t-norm based logics(简记为MTL),已经证明这个形式系统是所有基于左连续三角范数的模糊逻辑的共同形式化。本文基于这类逻辑将三I推理方法形式化,从而在这些逻辑系统中为三推理方法找到了可靠的逻辑依据。     

Dual reciprocity hybrid radial boundary node method for the analysis of Kirchhoff plates

A meshless method of dual reciprocity hybrid radial boundary node method (DHRBNM) for the analysis of arbitrary Kirchhoff plates is presented, which combines the advantageous properties of meshless method, radial point interpolation method (RPIM) and BEM. The solution in present method comprises two parts, i.e., the complementary solution and the particular solution. The complementary solution is solved by hybrid radial boundary node method (HRBNM), in which a three-field interpolation scheme is employed, and the boundary variables are approximated by RPIM, which is applied instead of moving least square (MLS) and obtains the Kronecker’s delta property where the traditional HBNM does not satisfy. The internal variables are interpolated by two groups of symmetric fundamental solutions. Based on those, a hybrid displacement variational principle for Kirchhoff plates is developed, and a meshless method of HRBNM for solving biharmonic problems is obtained, by which the complementary solution can be solved.     

FMT问题的两种三Ⅰ算法及其还原性

进一步研究FMT问题,得到该问题的三Ⅰ算法的一般计算公式,提出该问题的一种新算法三Ⅰ^*算法,给出新算法的一般计算公式,讨论两种算法的还原性问题,明确两种还原性的含义,证明FMT问题的三Ⅰ算法是W－还原的,而三Ⅰ^*算法是Z－还原的。     

A note on an SOR-like method for augmented systems

Golub et al. (2001, BIT, 41, 71–85) gave a generalizedsuccessive over-relaxation method for the augmented systems.In this paper, the connection between the SOR-like method andthe preconditioned conjugate gradient (PCG) method for the augmentedsystems is investigated. It is shown that the PCG method isat least as accurate (fast) as the SOR-like method. Numericalexamples demonstrate that the PCG method is much faster thanthe SOR-like method.     

Accelerating the convergence in the single-source and multi-source Weber problems

The modified Weiszfeld method [Y. Vardi, C.H. Zhang, A modified Weiszfeld algorithm for the Fermat-Weber location problem, Mathematical Programming 90 (2001) 559-566] is perhaps the most widely-used algorithm for the single-source Weber problem (SWP). In this paper, in order to accelerate the efficiency for solving SWP, a new numerical method, called Weiszfeld-Newton method, is developed by combining the modified Weiszfeld method with the well-known Newton method. Global convergence of the new Weiszfeld-Newton method is proved under mild assumptions. For the multi-source Weber problem (MWP), a new location-allocation heuristic, Cooper-Weiszfeld-Newton method, is presented in the spirit of Cooper algorithm [L. Cooper, Heuristic methods for location-allocation problems, SIAM Review 6 (1964) 37-53], using the new Weiszfeld-Newton method in the location phase to locate facilities and adopting the nearest center reclassification algorithm (NCRA) in the allocation phase to allocate the customers. Preliminary numerical results are reported to verify the evident effectiveness of Weiszfeld-Newton method for SWP and Cooper-Weiszfeld-Newton method for MWP.     

Numerical Method for Singularly Perturbed Third Order Ordinary Differential Equations of Convection-Diffusion Type

In this paper, we have proposed a numerical method for Singularly Perturbed Boundary Value Problems (SPBVPs) of convection-diffusion type of third order Ordinary Differential Equations (ODEs) in which the SPBVP is reduced into a weakly coupled system of two ODEs subject to suitable initial and boundary conditions. The numerical method combines boundary value technique, asymptotic expansion approximation, shooting method and finite difference scheme. In order to get a numerical solution for the derivative of the solution, the domain is divided into two regions namely inner region and outer region. The shooting method is applied to the inner region while standard finite difference scheme (FD) is applied for the outer region. Necessary error estimates are derived for the method. Computational efficiency and accuracy are verified through numerical examples. The method is easy to implement and suitable for parallel computing.