A technique for speeding up the solution of the Lagrangean dual

We propose techniques for the solution of the LP relaxation and the Lagrangean dual in combinatorial optimization and nonlinear programming problems. Our techniques find the optimal solution value and the optimal dual multipliers of the LP relaxation and the Lagrangean dual in polynomial time using as a subroutine either the Ellipsoid algorithm or the recent algorithm of Vaidya. Moreover, in problems of a certain structure our techniques find not only the optimal solution value, but the solution as well. Our techniques lead to significant improvements in the theoretical running time compared with previously known methods (interior point methods, Ellipsoid algorithm, Vaidya's algorithm). We use our method to the solution of the LP relaxation and the Langrangean dual of several classical combinatorial problems, like the traveling salesman problem, the vehicle routing problem, the Steiner tree problem, thek-connected problem, multicommodity flows, network design problems, network flow problems with side constraints, facility location problems,K-polymatroid intersection, multiple item capacitated lot sizing problem, and stochastic programming. In all these problems our techniques significantly improve the theoretical running time and yield the fastest way to solve them.     

算子点态遍历定理

本文证明了关于Ｌ^P（１≤Ｐ≤∞）空间中线性算子与非线性算子的几个点态遍历定理，还推广了Ｙｏｓｉｄａ与ＫａＫｕｔａｎｉ关于拟紧算子的一致遍历定理。     

On the use of two QMR algorithms for solving singular systems and applications in Markov chain modeling

Recently, Freund and Nachtigal proposed the quasi-minimal residual algorithm (QMR) for solving general nonsingular non-Hermitian linear systems. The method is based on the Lanczos process, and thus it involves matrix—vector products with both the coefficient matrix of the linear system and its transpose. Freund developed a variant of QMR, the transpose-free QMR algorithm (TFQMR), that only requires products with the coefficient matrix. In this paper, the use of QMR and TFQMR for solving singular systems is explored. First, a convergence result for the general class of Krylov-subspace methods applied to singular systems is presented. Then, it is shown that QMR and TFQMR both converge for consistent singular linear systems with coefficient matrices of index 1. Singular systems of this type arise in Markov chain modeling. For this particular application, numerical experiments are reported.     

线性函数的性质及其应用 线性函数的性质及其应用

给出了线性函数、部分线性函数和线性变量的定义,提出了它们的性质.根据上述定义,利用布尔代数中的基本定理和公式以及自双反函数和对称函数的定义对这些性质给出了证明.最后讨论了它们在逻辑综合以及计算逻辑函数的布尔差分中的应用.     

检测线性函数与线性变量的表格方法

讨论了线性函数、部分线性函数和线性变量的定义、性质和定理,提出了检测基于最小项展开的逻辑函数的线性变量与线性函数的表格方法.提出了直接从RM型逻辑函数的Reed-Muller展开出发以及直接从OC型OC展开出发检测RM型逻辑函数和OC型逻辑函数的线性变量及线性函数的表格方法.文中提出的表格方法具有简单、方便和易于计算机编程操作等优点.     

基于简单MOPA结构实现3.08 kW全光纤窄线宽线偏振激光输出

基于简单的主振荡功率放大结构,演示了一种高功率窄线宽线性偏振全光纤激光器,其最大输出功率为3.08 kW,3 dB线宽为0.2 nm。在整个功率缩放过程中,偏振消光比约为94%,光束质量M ²约为1.4。这是国内外首次实现3 kW全保偏光纤激光输出,与基于相位调制的窄线宽激光器相比,该激光器可实现近似的线宽,同时具有受激布里渊散射阈值高、系统结构简单、成本低等特点。     

FLTD三电极场畸变气体开关寿命特性

针对设计的一种场畸变气体开关,研究中间电极材料分别为不锈钢和黄铜条件下的烧蚀特性,结合开关寿命期间静态与触发特性的变化规律,获得决定开关寿命的关键因素,为三电极场畸变气体开关的性能优化提供理论支撑。研究结果表明,采用不锈钢和黄铜作为中间电极的烧蚀区域以及表面粗糙度均随着放电次数增加而增大,黄铜电极烧蚀较为严重且表面有明显的烧蚀圆斑,不锈钢电极则具有更高的表面粗糙度,阴阳极表面烧蚀存在明显差异,随着放电次数的增加,击穿点向电极边缘区域集中,影响开关的沿面绝缘特性,是导致开关寿命终结的主要原因。     

共轭线性对称性及其对PT-对称量子理论的应用

传统量子系统的哈密顿是自伴算子,哈密顿的自伴性不仅保证系统遵循酉演化和保持概率守恒,而且也保证了它自身具有实的能量本征值,这类系统称为自伴量子系统.然而,确实存在一些物理系统(如PT-对称量子系统),其哈密顿不是自伴的,这类系统称为非自伴量子系统.为了深入研究PT-对称量子系统,并考虑到算子PT的共轭线性性,首先讨论了共轭线性算子的一些性质,包括它们的矩阵表示和谱结构等;其次,分别研究了具有共轭线性对称性和完整共轭线性对称性的线性算子,通过它们的矩阵表示,给出了共轭线性对称性和完整共轭线性对称性的等价刻画;作为应用,得到了关于PT-对称及完整PT-对称算子的一些有趣性质,并通过一些具体例子,说明了完整PT-对称性对张量积运算不具有封闭性,同时说明了完整PT-对称性既不是哈密顿算子在某个正定内积下自伴的充分条件,也不是必要条件.     

基于四波混频过程和线性分束器产生四组份纠缠

多组份纠缠是量子信息处理的重要资源,它的产生通常涉及到许多复杂的线性和非线性过程.本文从理论上提出了一种利用两个独立的四波混频过程和线性分束器产生真正的四组份纠缠的方案,其中,线性分束器的作用是将两个独立的四波混频过程联系起来.首先应用部分转置正定判据研究了强度增益对四组份纠缠的影响,结果表明,在整个增益区域内都存在真正的四组份纠缠,并且随着强度增益的增加,纠缠也在增强.然后研究了线性分束器的透射率对四组份纠缠的影响,发现只要线性分束器的透射率不为0或1,该系统也可以产生真正的四组份纠缠.最后,通过研究该系统可能存在的三组份纠缠和两组份纠缠来揭示该系统的纠缠结构.本文理论结果为实验上利用原子系综四波混频过程产生真正的四组份纠缠提供了可靠的方案.     

A complete class for linear estimation in a general linear model

Summary It is shown that in linear estimation both unbiased and biased, all unique (up to equivalence with respect to risk) locally best estimators and their limits constitute a complete class.