A NOTE ON EXACT CONVERGENCE RATE IN THE LOCAL LIMIT THEOREM FOR A LATTICE BRANCHING RANDOM WALK

Consider a branching random walk, where the underlying branching mechanism is governed by a Galton-Watson process and the moving law of particles by a discrete random variable on the integer lattice Z. Denote by Zn（z） the number of particles in the n-th generation in the model for each z ∈ Z. We derive the exact convergence rate in the local limit theorem for Zn（z） assuming a condition like ＂EN（logN）1＋λ 〈 ∞＂ for the offspring distribution and a finite moment condition on the motion law. This complements the known results for the strongly non-lattice branching random walk on the real line and for the simple symmetric branching random walk on the integer lattice.

Local pointwise convergence of the 3D finite element

For an elliptic problem with variable coefficients in three dimensions,this article discusses local pointwise convergence of the three-dimensional(3D)finite element.First,the Green's function and the derivative Green's function are introduced.Secondly,some relationship of norms such as L^(2)-norms,W^(1,∞)-norms,and negative-norms in locally smooth subsets of the domainΩis derived.Finally,local pointwise convergence properties of the finite element approximation are obtained.

ON THE LOCALIZATION AND CONVERGENCE OF MULTIPLE FOURIER INTEGRAL BY BOCHNER-RIESZ MEANS

In this paper we consider lim _(R-) B_R^(f,x_0), in one case that f_x_0 (t) is a ABMV function on [0, ∞], and in another case that f∈L_(m-1)~1(R~) and x^k/~kf∈BV(R) when |k| = m-1 and f(x) = 0 when |x -x_0|<δ for some δ>0. Our theormes improve the results of Pan Wenjie ([1]).

Convergence Analysis of General Version of Gauss-Type Proximal Point Method for Metrically Regular Mappings

We introduce and study in the present paper the general version of Gauss-type proximal point algorithm (in short GG-PPA) for solving the inclusion , where T is a set-valued mapping which is not necessarily monotone acting from a Banach space X to a subset of a Banach space Y with locally closed graph. The convergence of the GG-PPA is present here by choosing a sequence of functions with , which is Lipschitz continuous in a neighbourhood O of the origin and when T is metrically regular. More precisely, semi-local and local convergence of GG-PPA are analyzed. Moreover, we present a numerical example to validate the convergence result of GG-PPA.

HOMOCENTRIC CONVERGENCE BALL OF THE SECANT METHOD

A local convergence theorem and five semi-local convergence theorems of the secant method are listed in this paper. For every convergence theorem, a convergence ball is respectively introduced, where the hypothesis conditions of the corresponding theorem can be satisfied. Since all of these convergence balls have the same center x^＊, they can be viewed as a homocentric ball. Convergence theorems are sorted by the different sizes of various radii of this homocentric ball, and the sorted sequence represents the degree of weakness on the conditions of convergence theorems.

Superlinear Convergence of a Smooth Approximation Method for Mathematical Programs with Nonlinear Complementarity Constraints

Mathematical programs with complementarity constraints(MPCC) is an important subclass of MPEC.It is a natural way to solve MPCC by constructing a suitable approximation of the primal problem.In this paper,we propose a new smoothing method for MPCC by using the aggregation technique.A new SQP algorithm for solving the MPCC problem is presented.At each iteration,the master direction is computed by solving a quadratic program,and the revised direction for avoiding the Maratos effect is generated by an explicit formula.As the non-degeneracy condition holds and the smoothing parameter tends to zero,the proposed SQP algorithm converges globally to an S-stationary point of the MPEC problem,its convergence rate is superlinear.Some preliminary numerical results are reported.

Modification of the Convergence of GG-PPA for Solving Generalized Equations

A modified Gauss-type Proximal Point Algorithm (modified GG-PPA) is presented in this paper for solving the generalized equations like 0 &#8712;T(x), where T is a set-valued mapping acts between two different Banach spaces X and Y. By considering some necessary assumptions, we show the existence of any sequence generated by the modified GG-PPA and prove the semi-local and local convergence results by using metrically regular mapping. In addition, we give a numerical example to justify the result of semi-local convergence.

On the Local Convergence and Dynamics of New Iterative Method with Sixth Order Convergence

In this paper,we construct a new sixth order iterative method for solving nonlinear equations.The local convergence and order of convergence of the new iterative method is demonstrated.In order to check the validity of the new iterative method,we employ several chemical engineering applications and academic test problems.Numerical results show the good numerical performance of the new iterative method.Moreover,the dynamical study of the new method also supports the theoretical results.

Exact Convergence Rate of the Local Limit Theorem for a Branching Random Walk in Z^(d)with a Random Environment in Time

Consider a branching random walk with a random environment in time in the d-dimensional integer lattice.The branching mechanism is governed by a supercritical branching process,and the particles perform a lazy random walk with an independent,non-identical increment distribution.For A■Z^(d),let Z_(n)(A)be the number of offsprings of generation n located in A.The exact convergence rate of the local limit theorem for the counting measure Z_(n)(·)is obtained.This partially extends the previous results for a simple branching random walk derived by Gao(2017,Stoch.Process Appl.).

A GLOBAL LINEAR AND LOCAL QUADRATIC SINGLE-STEP NONINTERIOR CONTINUATION METHOD FOR MONOTONE SEMIDEFINITE COMPLEMENTARITY PROBLEMS

A noninterior continuation method is proposed for semidefinite complementarity problem （SDCP）. This method improves the noninterior continuation methods recently developed for SDCP by Chen and Tseng. The main properties of our method are： （i） it is well d.efined for the monotones SDCP; （ii） it has to solve just one linear system of equations at each step; （iii） it is shown to be both globally linearly convergent and locally quadratically convergent under suitable assumptions.

AN ALGORITHM TO MINIMIZED LOCALLY LIPSCHITZIAN FUNCTION

This paper gives a method of descent for the locally Lipschitzian function. It is assumed that the generalized subgradient set of the differentiable point is a singleton point. We introduce an implementable algorithm which is globally convergent. Numerical examples show the implementation and efficiency of the algorithm .

A local energy-preserving scheme for Klein Gordon Schrdinger equations

A local energy conservation law is proposed for the Klein--Gordon-Schrrdinger equations, which is held in any local time-space region. The local property is independent of the boundary condition and more essential than the global energy conservation law. To develop a numerical method preserving the intrinsic properties as much as possible, we propose a local energy-preserving （LEP） scheme for the equations. The merit of the proposed scheme is that the local energy conservation law can hold exactly in any time-space region. With the periodic boundary conditions, the scheme also possesses the discrete change and global energy conservation laws. A nonlinear analysis shows that the LEP scheme converges to the exact solutions with order O（τ2 ＋ h2）. The theoretical properties are verified by numerical experiments.

LOCAL MEDIAN ESTIMATION OF VARIANCE FUNCTION

This paper considers local median estimation in fixed design regression problems. The proposed method is employed to estimate the median function and the variance function of a heteroscedastic regression model. Strong convergence rates of the proposed estimators are obtained. Simulation results are given to show the performance of the proposed methods.

A LOCAL DISCONTINUOUS GALERKIN METHOD FOR TIME-FRACTIONAL DIFFUSION EQUATIONS

In this paper,a local discontinuous Galerkin(LDG)scheme for the time-fractional diffusion equation is proposed and analyzed.The Caputo time-fractional derivative(of orderα,with 0<α<1)is approximated by a finite difference method with an accuracy of order3-α,and the space discretization is based on the LDG method.For the finite difference method,we summarize and supplement some previous work by others,and apply it to the analysis of the convergence and stability of the proposed scheme.The optimal error estimate is obtained in the L2norm,indicating that the scheme has temporal(3-α)th-order accuracy and spatial(k+1)th-order accuracy,where k denotes the highest degree of a piecewise polynomial in discontinuous finite element space.The numerical results are also provided to verify the accuracy and efficiency of the considered scheme.

Locally Defined Operators and Locally Lipschitz Composition Operators in the Space WBVp(·)([a, b])

We give a neccesary and sufficient condition on a function such that the composition operator (Nemytskij Operator) H defined by acts in the space and satisfies a local Lipschitz condition. And, we prove that every locally defined operator mapping the space of continuous and bounded Wiener p(&#183;)-variation with variable exponent functions into itself is a Nemytskij com-position operator.

A Local Discontinuous Galerkin Method for Two-Dimensional Time Fractional Diffusion Equations

For two-dimensional(2D)time fractional diffusion equations,we construct a numerical method based on a local discontinuous Galerkin(LDG)method in space and a finite differ-ence scheme in time.We investigate the numerical stability and convergence of the method for both rectangular and triangular meshes and show that the method is unconditionally stable.Numerical results indicate the effectiveness and accuracy of the method and con-firm the analysis.

高校图书馆特色资源阅读推广实证研究——以上海交通大学馆藏地方历史文献为例

特色资源阅读推广是图书馆业务中极具挑战性的内容,由上海交通大学馆藏地方历史文献的阅读推广实践显示:文献学解读与数字化建设相结合的方式能够实现文献内容的深度挖掘,扩大阅读推广的范围。中华传统教育文化、中医药文化、红色文化等都在阅读推广中具有实效。场馆展览、文化活动与新媒体运营的结合同样构建了阅读推广服务的新路径,为高校文化育人打开了新的空间。

战场环境下遗传黏菌算法的多机协同任务分配

针对已知战场环境下的多无人机协同任务分配问题,提出基于融合遗传黏菌算法的任务分配方法.综合单机约束、机群总体收益和损耗以及任务需求等条件,构建多机协同任务分配目标函数.针对遗传算法易陷入局部最优、黏菌算法收敛慢的问题,改进遗传迭代和黏菌探索行为.将离散黏菌算法引入遗传算法,增强融合算法的搜索能力.在种群迭代中加入干扰操作,提高求解精度.在已知环境下进行分配试验和路径演示,并与其他算法进行对比.结果表明,利用所提出的融合算法,能够获得目标函数值更高的任务分配方案.

陷阱标记联合懒蚂蚁的自适应粒子群优化算法

为解决现有粒子群改进策略无法帮助已陷入局部最优和过早收敛的粒子恢复寻优性能的问题,提出一种陷阱标记联合懒蚂蚁的自适应粒子群优化(adaptive particle swarm optimization based on trap label and lazy ant, TLLA-APSO)算法。陷阱标记策略为粒子群提供动态速度增量,使其摆脱最优解的束缚。利用懒蚂蚁寻优策略多样化粒子速度,提升种群多样性。通过惯性认知策略在速度更新中引入历史位置,增加粒子的路径多样性和提升粒子的探索性能,使粒子更有效地避免陷入新的局部最优。理论证明了引入历史位置的粒子群算法的收敛性。仿真实验结果表明,所提算法不仅能有效解决粒子群已陷入局部最优和过早收敛的问题,且与其他算法相比,具有较快的收敛速度和较高的寻优精度。

基于IWOA-BA的局部遮阴下光伏最大功率追踪

针对光伏阵列在局部遮阴下呈现多峰突变,导致传统最大功率点追踪算法(MPPT)失能的问题,提出了自适应权重及随机差分策略鲸鱼优化算法(IWOA)和蝙蝠算法(BA)的复合算法IWOA-BA.首先考量IWOA突变收敛因子及可变权重策略,使局部寻优和全局搜索能力达到动态平衡,迭代变化显著;然后,通过BA局部搜索机制进行有效变异操作,提高跳出局部最优解的能力;算法后期通过随机差分变异策略对个体位置进行二次更新,以此增加种群多样性;最后,对比传统粒子群算法(PSO)、斑马优化算法(ZOA)、鲸鱼算法(WOA),通过Simulink仿真测试结果显示,IWOA-BA在静态和动态的追踪速度和寻优精度上都具有显著优越性.