基于卡尔曼滤波的信息融合算法优化研究

通过比较采用联邦卡尔曼滤波的状态向量融合和量测信息融合,得出量测信息融合优于状态向量融合,因为只有当卡尔曼滤波一致时状态向量融合才有效.采用基于最小均方差估计的观测值加权融合法融合了多传感器数据,保持了观测向量的维数.这种方法具有高效性.为了提高该算法的速度和精度,对系统的量测空间进行了等价变换,而等价系统的状态空间却没有改变.给出了等价变换前后的系统误差方差阵和状态估计均一致性的证明.把矩阵分析中的L-D分解算法运用到该算法中以避免计算矩阵的逆,从而改善了算法的稳定性和精度.举例验证了所设计算法的这些优点,给出了采用联邦卡尔曼滤波和所优化滤波算法的状态估计和误差的仿真结果,并依次进行了分析.经过这种优化,算法的精度和速度得到很大提高,已经应用到实际工程中.     

Phenomenological applications of<Emphasis Type="Italic">k</Emphasis><Subscript>T</Subscript>factorization

We discuss applications of the perturbative QCD approach in the exclusive non-leptonic two-bodyB-meson decays. We briefly review its ingredients and some important theoretical issues on the factorization approach. PQCD results are compatible with present experimental data for charmless B-meson decays. We predict the possibility of large direct CP asymmetry in B⁰ → π⁺π⁻ (23 +7%) and B⁰ →K ⁺π⁻ (− 17 ± 5%). We also investigate the branching ratios, CP asymmetry and isospin symmetry breaking in radiativeB →(K*/ρ)γ decays.     

Rook numbers and the normal ordering problem

For an element w in the Weyl algebra generated by D and U with relation DU=UD+1, the normally ordered form is w=∑c_i,jUⁱD^j. We demonstrate that the normal order coefficients c_i,j of a word w are rook numbers on a Ferrers board. We use this interpretation to give a new proof of the rook factorization theorem, which we use to provide an explicit formula for the coefficients c_i,j. We calculate the Weyl binomial coefficients: normal order coefficients of the element (D+U)ⁿ in the Weyl algebra. We extend these results to the q-analogue of the Weyl algebra. We discuss further generalizations using i-rook numbers.     

ED(i)形图簇的伴随多项式的因式分解及色性分析

令Dm表示三阶完全圈K3的一个顶点与路Pm-2的一个1度点重迭后得到的图；ψD^(i)(k,m），表示把Dm的第i个顶点（第1个顶点是1度点）与星图Sk 1的k度点重迭后得到的图；Erm r-1^D(i)表示把rDm中一个分支的第i个顶点与Sr的r-1度点重迭，同时把其余r-1个分支的第i个顶点分别与Sr的r-1个1度点都依次连一条边后得到的图。我们证明了对于1≤i≤m,r≥2，科簇Erm r-1^D(i) ∪(r-1)K1与Dm∪(r-2)ψD^(i)(1,m)∪ψD^(i)(r,m)两的补图是色等价的。     

π±介子上康普顿散射过程的重新计算

用微扰量子色动力学重新计算了π^±介子上的康普顿散射过程的截面和相位.此计算把实康普顿散射作为虚康普顿散射的一种极限情形进行了处理,重点是通过比较不同模型的分布振幅对物理可观察量的影响,说明分布振幅在端点区域的行为对康普顿散射过程截面和相位的影响,由此探索用微扰量子色动力学计算这个问题的自洽性问题.     

Factorization Representations in the Boundary Crossing Problems for Random Walks on a Markov Chain

Let τ be some stopping time for a random walk S _n defined on transitions of a finite Markov chain and let τ(t) be the first passage time across the level t which occurs after τ. We prove a theorem that establishes a connection between the dual Laplace-Stieltjes transforms of the joint distributions of (τ, S _τ) and (τ(t), S _τ(t)). This result applies to the study of the number of crossings of a strip by sample paths of a random walk.Original Russian Text Copyright © 2005 Lotov V. I. and Orlova N. G.The authors were partially supported by the Russian Foundation for Basic Research (Grant 05-01-00810) and the Grant Council of the President of the Russian Federation (Grant NSh-2139.2003.1).__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 4, pp. 833–840, July–August, 2005.     

关于“费尔马最后定理的证明”一文的评注

本文对“费尔马最后定理的证明”一文作出几点评注，主要结论是该证明仅仅是对费尔马最后定理的部分情形的证明，即并没有完全证明费尔马最后定理     

A segregated implicit solution algorithm for 2D and 3D laminar incompressible flows

A segregated algorithm for the solution of laminar incompressible, two- and three-dimensional flow problems is presented. This algorithm employs the successive solution of the momentum and continuity equations by means of a decoupled implicit solution method. The inversion of the coefficient matrix which is common for all momentum equations is carried out through an approximate factorization in upper and lower triangular matrices. The divergence-free velocity constraint is satisfied by formulating and solving a pressure correction equation. For the latter a combined application of a preconditioning technique and a Krylov subspace method is employed and proved more effecient than the approximate factorization method. The method exhibits a monotonic convergence, it is not costly in CPU time per iteration and provides accurate solutions which are independent of the underrelaxation parameter used in the momentum equations. Results are presented in two- and three-dimensional flow problems.     

Interior-Point Solver for Large-Scale Quadratic Programming Problems with Bound Constraints

In this paper, we present an interior-point algorithm for large and sparse convex quadratic programming problems with bound constraints. The algorithm is based on the potential reduction method and the use of iterative techniques to solve the linear system arising at each iteration. The global convergence properties of the potential reduction method are reassessed in order to take into account the inexact solution of the inner system. We describe the iterative solver, based on the conjugate gradient method with a limited-memory incomplete Cholesky factorization as preconditioner. Furthermore, we discuss some adaptive strategies for the fill-in and accuracy requirements that we use in solving the linear systems in order to avoid unnecessary inner iterations when the iterates are far from the solution. Finally, we present the results of numerical experiments carried out to verify the effectiveness of the proposed strategies. We consider randomly generated sparse problems without a special structure. Also, we compare the proposed algorithm with the MOSEK solver. Research partially supported by the MIUR FIRB Project RBNE01WBBB “Large-Scale Nonlinear Optimization.”     

一类非线性微分方程解的因式分解

本文讨论（１．６）的解ｗ（ｚ）的因式分解并给出ｗ（ｚ）的右因式和左因式的某些性质。