管系内一维可压缩流动数值建模与特性分析

针对复杂管系内可压缩流体,基于有限体积法,采用HLLC(Harten-Lax-vanLeerContact)格式和黎曼求解器构建了有限控制体数值离散方法,引入虚拟节点用于连接有限控制体,借助虚拟节点给出控制体之间数值通量的计算格式,发展了一种管道内一维流动数值建模方法。针对含有分支管路的管系,在管道连接部位构建了分支管路拟一维流动数值计算模型。基于所发展的一维流动数值方法,建立了变径管道和含60°分支管道内流动计算模型,验证了该方法的收敛性和有效性;基于虚拟节点的数值格式处理变径管激波问题具有一定精度优势。研究了变径管和分支管模型中可压缩流体激波、稀疏波等的传播机理,分析了管径对相邻支管压力的影响,为工程管路设计提供了参考。     

Efficient solution strategy for the semi-implicit discontinuous Galerkin discretization of the Navier-Stokes equations

We deal with the numerical solution of the system of the compressible Navier–Stokes equations with the aid of the interior penalty Galerkin method. We employ a semi-implicit time discretization which leads to the solution of a sequence of linear algebraic systems. We develop an efficient strategy for the solution of these systems. It is based on a simple adaptive technique for the choice of the time step and a relatively weak stopping criterion for iterative linear algebraic solvers. The presented numerical experiments show that the proposed strategy is efficient for steady-state problems using various grids, polynomial degrees of approximations and flow regimes. Finally, we apply this strategy with a minor modification to an unsteady flow.     

Fourth‐order finite difference scheme for the incompressible Navier–Stokes equations in a disk

We develop an efficient fourth‐order finite difference method for solving the incompressible Navier–Stokes equations in the vorticity‐stream function formulation on a disk. We use the fourth‐order Runge–Kutta method for the time integration and treat both the convection and diffusion terms explicitly. Using a uniform grid with shifting a half mesh away from the origin, we avoid placing the grid point directly at the origin; thus, no pole approximation is needed. Besides, on such grid, a fourth‐order fast direct method is used to solve the Poisson equation of the stream function. By Fourier filtering the vorticity in the azimuthal direction at each time stage, we are able to increase the time step to a reasonable size. The numerical results of the accuracy test and the simulation of a vortex dipole colliding with circular wall are presented. Copyright © 2003 John Wiley & Sons, Ltd.     

Algorithmic Issues for Electromagnetic Scattering in Layered Media: Green's Functions, Current Basis, and Fast Solver

In this paper, we will address three computational issues for electromagnetic scattering in layered media: fast algorithm of calculating dyadic Green's functions, high order RWG current basis and fast solver for layered media. Numerical results will be included.     

全附体ONRT船模在波浪中自航的数值模拟

采用基于重叠网格技术的CFD方法数值研究了全附体ONRT船模在迎浪工况中自航的水动力特性.文中数值计算采用自主开发的面向船舶与海洋工程的CFD求解器naoe-FOAM-SJTU.自航计算中船体运动及螺旋桨转动等通过重叠网格技术完成,波浪环境则采用求解器中的三维数值造波和消波模块实现.计算中自航船模的螺旋桨转速通过静水自航数值计算得出,波浪工况计算采用东京2015 CFD会议中标准算例进行设置.数值计算结果,如船体运动、实时航速变化等,与试验数据进行了对比分析.此外,给出了数值预报的推力和扭矩系数,并且通过详细的流场信息来分析和解释了船模在波浪中自航过程中的水动力变化情况.数值预报结果同试验值吻合较好,说明采用当前结合重叠网格技术和CFD的数值方法可以很好地预报波浪中自航问题.     

A residual based sparse approximate inverse preconditioning procedure for large sparse linear systems

We propose a residual based sparse approximate inverse (RSAI) preconditioning procedure, for the large sparse linear system A x =b . Different from the SParse Approximate Inverse (SPAI) algorithm proposed by Grote and Huckle (SIAM Journal on Scientific Computing, 18 (1997), pp. 838–853.), RSAI uses only the dominant other than all the information on the current residual and augments sparsity patterns adaptively during loops. In order to control the sparsity of M , we develop two practical algorithms RSAI(f i x ) and RSAI(t o l ). RSAI(f i x ) retains the prescribed number of large nonzero entries and adjusts their positions in each column of M among all available ones, in which the number of large entries is increased by a fixed number at each loop. In contrast, the existing indices of M by SPAI are untouched in subsequent loops and a few most profitable indices are added to each column of M from the new candidates in the next loop. RSAI(t o l ) is a tolerance based dropping algorithm and retains all large entries by dynamically dropping small ones below some tolerances, and it better suits for the problem where the numbers of large entries in the columns of A ^?1 differ greatly. When the two preconditioners M have almost the same or comparable numbers of nonzero entries, the numerical experiments on real‐world problems demonstrate that RSAI(f i x ) is highly competitive with SPAI and can outperform the latter for some problems. We also make comparisons of RSAI(f i x ), RSAI(t o l ), and power sparse approximate inverse(t o l ) proposed Jia and Zhu (Numerical Linear Algebra with Applications, 16 (2009), pp.259–299.) and incomplete LU factorization type methods and draw some general conclusions.     

Operator-splitting methods via the Zassenhaus product formula

In this paper, we contribute an operator-splitting method improved by the Zassenhaus product. Zassenhaus products are of fundamental importance for the theory of Lie groups and Lie algebras. While their applications in physics and physical chemistry are important, novel applications in CFD (computational fluid dynamics) arose based on the fact that their sparse matrices can be seen as generators of an underlying Lie algebra. We apply this to classical splitting and the novel Zassenhaus product formula. The underlying analysis for obtaining higher order operator-splitting methods based on the Zassenhaus product is presented. The benefits of dealing with sparse matrices, given by spatial discretization of the underlying partial differential equations, are due to the fact that the higher order commutators are very quickly computable (their matrix structures thin out and become nilpotent). When applying these methods to convection-diffusion-reaction equations, the benefits of balancing time and spatial scales can be used to accelerate these methods and take into account these sparse matrix structures.The verification of the improved splitting methods is done with numerical examples. Finally, we conclude with higher order operator-splitting methods.     

Performance comparison of the NWF and DC methods for implementing High-Resolution schemes in a fully coupled incompressible flow solver

This paper reports on the use of the Normalized Weighting Factor (NWF) method and the Deferred Correction (DC) approach for the implementation of High Resolution (HR) convective schemes in an implicit, fully coupled, pressure-based flow solver. Four HR schemes are realized within the framework of the NWF and DC methods and employed to solve the following three laminar flow problems: (i) lid-driven flow in a square cavity, (ii) sudden expansion in a square cavity, and (iii) flow in a planar T-junction, over three grid systems with sizes of 10⁴, 5 × 10⁴, and 3 × 10⁵ control volumes. The merit of both approaches is demonstrated by comparing the computational costs required to solve these problems using the various HR schemes on the different grid systems. Whereas previous attempts to use the NWF method in a segregated flow solver failed to produce converged solutions, current results clearly demonstrate that both methods are suitable for utilization in a coupled flow solver. In terms of CPU efficiency, there is no global and consistent superiority of any method over another even though the DC method outperformed the NWF method in two of the three test problems solved.     

Solving cubics by polynomial fitting

A top-performance algorithm for solving cubic equations is introduced. This algorithm uses polynomial fitting for a decomposition of the given cubic into a product of a quadratic and a linear factor. This factorization can be computed extremely accurately and efficiently using a fixed-point iteration of the linearized fitting error. The polynomial fitting concept performs orders of magnitude better in terms of numerical accuracy and precision than any of the currently known and available algorithms for solving cubic equations. A special exception handler is presented for a reliable operation in the event of double, triple and tightly clustered roots.     

Weakly Nonlinear Geometric Optics for Hyperbolic Systems of Conservation Laws

We present a new approach to analyze the validation of weakly nonlinear geometric optics for entropy solutions of nonlinear hyperbolic systems of conservation laws whose eigenvalues are allowed to have constant multiplicity and corresponding characteristic fields to be linearly degenerate. The approach is based on our careful construction of more accurate auxiliary approximation to weakly nonlinear geometric optics, the properties of wave front-tracking approximate solutions, the behavior of solutions to the approximate asymptotic equations, and the standard semigroup estimates. To illustrate this approach more clearly, we focus first on the Cauchy problem for the hyperbolic systems with compact support initial data of small bounded variation and establish that the L ¹-estimate between the entropy solution and the geometric optics expansion function is bounded by O(?²), independent of the time variable. This implies that the simpler geometric optics expansion functions can be employed to study the behavior of general entropy solutions to hyperbolic systems of conservation laws. Finally, we extend the results to the case with non-compact support initial data of bounded variation.