线性互补问题的并行多分裂松弛迭代算法

运用矩阵多重分裂理论,同时考虑并行计算与松弛迭代法,得到一类求解线性互补问题的高效数值算法．当问题的系数矩阵为对角元为正的H-矩阵或对称半正定矩阵时,证明了算法的全局收敛性；该算法与已有算法相比,具有计算量小、计算速度快等特点,因而特别适于求解大规模问题．数值试验的结果说明了算法的有效性．     

有限群极大子群的θ-子群偶

N.P.Mukherjee和 P.Bhattacharya在“On theta pairs for a maximal sub-group”(Proc.Amer.Math.Soc,Vl09N3(1990))一文中定义了有限群的极大子群的θ-子群偶概念,研究了极大子群的极大θ-子群偶对群结构的影响,得到了一系列结果.本文在进一步探究θ-子群偶性质的基础上,对该文中一系列主要结果作出了本质性的改进,并给出了可解性、幂零性的一些新刻划.     

多集分裂等式问题的逐次松弛投影算法

多集分裂等式问题是分裂可行性问题的拓展问题,在图像重建、语言处理、地震探测等实际问题中具有广泛的应用.为了解决这个问题,提出了逐次松弛投影算法,设计了变化的步长,使其充分利用当前迭代点的信息且不需要算子范数的计算,证明了算法的弱收敛性.数值算例验证了算法在迭代次数与运行时间等方面的优越性.     

Isospin violating mechanisms in quarkonium hadronic decays

We analyze the φ meson production in e^＋e^- →ωπ^0 as a probe for studying the isospin violation mechanisms. By clarifying the dynamic sources causing the isospin violation, we succeed in quantifying those mechanisms with the help of the recent KLOE data. Hence, the φ→ωπ^0 branching ratio is extracted. We find that apart from the electromagnetic （EM） transitions, the strong transition via intermediate kaon loops plays an important role in understanding the cross section and its lineshape.     

线性互补问题在宽邻域下的局部二次收敛算法

艾文宝(2004)的宽邻域算法弥补了内点法在理论和实践表现之间的差异.基于这个算法的优越性,将其推广到线性互补问题中.新算法在一次迭代中,采用两个方向的线性组合作为新方向,并以满步长到达下一个点.可以证明,该算法具有O(n~(1/2)L)的理论复杂度,这是迄今为止最好的复杂度结果.同时,在假设线性互补问题存在严格互补解的前提下,证明算法具有局部二次收敛性.最后,数值实验说明算法是有效的.     

GaAs光导开关锁定模式阈值条件

采用脉冲测试电路,测试了半绝缘GaAs光导开关(PCSS)在锁定工作模式下的偏置电场及触发光能阈值.测试结果表明,在一定光能范围内,电场阈值随光能阈值的增大类似于指数关系减小;激励光能在数10μJ下,半绝缘光导开关偏置电场阈值为9 kV/cm.当激励光脉冲能量大于0.78mJ时,光导开关在不同偏压下都不能工作于锁定工作...     

The transient scattering mechanism of dipole array with reflector

The transient backscattering mechanisms of a dipole array with reflector have been investigated from different aspects： time-domain, frequency-domain, and combined time-frequency domain, using 4 × 8 dipole arrays with reflector as an example. The data of scattering from the arrays under the incidence of Gaussian pulses are obtained by finite differential time domain method. The influences of the array structural parameters, incident wave parameters, and incident angles on the waveforms, spectrum, and time-frequency representations of the backscattered fields of the arrays are analysed and conclusions are drawn. From these characteristics and conclusions, it is possible to deduce the array structure inversely from the backscattered field.     

多背包问题的半定松驰算法

The multiple knapsack problem denoted by MKP (B,S,rn,n) can be defined as follows. A set B of n items and a set S of rn knapsacks are given such that each item j has a profit pi and weight wj,and each knapsack i has a capacity Ci. The goal is to find a subset of items of maximum profit such that they have a feasible packing in the knapsacks. MKP (B,S,m,n) is strongly NP-Complete and no polynomial time approximation algorithm can have an approximation ratio better than 0.5. In the last ten years,semi-definite programming has been empolyed to solve some combinatorial problems successfully. This paper firstly presents a semi-definite relaxation algorithm (MKPS) for MKP (B,S,rn,n). It is proved that MKPS have a approximation ratio better than 0. 5 for a subclass of MKP (B,S,m,n) with n≤100, m≤5 and max^nj=1{wj}/min^mi=1={Ci}≤2/3.     

态|ψ3(3)〉q中广义磁场分量的N次方Y压缩效应

构造了由多模复共轭相干态|{Z_j^*}〉_q、多模复共轭虚相干态|{iZ_j^*}〉_q和多模真空态|{Q_j} 〉_q这三态的线性叠加所组成的第Ⅲ类三态叠加多模叠加态光场|ψ₃⁽³⁾〉_q.利用多模压缩态理论研究了态|ψ₃⁽³⁾〉_q中广义磁场分量的任意偶数次广义非线性等幂次N次方Y压缩特性.结果发现:在压缩次数N取偶数,只要各模的初始相位φ_j(j=1,2,3,…,…,q),态间的初始相位差(θ_i-θ₂)(i=1,3)和各单模相干态光场平均光子数R_j²之和 分别满足各自的取值条件,态|ψ₃⁽³⁾〉_q的广义磁场分量(即第一正交相位分量)就可呈现出周期性变化的、任意偶数次的广义非线性等幂次N次方Y压缩效应.     

解线性不等式的神经网络

本文提出两个解线性不等式的Hopfiedl-Tank型的神经网络。第一个网络模拟同时松弛投影方法，第二个网络是二次规划方法。当线性不等式的解集非空时，这两个方法都给出该线性不等式的解。同时我们还给出了这两个网络的数值模拟。