Closure, stability and iterated line graphs with a 2-factor

We consider 2-factors with a bounded number of components in the n-times iterated line graph Lⁿ(G). We first give a characterization of graph G such that Lⁿ(G) has a 2-factor containing at most k components, based on the existence of a certain type of subgraph in G. This generalizes the main result of [L. Xiong, Z. Liu, Hamiltonian iterated line graphs, Discrete Math. 256 (2002) 407-422]. We use this result to show that the minimum number of components of 2-factors in the iterated line graphs Lⁿ(G) is stable under the closure operation on a claw-free graph G. This extends results in [Z. Ryjá?ek, On a closure concept in claw-free graphs, J. Combin. Theory Ser. B 70 (1997) 217-224; Z. Ryjá?ek, A. Saito, R.H. Schelp, Closure, 2-factors and cycle coverings in claw-free graphs, J. Graph Theory 32 (1999) 109-117; L. Xiong, Z. Ryjá?ek, H.J. Broersma, On stability of the hamiltonian index under contractions and closures, J. Graph Theory 49 (2005) 104-115].     

Goldstein线搜索下Levenberg-Marquardt方法的全局收敛性

给出在Goldstein线搜索条件下求解非线性方程的Levenberg-Marquardt方法, 在较为温和的条件下证明了该方法的全局收敛性, 并且利用该方法对广义互补问题进行了求解分析.     

Linear law for the logarithms of the Riemann periods at simple critical zeta zeros

Each simple zero of the Riemann zeta function on the critical line with is a center for the flow of the Riemann xi function with an associated period . It is shown that, as ,

Numerical evaluation leads to the conjecture that this inequality can be replaced by an equality. Assuming the Riemann Hypothesis and a zeta zero separation conjecture for some exponent , we obtain the upper bound . Assuming a weakened form of a conjecture of Gonek, giving a bound for the reciprocal of the derivative of zeta at each zero, we obtain the expected upper bound for the periods so, conditionally, . Indeed, this linear relationship is equivalent to the given weakened conjecture, which implies the zero separation conjecture, provided the exponent is sufficiently large. The frequencies corresponding to the periods relate to natural eigenvalues for the Hilbert-Polya conjecture. They may provide a goal for those seeking a self-adjoint operator related to the Riemann hypothesis.

     

带有无限到达源的Re-entrant Line的稳定性

用Foster判别准则,Weiss[13]给出了带有无限到达源的两站三步re-entrant line的稳定性的充分条件．本文用两种不同的方法得到了其稳定性的充分必要条件,即: 二维随机游动方法和Foster判别准则．同时,我们又用流体模型方法得到了系统稳定的充分条件,大大地简化了Weiss[13]的证明．     

有界变量线性规划的基线算法

本文对有界变量线性规划的算法进行了研究，得到了一种解此问题的新算法。文中根据基线算法的算法原理，通过对BL表的旋转，在各变量满足界约束的条件下，使目标函数值不断增大，直至得到有界硬上界，从而得到问题的最优解。文中给出了有界变量线性规划基线算法的计算步骤，并给出了一个例子。与单纯形法相比，采用基线算法解有界变量线性规划操作更简单。迭代次数少，解题速度更快。     

带干扰的多险种风险模型

由于保险公司风险经营规模不断扩大,用单一险种的模型来描述风险过程存在局限性,本文讨论了带干扰多险种风险模型,应用鞅论方法,得出伦德伯格不等式和最终破产概率公式。     

3D HYBRID DEPTH MIGRATION AND FOUR-WAY SPLITTING SCHEMES

The alternately directional implicit （ADI） scheme is usually used in 3D depth migration. It splits the 3D square-root operator along crossline and inline directions alternately. In this paper, based on the ideal of data line, the four-way splitting schemes and their splitting errors for the finite-difference （FD） method and the hybrid method are investigated. The wavefield extrapolation of four-way splitting scheme is accomplished on a data line and is stable unconditionally. Numerical analysis of splitting errors show that the two-way FD migration have visible numerical anisotropic errors, and that four-way FD migration has much less splitting errors than two-way FD migration has. For the hybrid method, the differences of numerical anisotropic errors between two-way scheme and four-way scheme are small in the case of lower lateral velocity variations. The schemes presented in this paper can be used in 3D post-stack or prestack depth migration. Two numerical calculations of 3D depth migration are completed. One is the four-way FD and hybrid 3D post-stack depth migration for an impulse response, which shows that the anisotropic errors can be eliminated effectively in the cases of constant and variable velocity variations. The other is the 3D shot-profile prestack depth migration for SEG/EAEG benchmark model with two-way hybrid splitting scheme, which presents good imaging results. The Message Passing Interface （MPI） programme based on shot number is adopted.     

二维变系数对流扩散问题的特征配置法

1引言 在多种问题的数值模拟中均涉及抛物型对流扩散方程的数值求解问题.由于配置法 无需计算数值积分，计算简便，收敛阶高等优点，使之在工程技术和计算数学的许多领域 得到广泛的应用，但范围一般局限在一维常系数{1，21和二维常系数问题降，4]，90年代[s] 提出了二维变系数     

一个解大规模无约束优化问题的全局梯度法(英文)

本文提出一种新的解大规模无约束优化问题的全局收敛的梯度法.新算法沿着负梯度方向选择步长,而初始步长根据目标函数的海赛矩阵的近似数量矩阵来确定.理论上证明了新算法产生的点列的每个聚点都是稳定的,数值试验表明新算法是可靠且有效的.     

矩阵的一种特殊运算及其应用

针对元素为非负实数的矩阵,引入矩阵的一种双目运算——换乘运算,讨论了这种运算的一些主要性质.举例说明这种运算在城市公交路线查询中的应用,和其他查询算法相比,这种方法具有一次运算,永久利用结果的优点.