有调节的中介潜变量的循环效应模型

从解决大学生网络成瘾和抑郁相互影响关系的研究出发,构建了有调节的中介潜变量的循环效应模型.为对模型变量进行效应大小的分析和比较,推导出模型参数的标准化估计.运用我们提出的基于配方约束的潜变量回归的确定性线性算法来计算潜变量的值,避免了交互潜变量计算时观测变量的配对问题.对模型参数的OLS估计可能不具有一致性和无偏性进行了证明,并给出了解决问题的相应算法.总结出模型的算法步骤和变量的效应检验步骤.最后进行了数值模拟,验证了模型的合理性.     

关于逐步回归分析的一个注记

逐步回归是多元回归分析筛选自变量的一种重要思想方法。利用矩阵消去变换的知识,证明了逐步回归第一步引入变量,第二步引入变量,第三步不可能剔除变量。最后对经典Hald数据利用SAS统计软件,编程实现逐步回归分析.     

多种分布下选择后变量显著性分析及其在CEPS数据中的应用

在使用变量选择方法选出模型后,如何评价模型中变量系数的显著性是统计学重点关注的前沿问题之一.文章从适应性Lasso变量选择方法的选择结果出发,在考虑实践中误差分布多样性的前提下,基于选择事件构造了模型保留变量系数的条件检验统计量,并给出了该统计量的一致收敛性质的证明过程.模拟研究显示,在多种误差分布下所提方法均可进一步优化变量选择结果,有较强的实用价值.应用此方法对CEPS学生数据进行了实证分析,最终选取了学生认知能力等10个变量作为影响中学生成绩的主要因素,为相关研究提供了有益的参考.     

改进的强相关数据的变量选择方法

针对高维强相关数据的变量选择问题,本文提出了改进的变量选择方法.该方法先利用自适应弹性网方法(Aenet)在原始的强相关数据上建立模型,选出对响应变量起重要作用的群组变量和独立变量;再通过偏最小二乘方法(PLS)对选出的变量作模型估计;最后,将两种方法得到的估计系数做线性组合,并以此系数来建立回归模型.新模型具有精度高、解释性好的优点,数值实验验证了该方法的有效性.     

回归变量选择中的数据诊断

在多元线性回归中,变量选择紧密依赖模型,与影响数据密切相关。本文从模型扰动的角度,研究了变量选择与数据的关系,用微分几何中的概念,提出了用曲线的变化率、加速率及其曲率三种量测,去评价数据对变量选择的影响,从而诊断影响数据。文中给出的数值例子表明,所提影响量测,对于诊断数据对变量选择的影响是有效的。     

面板数据分位数回归模型的工具变量估计

针对含有内生变量的面板数据回归模型,提出基于工具变量的分位数回归估计方法.首先,通过引入工具变量解决协变量的内生性问题,然后利用分位数回归的方法对回归系数进行估计.在一些正则条件下,证明所提出估计的大样本性质,通过模拟研究证实该方法的有限样本性质.     

分组数据分位数回归模型的变量选择和估计北大核心CSCD

本文主要研究分组数据分位数回归模型的变量选择和估计问题.为了充分反映数据的分组信息,需要假定每组数据的回归系数可以分解成共性部分和分组后的个性部分.为了进行变量筛选,本文提出分解系数的Lasso估计,并进一步提出了自适应Lasso估计.在处理相应优化问题时,采用了变换观测矩阵的方法简化问题求解.本文给出了自适应Lasso估计的Oracle性质证明,并且通过数值模拟研究展示了所提方法的有限样本表现.最后,将此方法应用到乳腺浸润癌致病基因的变量筛选上来展示所提方法的实际应用表现.     

缺失数据下超高维可加分位回归的变量筛选和选择

针对存在缺失数据的超高维可加分位回归模型,本文提出一种有效的变量筛选方法.具体而言,将典型相关分析的思想引入到最优变换的最大相关系数,通过协变量和模型残差最优变换后的最大相关系数重要变量的边际贡献进行排序,从而进行变量筛选.然后,在筛选的基础上,利用稀疏光滑惩罚进一步做变量选择.所提变量筛选方法有三点优势:(1)基于最优变换的最大相关可以更全面的反映响应变量对协变量的非线性依赖结构;(2)在迭代过程中利用残差可以获取模型的相关信息,从而提高变量筛选的准确度;(3)变量筛选过程和模型估计分开,可以避免对冗余协变量的回归.在适当的条件下,证明了变量筛选方法的确定性独立筛选性质以及稀疏光滑惩罚下估计量的稀疏性和相合性.同时,通过蒙特卡罗模拟给出了所提方法的表现并通过一组小鼠基因数据说明了所提方法的有效性.     

分位数变系数模型基于核光滑的变量选择

分位数变系数模型是一种稳健的非参数建模方法.使用变系数模型分析数据时,一个自然的问题是如何同时选择重要变量和从重要变量中识别常数效应变量.本文基于分位数方法研究具有稳健和有效性的估计和变量选择程序.利用局部光滑和自适应组变量选择方法,并对分位数损失函数施加双惩罚,我们获得了惩罚估计.通过BIC准则合适地选择调节参数,提出的变量选择方法具有oracle理论性质,并通过模拟研究和脂肪实例数据分析来说明新方法的有用性.数值结果表明,在不需要知道关于变量和误差分布的任何信息前提下,本文提出的方法能够识别不重要变量同时能区分出常数效应变量.     

带相依终止事件的复发事件数据的可加可乘比率模型

本文对带相依终止事件的复发事件数据提出了一个联合建模分析方法,用一个带脆弱变量的可加可乘比率模型来刻画复发事件过程,还用带脆弱变量的Cox风险率模型来刻画终止事件过程,而且这两个过程的相依性由脆弱变量来刻画.我们利用估计方程的方法,对模型参数进行了估计,给出了所得估计的渐近性质.同时,通过数值模拟分析验证了估计的渐近性质.最后,利用该方法分析了弗吉尼亚大学慢性心脏病病人医疗诊费数据.     

Numerical Methods for the Maxnear Criterion of Multiple-Sets Canonical Analysis

This paper deals with numerical methods for the Maxnear criterion of multiple-sets canonical analysis. Optimality conditions are derived. Upper and lower bounds of the optimal objective function value are presented. Two iterative methods are proposed. One is an alternating variable method, and the other called Gauss-Seidel method is an inexact version of the alternating variable method. Convergence of these methods are analyzed. A starting point strategy is suggested for both methods. Numerical results are presented to demonstrate the efficiency of these methods and the starting point strategy.     

Finite volume and finite element methods for solving a one-dimensional space-fractional Boussinesq equation

In this paper, a new one-dimensional space-fractional Boussinesq equation is proposed. Two novel numerical methods with a nonlocal operator (using nodal basis functions) for the space-fractional Boussinesq equation are derived. These methods are based on the finite volume and finite element methods, respectively. Finally, some numerical results using fractional Boussinesq equation with the maximally positive skewness and the maximally negative skewness are given to demonstrate the strong potential of these approaches. The novel simulation techniques provide excellent tools for practical problems. These new numerical models can be extended to two- and three-dimensional fractional space-fractional Boussinesq equations in future research where we plan to apply these new numerical models for simulating the tidal water table fluctuations in a coastal aquifer.     

Conjugate Gradient Methods with Armijo-type Line Searches

Abstract Two Armijo-type line searches are proposed in this paper for nonlinear conjugate gradient methods.Under these line searches, global convergence results are established for several famous conjugate gradientmethods, including the Fletcher-Reeves method, the Polak-Ribiere-Polyak method, and the conjugate descentmethod.     

Finite difference approximations for the fractional Fokker–Planck equation

The fractional Fokker–Planck equation has been used in many physical transport problems which take place under the influence of an external force field. In this paper we examine some practical numerical methods to solve a class of initial-boundary value problems for the fractional Fokker–Planck equation on a finite domain. The solvability, stability, consistency, and convergence of these methods are discussed. Their stability is proved by the energy method. Two numerical examples are also presented to evaluate these finite difference methods against the exact analytical solutions.     

Reproducing kernel method for singularly perturbed turning point problems having twin boundary layers

A numerical method is proposed for solving singularly perturbed turning point problems exhibiting twin boundary layers based on the reproducing kernel method (RKM). The original problem is reduced to two boundary layers problems and a regular domain problem. The regular domain problem is solved by using the RKM. Two boundary layers problems are treated by combining the method of stretching variable and the RKM. The boundary conditions at transition points are obtained by using the continuity of the approximate solution and its first derivatives at these points. Two numerical examples are provided to illustrate the effectiveness of the present method. The results compared with other methods show that the present method can provide very accurate approximate solutions.     

SCHWARZ TYPE DOMAIN DECOMPOSITION ALGORITHMS FOR PARABOLIC EQUATIONS AND ERROR ESTIMATES

1.IntroductionTheSchwarzalternatingmethodwasintroducedbyH.A.SchWarz(1870)120yearsagoasatechniqueforprovingtheexistenceofsolutionstocertainellipticproblemsdefinedonadomainofcomplicatedgeometries.Sincethenthemethodhasbeenextendedtononlinearproblemsandhasbeenproventobeasuitabledivideandconquertechniquetosolveawideclassofproblems,forinstance,see[2,3,8--10].Inthispaperweareinterestedinsolvingtheparabolicproblemsbyusingimplicitschemes,suchasbackwardEulerschemeinthetimevariable.Ateachfixedtimeleve…     

Nonlinear force density method for the form-finding of minimal surface membrane structures

We develop an alternative approach for the form-finding of the minimal surface membranes (including cable membranes) using discrete models and nonlinear force density method. Two directed weighted graphs with 3 and 4-sided regional cycles, corresponding to triangular and quadrilateral finite element meshes are introduced as computational models for the form-finding problem. The triangular graph model is closely related to the triangular computational models available in the literature whilst the quadrilateral graph uses a novel averaging approach for the form-finding of membrane structures within the context of nonlinear force density method. The viability of the mentioned discrete models for form-finding are studied through two solution methods including a fixed-point iteration method and the Newton–Raphson method with backtracking. We suggest a hybrid version of these methods as an effective solution strategy. Examples of the formation of certain well-known minimal surfaces are presented whilst the results obtained are compared and contrasted with analytical solutions in order to verify the accuracy and viability of the suggested methods.     

Prox-Regularization Methods for Generalized Fractional Programming

If a fractional program does not have a unique solution or the feasible set is unbounded, numerical difficulties can occur. By using a prox-regularization method that generates a sequence of auxiliary problems with unique solutions, these difficulties are avoided. Two regularization methods are introduced here. They are based on Dinkelbach-type algorithms for generalized fractional programming, but use a regularized parametric auxiliary problem. Convergence results and numerical examples are presented.     

KdV方程的特征线混合间断有限元方法

考虑KdV方程的两种特征线性混合间断有限元方法,一种方法建立在标准特征线修正方法的基础上,另一种方法是带有对流项修正的特征线修正方法.利用具有实际物理意义的特征线追踪技巧处理时间导数项和对流项,采用混合间断有限元方法处理三阶导数项,分别证明了两种方法有限元解的唯一性、稳定性和误差估计.     

Two fundamental convergence theorems for nonlinear conjugate gradient methods and their applications

1. IntroductionWe consider the global convergence of conjugate gradient methods for the unconstrainednonlinear optimization problemadn f(x),where f: Re - RI is continuously dtherelltiable and its gradiellt is denoted by g. Weconsider only the cajse where the methods are implemented without regular restarts. Theiterative formula is given byXk 1 = Xk Akdk, (1'1).and the seaxch direction da is defined bywhere gb is a scalar, ^k is a stenlength, and gb denotes g(xk).The best-known formulas fo…