一种新颖的用于光腔模式及光束传输模拟的特征向量法

根据有限元法单元划分的思想，提出了一种新颖的模拟光腔模式及光束传输的特征向量法. 该方法的关键之处在于基于衍射积分理论构造了一种新的光束传输矩阵，通过求解特征矩阵方程可一次性得到谐振腔的一系列特征向量，每一列特征向量即代表了腔镜上光场的一个确定模式的振幅及相位分布. 并可采用该方法模拟光场传输到腔内或腔外任意地方的场分布. 该方法将传统方法中大量的迭代过程转化成为本征积分方程特征向量的求解过程，并与初值取值无关，且可一次性求得多个模式分布，从而可方便地分析谐振腔的模式鉴别能力. 特征向量法对圆形镜共焦 关键词： 谐振腔 特征向量法 模式分布     

半自由声场的全息重建和预测实验研究

半自由声场环境下的声源重建和声场预测研究对声全息技术走向实际应用具有非常重要的意义.在提出基于分布源边界点法的半自由声场全息重建和预测方法的基础上，对此展开了实验研究.并将重建和预测的结果与常规方法重建和预测的结果进行了比较和讨论，说明了重建预测过程中反射声压的影响和考虑反射声压的必要性，证明了所提出方法在解决半自由声场环境下存在地面反射时的声源重建和声场预测时的有效性和准确性.还提出了采用奇异值截断滤波和Tikhonov正则化方法来削弱测量误差的影响，从而进一步优化了重建结果，提高了全息成像的可信度. 关键词： 声全息 半自由场 边界点 声辐射 反射声     

光纤光栅选频掺Yb3+双包层光纤激光器

利用相位掩模法 ,在D形内包层掺Yb3 双包层光纤一端直接写制出Bragg光栅 ,用作双包层光纤激光器的输出腔镜 .试验得到了线宽为 0 196nm ,波长为 10 5 8 2nm ,最高输出功率为 5 70mW的稳定激光输出 ,解决了激光器中模式竞争造成的输出不稳定现象 .从速率方程出发 ,对激光器的输出功率与抽运功率、光栅反射率的关系以及最佳光纤长度进行了理论分析 ,结果与实验符合很好     

X波段六腔渡越管振荡器的高频特性研究

 从麦克斯韦方程出发，采用时域有限差分法（FDTD）和离散傅里叶变换（DFFT）相结合的方法，通过数值计算得出了六腔开放式谐振腔中前四个谐振频率和场分布，计算出的谐振频率与实验测量结果基本相同。比较了开放腔和封闭腔谐振频率，验证了TEM波吸收边界条件，并在实际编程计算中得以应用。计算结果为六腔渡越管振荡器的机理研究提供了依据。     

BEPCⅡ LINAC束流光学匹配及轨道校正计算研究

 北京正负电子对撞机直线注入器(BEPCⅡ LINAC)的升级改进要求建立束流光学匹配计算和轨道校正系统，为此对束流光学匹配计算和轨道校正计算的方法进行了研究，并采用VC++语言编写了相应的程序，利用最小二乘法原理进行了束流光学匹配计算，模拟了束流轨道校正，取得了较为理想的结果。     

The Isoelectric Point and the Points of Zero Charge of Fe-Al-Mg Hydrotalcite-like Compounds

The relation of the isoelectric point (IEP) and the point of zero net charge (PZNC) of the hydrotalcite-like compounds was discussed. It was found that the IEP does not equal to the PZNC and the IEP is higher than the PZNC. The structural positive charges existing in the HTlc,which cause the difference between the IEP and the PZNC. The effects of the structural positive charges of the HTlc on its IEP and PZNC are the same as the specific adsorption of metal cations.     

Augmented Lagrangian Algorithms Based on the Spectral Projected Gradient Method for Solving Nonlinear Programming Problems

The spectral projected gradient method SPG is an algorithm for large-scale bound-constrained optimization introduced recently by Birgin, Martínez, and Raydan. It is based on the Raydan unconstrained generalization of the Barzilai-Borwein method for quadratics. The SPG algorithm turned out to be surprisingly effective for solving many large-scale minimization problems with box constraints. Therefore, it is natural to test its perfomance for solving the sub-problems that appear in nonlinear programming methods based on augmented Lagrangians. In this work, augmented Lagrangian methods which use SPG as the underlying convex-constraint solver are introduced (ALSPG) and the methods are tested in two sets of problems. First, a meaningful subset of large-scale nonlinearly constrained problems of the CUTE collection is solved and compared with the perfomance of LANCELOT. Second, a family of location problems in the minimax formulation is solved against the package FFSQP.     

On the identification of degenerate indices in the nonlinear complementarity problem with the proximal point algorithm

In this paper we focus on the problem of identifying the index sets P(x):=i|x_i>0, N(x):={i|F_i(x)>0 and C(x):=i|x_i=F_i(x)=0} for a solution x of the monotone nonlinear complementarity problem NCP(F). The correct identification of these sets is important from both theoretical and practical points of view. Such an identification enables us to remove complementarity conditions from the NCP and locally reduce the NCP to a system which can be dealt with more easily. We present a new technique that utilizes a sequence generated by the proximal point algorithm (PPA). Using the superlinear convergence property of PPA, we show that the proposed technique can identify the correct index sets without assuming the nondegeneracy and the local uniqueness of the solution.This work was supported in part by a Grant-in-Aid for Scientific Research from the Ministry of Education, Science, Sports and Culture of Japan.Mathematics Subject Classification (2000): 90C33, 65K10     

Strongly polynomial-time approximation for a class of bicriteria problems

Consider the following problem: given a ground set and two minimization objectives of the same type find a subset from a given subset-class that minimizes the first objective subject to a budget constraint on the second objective. Using Megiddo's parametric method we improve an earlier weakly polynomial time algorithm.     

晶体微观结构的数值计算

晶体微观结构是晶体材料在特定物理条件下其多个能量极小平衔态在空间形成的某种微尺度的规则分布．几何非线性的连续介质力学理论可以用能量极小化原理来解释晶体微观结构的形成，并用Young测度来刻画平衡态各变体在空间的概率分布．定性的理解与定量地分析和计算晶体材料的微观结构对于发展和改进高级晶体功能材料，如形状记忆合金、铁电体、磁至伸缩材料等，有重要的意义．本文回顾了近年来晶体微观结构数值计算方面的最新进展．介绍了计算晶体微观结构的几种数值方法及有关的数值分析结果。