量子阱中的束缚极化子的路径积分变分研究

利用Feynman路径积分变分方法，推导了整个电声子耦合区域的量子阱中束缚极化子的基态能。对其数值结果研究表明：当量子阱的约束势达到一定值，极化子的基态能修正－△E随电声子耦合常数α的增加激剧增大，约束势导致有效电声子耦合从无约束势时的弱耦合向居间耦合或强耦合渡越。更重要的是，我们发现存在一个量子阱的临界有效宽度lz0,当lZ小于临界值时，－△E随lz变小很快增大；当lz大于临界值时，随lz变大，－△E几乎不变。     

A DERIVATIVE-FREE ALGORITHM FOR UNCONSTRAINED OPTIMIZATION

In this paper a hybrid algorithm which combines the pattern search method and the genetic algorithm for unconstrained optimization is presented. The algorithm is a deterministic pattern search algorithm,but in the search step of pattern search algorithm,the trial points are produced by a way like the genetic algorithm. At each iterate, by reduplication,crossover and mutation, a finite set of points can be used. In theory,the algorithm is globally convergent. The most stir is the numerical results showing that it can find the global minimizer for some problems ,which other pattern search algorithms don＇t bear.     

The Global Convergence of Self-Scaling BFGS Algorithm with Nonmonotone Line Search for Unconstrained Nonconvex Optimization Problems

The self-scaling quasi-Newton method solves an unconstrained optimization problem by scaling the Hessian approximation matrix before it is updated at each iteration to avoid the possible large eigenvalues in the Hessian approximation matrices of the objective function. It has been proved in the literature that this method has the global and superlinear convergence when the objective function is convex （or even uniformly convex）. We propose to solve unconstrained nonconvex optimization problems by a self-scaling BFGS algorithm with nonmonotone linear search. Nonmonotone line search has been recognized in numerical practices as a competitive approach for solving large-scale nonlinear problems. We consider two different nonmonotone line search forms and study the global convergence of these nonmonotone self-scale BFGS algorithms. We prove that, under some weaker condition than that in the literature, both forms of the self-scaling BFGS algorithm are globally convergent for unconstrained nonconvex optimization problems.     

量子系统的整体正则对称性

基于相空间路径积分,分别导出了正规和奇异拉氏量系统在增广相空间中整体对称的Ward恒等式,从而可给出Green函数间的关系.在量子水平上建立了正则整体对称和守恒量之间的关系.一般来说,经典理论中对称性所联系的守恒量,在量子理论中不一定再保持.这里给出的形式其显著优点在于勿需作出生成泛函中对正则动量的路径积分.重新讨论了含Hopf项和Chem-Simons项的非线性σ-模型,在量子水平上对“分数自旋”性质给予了说明.     

相空间路径积分中的Feynman规则和广义Ward恒等式

基于Green函数的相空间生成泛函,导出了广义正则Ward恒等式.指出无须作出相空间生成泛函中对正则动量的路径积分,即可求得树图近似下的Feynman规则.对场的拉氏量添加一个四维散度项后,场的传播子发生了改变.     

THE MAXIMUM NUMBER OF INTERSECTIONS BETWEEN TWO PLANE RECTANGULAR PATHS

We show that the maximum number of intersections between two plane rectangular paths with lengths m and n: 2 ≤ m ≤ n, is 4n 2, if m=4 and n≡1(mod 3); and it is mn 1 otherwise.     

二次规划的精确罚函数法

二次规划的精确罚函数法刘昌文（华中理工大学数学系武汉４３００７４）关键词：搜索方向；半正定；二次规划；精确罚函数ＡＭＳ（１９９１）主场分类：９０Ｃ２０本文推广文「１」的算法得出求解半正定二次规划的一种新算法．与【１］比较，新算法的适用范围更广，且仍具...     

一种矢量量化编码的快速搜索算法

提出了一种矢量量化编码的快速匹配算法。利用码书的拓扑结构和柯西 施瓦兹不等式的性质推导出了消除不必要匹配操作的条件,并根据这个条件提出了快速搜索算法。实验结果表明,该算法不仅明显降低了矢量编码过程的复杂程度,同时也保证了与全搜索编码相同的图像编码质量。与其它搜索方法的操作次数和存储空间进行了比较。     

抛射体运动的飞行路径与抛射角的关系

在忽略空气阻力的情况下,抛射体运动的飞行路径长度与抛射初速度的平方成正比;运用Matlab可比较容易地证明,当抛射角为56.49°时,飞行路径最长.     

谐振子的传播子

本文以谐振子为例，说明路径积分的一种计算方法。