An approach of dynamic mesh adaptation for simulating 3‐dimensional unsteady moving‐immersed‐boundary flows

In this paper, we present an approach of dynamic mesh adaptation for simulating complex 3‐dimensional incompressible moving‐boundary flows by immersed boundary methods. Tetrahedral meshes are adapted by a hierarchical refining/coarsening algorithm. Regular refinement is accomplished by dividing 1 tetrahedron into 8 subcells, and irregular refinement is only for eliminating the hanging points. Merging the 8 subcells obtained by regular refinement, the mesh is coarsened. With hierarchical refining/coarsening, mesh adaptivity can be achieved by adjusting the mesh only 1 time for each adaptation period. The level difference between 2 neighboring cells never exceeds 1, and the geometrical quality of mesh does not degrade as the level of adaptive mesh increases. A predictor‐corrector scheme is introduced to eliminate the phase lag between adapted mesh and unsteady solution. The error caused by each solution transferring from the old mesh to the new adapted one is small because most of the nodes on the 2 meshes are coincident. An immersed boundary method named local domain‐free discretization is employed to solve the flow equations. Several numerical experiments have been conducted for 3‐dimensional incompressible moving‐boundary flows. By using the present approach, the number of mesh nodes is reduced greatly while the accuracy of solution can be preserved.     

Implementing a Two-Photon Three-Degrees-of-Freedom Hyper-Parallel Controlled Phase Flip Gate Through Cavity-Assisted Interactions

Hyper-parallel quantum information processing is a promising and beneficial research field. Herein, a method to implement a hyper-parallel controlled-phase-flip (hyper-CPF) gate for frequency-, spatial-, and time-bin-encoded qubits by coupling flying photons to trapped nitrogen vacancy (NV) defect centers is presented. The scheme, which differs from their conventional parallel counterparts, is specifically advantageous in decreasing against the dissipate noise, increasing the quantum channel capacity, and reducing the quantum resource overhead. The gate qubits with frequency, spatial, and time-bin degrees of freedom (DOF) are immune to quantum decoherence in optical fibers, whereas the polarization photons are easily disturbed by the ambient noise.     

Numerical integration of ordinary differential equations on manifolds

Summary This paper is concerned with the problem of developing numerical integration algorithms for differential equations that, when viewed as equations in some Euclidean space, naturally evolve on some embedded submanifold. It is desired to construct algorithms whose iterates also evolve on the same manifold. These algorithms can therefore be viewed as integrating ordinary differential equations on manifolds. The basic method “decouples” the computation of flows on the submanifold from the numerical integration process. It is shown that two classes of single-step and multistep algorithms can be posed and analyzed theoretically, using the concept of “freezing” the coefficients of differential operators obtained from the defining vector field. Explicit third-order algorithms are derived, with additional equations augmenting those of their classical counterparts, obtained from “obstructions” defined by nonvanishing Lie brackets.     

Aggregate error locator and error value computation in AG codes

The aggregate error locator is defined and a computation method is given. The aggregate error locator is then used in a type of Forney algorithm to compute the error values in the received words of a Ca,b algebraic geometry code.     

机翼大攻角下失速颤振的气动弹性研究

本文采用流固耦合的数值方法研究了机翼在0°～50°攻角下的颤振。计算结果表明,随着来流攻角α0的增大,机翼的固有频率对颤振的影响越来越大,颤振由线性的强迫振动逐渐发展成为非线性的自激振动,而当α0增加到一定程度以后,大尺度分离流交替地从机翼头部和尾部产生,机翼和流场会发生共振,引起机翼的失速颤振。     

1+1/2对转涡轮叶排轴向间距对性能影响的研究

木文对1+1/2对转涡轮中轴向间距影响进行了初步研究。对不同轴向间距叶栅流场进行了大量时间精确模拟。研究表明,1+1/2对转涡轮高低压转叶间轴向间距成为追求高效率的制约因素,轴向间距为高压转叶喉部宽度是关键点。因此有关小轴向间距下强激波/叶排干扰的研究应该加强。     

叶型优化在非定常流动条件下效果的数值分析

本文对叶型优化在非定常流动条件下的效果进行数值研究。叶型优化基于比较成熟的在定常流动条件下的反问题解法，非定常流动则考虑到动静叶栅之间的相互作用，非定常流动的求解在Ｎ－Ｓ方程的基础上采用分区计算的方法来完成。数值计算的结果表明，定常流动条件下优化得到的叶型在非定常流动条件下同样具有较好的气动性能。     

A time‐accurate pseudo‐compressibility approach based on an unstructured hybrid finite volume technique applied to unsteady turbulent premixed flame propagation

A preconditioning approach based on the artificial compressibility formulation is extended to solve the governing equations for unsteady turbulent reactive flows with heat release, at low Mach numbers, on an unstructured hybrid grid context. Premixed reactants are considered and a flamelet approach for combustion modelling is adopted using a continuous quenched mean reaction rate. An overlapped cell‐vertex finite volume method is adopted as a discretisation scheme. Artificial dissipation terms for hybrid grids are explicitly added to ensure a stable, discretised set of equations. A second‐order, explicit, hybrid Runge–Kutta scheme is applied for the time marching in pseudo‐time. A time derivative of the dependent variable is added to recover the time accuracy of the preconditioned set of equations. This derivative is discretised by an implicit, second‐order scheme. The resulting scheme is applied to the calculation of an infinite planar (one‐dimensional) turbulent premixed flame propagating freely in reactants whose turbulence is supposed to be frozen, homogeneous and isotropic. The accuracy of the results obtained with the proposed method proves to be excellent when compared to the data available in the literature. Copyright © 2004 John Wiley & Sons, Ltd.     

量子计算与超冷离子

通过介绍量子计算的基本概念和特点，并对比目前人们使用的计算机的计算方式，对于如何利用囚禁在离子阱中的超冷离子进行量子计算作了简要的叙述．     

On Binary Computation Structures

Based on a modification of Moss' and Parikh's topological modal language [8], we study a generalization of a weakly expressive fragment of a certain propositional modal logic of time. We define a bimodal logic comprising operators for knowledge and nexttime. These operators are interpreted in binary computation structures. We present an axiomatization of the set T of theorems valid for this class of semantical domains and prove – as the main result of this paper – its completeness. Moreover, the question of decidability of T is treated.