Efficient discretization of pressure‐correction equations on non‐orthogonal grids

An alternative discretization of pressure‐correction equations within pressure‐correction schemes for the solution of the incompressible Navier–Stokes equations is introduced, which improves the convergence and robustness properties of such schemes for non‐orthogonal grids. As against standard approaches, where the non‐orthogonal terms usually are just neglected, the approach allows for a simplification of the pressure‐correction equation to correspond to 5‐point or 7‐point computational molecules in two or three dimensions, respectively, but still incorporates the effects of non‐orthogonality. As a result a wide range (including rather high values) of underrelaxation factors can be used, resulting in an increased overall performance of the underlying pressure‐correction schemes. Within this context, a second issue of the paper is the investigation of the accuracy to which the pressure‐correction equation should be solved in each pressure‐correction iteration. The scheme is investigated for standard test cases and, in order to show its applicability to practical flow problems, for a more complex configuration of a micro heat exchanger. Copyright © 2003 John Wiley & Sons, Ltd.     

Lax Pairs for Equations Describing Compatible Nonlocal Poisson Brackets of Hydrodynamic Type and Integrable Reductions of the Lamé Equations

We solve the problem of describing compatible nonlocal Poisson brackets of hydrodynamic type. We prove that for nonsingular pairs of compatible nonlocal Poisson brackets of hydrodynamic type, there exist special local coordinates such that the metrics and the Weingarten operators of both brackets are diagonal. The nonlinear evolution equations describing all nonsingular pairs of compatible nonlocal Poisson brackets of hydrodynamic type are derived in these special coordinates, and the integrability of these equations is proved using the inverse scattering transform. The Lax pairs with a spectral parameter for these equations are found. We construct various classes of integrable reductions of the derived equations. These classes of reductions are of an independent differential-geometric and applied interest. In particular, if one of the compatible Poisson brackets is local, we obtain integrable reductions of the classical Lamé equations describing all orthogonal curvilinear coordinate systems in a flat space; if one of the compatible brackets is generated by a constant-curvature metric, the corresponding equations describe integrable reductions of the equations for orthogonal curvilinear coordinate systems in a space of constant curvature.     

A transport model for the evolution of urban systems

When comparing an urban system to an elasto-plastic lattice, an analogy to the solid state of matter can be exploited using the concepts of the band theory similarly. Thereafter, the population dynamics – in a region of certain stability in the state space and within appropriate energy bands – can be described in terms of Cellular Automata, with two mobile agents or pseudo particles: the inhabitant (representative of an average individual) and the recurson (representative of its multidimensional resources). As in the solid state, transition rules take the form of two coupled transport equations, comprising the terms equivalent to the generation-recombination and circulation processes. The first process can be compared to a predator–prey growth model, typical of Ecology; whereas the circulation process – composed of a drift component and a diffusion component – should be compared to the concentration-sprawl demographic balance seen in urban occupation and dynamics. Thus, it needs to be defined and determined an urban potential function, an equivalent population charge, mobility and diffusion parameters, as well as net growth factors. This analogy, discussed within the context of a case study for Great Mendoza, plausibly explains the varied growth rates of the political departments, as well as the principal urban trends for spatial occupation.     

Conjugate-gradient method for computing the Moore-Penrose inverse and rank of a matrix

A conjugate-gradient method is developed for computing the Moore-Penrose generalized inverseA of a matrix and the associated projectors, by using the least-square characteristics of both the method and the inverseA . Two dual algorithms are introduced for computing the least-square and the minimum-norm generalized inverses, as well asA . It is shown that (i) these algorithms converge for any starting approximation; (ii) if they are started from the zero matrix, they converge toA ; and (iii) the trace of a sequence of approximations multiplied byA is a monotone increasing function converging to the rank ofA. A practical way of compensating the self-correcting feature in the computation ofA is devised by using the duality of the algorithms. Comparison with Ben-Israel's method is made through numerical examples. The conjugate-gradient method has an advantage over Ben-Israel's method.After having completed the present paper, the author received from Professor M. R. Hestenes his paper entitledPseudo Inverses and Conjugate Gradients. This paper treated the same subject and appeared in Communications of the ACM, Vol. 18, pp. 40–43, 1975.     

用遗传算法构造光正交码

提出了一种利用遗传算法构造任意码长、码重、自相关限、互相关限光正交码(GA-OOC)的方法,设计了新的码字矩阵;分析了基于GA-OOC的光CDMA系统的误码率性能。仿真结果表明:该算法具有构造算法简单、易于编程实现的特点;与基于PC,EPC,QC和BIBD-OOC的光码分多址系统相比,GA-OOC的光码分多址系统具有更好的误码率性能。GA-OOC有望用于构造二维光地址码。     

Construction of Binary Quantum Error-Correcting Codes from Orthogonal Array

By using difference schemes, orthogonal partitions and a replacement method, some new methods to construct pure quantum error-correcting codes are provided from orthogonal arrays. As an application of these methods, we construct several infinite series of quantum error-correcting codes including some optimal ones. Compared with the existing binary quantum codes, more new codes can be constructed, which have a lower number of terms (i.e., the number of computational basis states) for each of their basis states.     

基于RBF神经网络的磨矿粒度软测量模型及实现

磨矿分级作业是选矿生产中的重要环节,磨矿粒度的好坏直接影响浮选的精矿品位和尾矿回收率;在实际生产中粒度的测量有在线粒度分析仪,但存在成本高、维修率高,离线实验室化验又有时间延迟大的问题;对实际磨矿分级作业过程进行了分析,提出用径向基函数(RBF)神经网络建立磨矿粒度软测量模型,采用正交最小二乘法(OLS)算法对网络进行训练学习,泛化校验;仿真结果表明,在较少训练数据下该网络非线性处理能力和逼近能力依然很强,学习时间短,模型基本符合要求;通过OPC技术将Matlab与PKS控制系统相结合,实现实时软测量磨矿粒度。     

基于动态混沌映射的三维加密正交频分复用无源光网络

提出了一种基于混沌映射的三维加密正交频分复用无源光网络保密通信系统.该系统通过相关性检测锁定收发端混沌系统参数,实现收发双方混沌系统同步;并利用同步混沌系统生成密钥,实现符号扰动以及二重子载波加密.该加密方案的密钥空间超过10~(86),能够有效对抗穷举攻击.实验实现了13.3 Gb/s基于64进制正交幅度调制的加密正交频分复用信号在25 km标准单模光纤中的传输,并完成了信息的有效解密.