An exponentially fitted special second-order finite difference method for solving singular perturbation problems

An exponentially fitted special second-order finite difference method is presented for solving singularly perturbed two-point boundary value problems with the boundary layer at one end (left or right) point. A fitting factor is introduced in a tri-diagonal finite difference scheme and is obtained from the theory of singular perturbations. Thomas Algorithm is used to solve the system and its stability is investigated. To demonstrate the applicability of the method, we have solved several linear and non-linear problems. From the results, it is observed that the present method approximates the exact solution very well.     

液态铅的电阻率

采用精确的结构因数实验数据和Ｂｅｈａｖｉ模型赝势，用Ｚｉｍａｎ理论计算了液态铅的电阻率．计算结果和实验数据符合很好．讨论了Ｚｉｍａｎ理论对液态铅的适用性以及适合于液态铅的赝势的特征．     

在三通道α-螺旋蛋白质中传递生物能量的孤子的特性

用庞小峰先生提出的生物能量传递的新理论和 Runge-Kutta数值模拟方法,研究了三通道α-螺旋蛋白质中激发的孤子的动力学特性,求出在0K和300K温度下该孤子稳定地沿蛋白质链传递.由此可见,它能担任在蛋白质分子中传递生物能量的功能.从而再次证实了新理论的可利用性.     

有限水深慢船理论及波阻计算

本文推广E.Baba的无限水深慢船理论,建立了有限水深慢船理论.基于低速与量级假定,将总速度势Φ分为合模势(?)_r和波动势(?),分别给出了各自的表达式,进而推导了有限水深兴波的波高、波阻公式.编制了波阻计算程序,并以半浸圆球为例进行验算,计算了Series 60船型在8种水深时的波阻.理论分析和数值计算表明:当水深趋于无穷时,本理论与Baba理论是一致的.     

GDDP: Generalized Dual Dynamic Programming Theory

This document presents theoretical considerations about the solution of dynamic optimization problems integrating the Benders Theory, the Dynamic Programming approach and the concepts of Control Theory. The so called Generalized Dual Dynamic Programming Theory (GDDP) can be considered as an extension of two previous approaches known as Dual Dynamic Programming (DDP): The first is the work developed by Pereira and Pinto [3–5], which was revised by Velásquez and others [8,9]. The second is the work developed by Read and others [2,6,7].     

用有效势方法讨论汤川核力场中圆轨道的稳定性

以汤川核力场为例，说明用有效势方法讨论有心力场中圆形轨道的稳定性，数学处理比较简明，物理图象也比较清晰。进而指出非径向微扰引起的速度矩变化对稳定圆轨道半径ｒ＿０的影响，导出两者变化的数量关系，说明在汤川核力场中维持稳定圆运动对微扰量所加的限制。     

在相干理论的基础上分析光栅成像

本文在相干理论的基础上,推导了光栅成像中的光强分布和物像位置关系,并给出一组具有不同参数的实验照片及一组借助计算机绘制的强度分布图。     

A rigid graph for every set

A graph G is called rigid if the identical mapping V(G)→V(G) is the only homomorphism G→G. In this note we give a simple construction of a rigid oriented graph on every set. © 2002 John Wiley & Sons, Inc. J Graph Theory 39: 108–110, 2002     

On the local structure of doubly laced crystals

Let g be a Lie algebra all of whose regular subalgebras of rank 2 are type A₁×A₁, A₂, or C₂, and let B be a crystal graph corresponding to a representation of g. We explicitly describe the local structure of B, confirming a conjecture of Stembridge.