Havelock型格林函数振荡项数值积分的稳定性研究

Havelock型格林函数的传播项被积函数是高频振荡且奇异的复变函数,文献[4]引入变量代换获得了一种兼具积分效率和精度的积分方法, 本文研究了该方法的积分稳定性,发现该方法仍存在如下的积分困难: (1) θ=γ时复函数中分母为零引起的计算溢出;(2) θ=π/2是复函数在y及z方向偏导数的无穷间断点;(3) 场点与源点横坐标相同时伪奇异点变为真奇点。针对这些积分困难,采用极限公式计算θ=γ处复函数的值避免计算溢出;在保证积分精度的前提下采用截断方法略去θ=π/2邻近区域的积分消除无穷间断处的奇异;针对(3)采用分区法处理以避开原被积函数的高频振荡,并消除奇异性。伪奇异性存在的条件是场点必须在点源传播波的传播范围内,伪奇异点最多为2个。     

代数多重网格方法在紊流数值预测中的应用

机械和矿山工程中广泛使用锥形渐扩管。将DLR型k-ε紊流模型中非线性偏微分方程基于全隐式高精度迎风差分格式离散,得到差分方程的系数矩阵为五对角块十三对角带状稀疏矩阵,基于一种"三元组"方式进行压缩存储,节约内存。提出了一种基于DLR型k-ε紊流模型与代数多重网格方法结合的新算法,阐述了代数多重网格方法的实施过程。对具有逆压梯度流动的锥形渐扩管内紊流进行了数值预测。数值实验表明,代数多重网格方法对求解紊流模型离散方程组非常有效,同此前该紊流数值模拟中使用的Point-SOR方法相比,计算效率有了显著提高,计算结果与实验结果吻合较好。     

不同排布方向性椭圆孔液体润滑机械密封性能的研究

为提高液体润滑多孔端面密封的动压性能,提出了方向性多孔端面机械密封.考虑端面间润滑液膜的空化现象,基于质量守恒的JFO空化边界条件建立了理论模型,采用有限差分法求解Reynolds控制方程,获得了端面膜压分布,从而对比分析了方向性椭圆孔的排布方式对多孔端面机械密封性能的影响规律.结果表明:椭圆孔的方向性排布对端面密封的密封性能影响较大,高压侧下游泵送孔可有效提升密封端面的流体动压特性,上游泵送孔不论在高压侧还是在低压侧均可有效降低密封泄漏率;当形状因子γ为3~5,内外孔倾斜角α为35°~45°和β为125°~135°时,可获得最佳的动压性能,当形状因子γ为3~5,倾斜角α为30°~50°和β为30°~50°时,可以获得最低泄漏率.     

两点边值问题3次Lagrange形函数有限元方程的条件数和预处理

大型病态稀疏线性方程组的求解是科学计算和工程应用中的重要问题之一,采用预处理方法,通过降低条件数来减少病态是解决这一问题的关键。基于3次Lagrange形函数,用有限元方法将积分形式两点边值问题的求解转化成病态七对角方程组的求解。通过研究该方程组的特殊结构,分析了该方程的条件数,找到产生病态的因子(致病因子)。将系数矩阵的大范数部分分解成几个简单矩阵的特殊组合,基于这种特殊分解,设计出预条件子(去病因子),并对预条件子的性能进行了定量分析。结果表明,该预条件子的使用几乎不增加迭代的计算量,预处理后的条件数接近1。     

多体系统动力学方程的无违约数值计算方法

多体系统动力学方程为3阶微分代数方程,已有的约束违约稳定法存在位移违约问题,数值仿真准确性和稳定性不足。本文将求解高阶微分代数方程的降阶理论、ε嵌入处理方式与隐式龙格库塔法相结合,提出了直接满足位移约束条件的多体系统动力学方程的无违约算法,避免了约束违约问题。该方法先将多体动力学方程转化为2阶微分代数方程,并与位移约束方程联立;再应用ε嵌入隐式龙格库塔法进行数值求解。应用两种方法分别对单摆机构进行数值仿真,结果表明本文的方法不仅能适应较大步长,且准确性和稳定性均优于约束违约稳定法。     

求解一类网格结构模型的代数多重网格法

针对网格结构离散模型的特点，设计了一类适用于求解大规模二维网格结构数值计算的代数多重网格方法，详细描述了代数多重网格方法中粗化策略与插值算子的构造，并在此基础上得到了一类以该代数多重网格为预条件子的预处理方法。数值试验表明，本文建立的代数多重网格方法及相应的预处理方法是健壮的，具有较好的数值效率，非常适合于大规模网格结构材料的数值计算。近似连续模型的建立为代数多重网格方法的可靠性和计算的准确性提供了有效的理论基础。     

基于AFT-Delaunay的二维解耦并行网格生成算法

面向平面任意几何区域网格生成,提出了一种将波前法AFT(Advancing Front Technique)与Delaunay法相结合的解耦并行网格生成算法。算法主要思想是沿着求解几何区域惯性轴,采用扩展的AFT-Delaunay算法生成高质量三角形网格墙,递归地将几何区域动态划分成多个彼此解耦的子区域;采用OpenMP多线程并行技术,将子区域分配给多个CPU并行生成子区域网格;子区域内部的网格生成复用AFT-Delaunay算法,保证了生成网格的质量、效率和一致性要求。本算法优先生成几何边界与交界面网格,有利于提高有限元计算精度;各个子区域的网格生成彼此完全解耦,因此并行网格生成过程无需通信。该方法克服了并行交界面网格质量恶化难题,且具有良好的并行加速比,能够全自动、高效率地并行生成高质量的三角网格。     

耦合GPU与PCG的EFG法并行计算及应用研究

针对迭代法求解无网格Galerkin法中线性方程组收敛速度慢的问题,提出了一种耦合GPU和预处理共轭梯度法的无网格Galerkin法并行算法,在对其总体刚度矩阵、总体惩罚刚度矩阵进行并行联合组装的同时即可得到对角预处理共轭矩阵,有效地节省了GPU的存储空间和计算时间;通过采用四面体积分背景网格,提高了所提算法对三维复杂几何形状问题的适应性。通过2个三维算例验证了所提算法的可行性,且预处理共轭梯度法与共轭梯度法相比,其迭代次数最大可减少1686倍,最大的迭代时间可节省1003倍;同时探讨了加速比与线程数和节点个数之间的关系,当线程数为64时其加速比可达到最大,且预处理共轭梯度法的加速比与共轭梯度法相比可增大4.5倍,预处理共轭梯度法的加速比最大达到了88.5倍。     

钛合金与钴铬钼切向微动磨损行为研究

本文中以Ti6Al4V与CoCrMo合金为研究对象,在不同介质中开展了球/面切向微动磨损的试验研究,结合多种微观分析手段,揭示了不同条件下钛合金与钴铬钼间切向微动运行特性和损伤机理.结果表明：钛合金球与钴铬钼平面间的切向微动主要运行于部分滑移区和混合区.随着微动振幅的增加,F_t-D曲线从直线型向椭圆型转变,其中振幅较大时微动末期F_t-D曲线呈平行四边型.在部分滑移区,摩擦系数较小且保持不变,磨痕表面磨损轻微.在混合区,摩擦系数的变化因振幅的不同各存在两种情况.在振幅较小的混合区,磨斑边缘有磨屑堆积,中心以黏着为主.在振幅较大的混合区,磨痕表面以磨粒磨损为主.     

钢管混凝土纯压拱失稳临界荷载计算的等效柱法

在双重非线性有限元分析的基础上,进行了钢管混凝土纯压拱失稳临界荷载的简化计算方法——等效柱法的研究,提出了等效柱法中考虑矢跨比影响的稳定系数K₁ 以及考虑初始几何缺陷影响的折减系数K₂及其与现有规范相对应的计算公式。与有限元计算结果的对比表明,采用考虑矢跨比因素的稳定系数的等效柱法能较精确地估算钢管混凝土纯压拱的非线性失稳临界荷载,且计算精度受含钢率和钢材种类变化的影响较小。     

An ILU preconditioner with coupled node fill-in for iterative solution of the mixed finite element formulation of the 2D and 3D Navier-Stokes equations

In the present paper, preconditioning of iterative equation solvers for the Navier-Stokes equations is investigated. The Navier-Stokes equations are solved for the mixed finite element formulation. The linear equation solvers used are the orthomin and the Bi-CGSTAB algorithms. The storage structure of the equation matrix is given special attention in order to avoid swapping and thereby increase the speed of the preconditioner. The preconditioners considered are Jacobian, SSOR and incomplete LU preconditioning of the matrix associated with the velocities. A new incomplete LU preconditioning with fill-in for the pressure matrix at locations in the matrix where the corner nodes are coupled is designed. For all preconditioners, inner iterations are investigated for possible improvement of the preconditioning. Numerical experiments are executed both in two and three dimensions.     

Numbering techniques for preconditioners in iterative solvers for compressible flows

We consider Newton–Krylov methods for solving discretized compressible Euler equations. A good preconditioner in the Krylov subspace method is crucial for the efficiency of the solver. In this paper we consider a point‐block Gauss–Seidel method as preconditioner. We describe and compare renumbering strategies that aim at improving the quality of this preconditioner. A variant of reordering methods known from multigrid for convection‐dominated elliptic problems is introduced. This reordering algorithm is essentially black‐box and significantly improves the robustness and efficiency of the point‐block Gauss–Seidel preconditioner. Results of numerical experiments using the QUADFLOW solver and the PETSc library are given. Copyright © 2007 John Wiley & Sons, Ltd.     

AINV AND BILUM PRECONDITIONING TECHNIQUES

It was proposed that a robust and efficient parallelizable preconditioner for solving general sparse linear systems of equations, in which the use of sparse approximate inverse (AINV) techniques in a multi-level block ILU (BILUM) preconditioner wereinvestigated. The resulting preconditioner retains robustness of BILUM preconditioner and has two advantages over the standard BILUM preconditioner : the ability to control sparsity and increased parallelism. Numerical experiments are used to show the effectiveness and efficiency of the new preconditioner.     

An all-at-once algebraic multigrid method for finite element discretizations of Stokes problem

We consider numerical solution of finite element discretizations of the Stokes problem. We focus on the transform-then-solve approach, which amounts to first apply a specific algebraic transformation to the linear system of equations arising from the discretization, and then solve the transformed system with an algebraic multigrid method. The approach has recently been applied to finite difference discretizations of the Stokes problem with constant viscosity, and has recommended itself as a robust and competitive solution method. In this work, we examine the extension of the approach to standard finite element discretizations of the Stokes problem, including problems with variable viscosity. The extension relies, on one hand, on the use of the successive over-relaxation method as a multigrid smoother for some finite element schemes. On the other hand, we present strategies that allow us to limit the complexity increase induced by the transformation. Numerical experiments show that for stationary problems our method is competitive compared to a reference solver based on a block diagonal preconditioner and MINRES, and suggest that the transform-then-solve approach is also more robust. In particular, for problems with variable viscosity, the transform-then-solve approach demonstrates significant speed-up with respect to the block diagonal preconditioner. The method is also particularly robust for time-dependent problems whatever the time step size.     

A fast and efficient iterative scheme for viscoelastic flow simulations with the DEVSS finite element method

We present a new fast iterative solution technique for the large sparse-matrix system that is commonly encountered in the mixed finite-element formulation of transient viscoelastic flow simulation: the DEVSS (discrete elastic-viscous stress splitting) method. A block-structured preconditioner for the velocity, pressure and viscous polymer stress has been proposed, based on a block reduction of the discrete system, designed to maintain spectral equivalence with the discrete system. The algebraic multigrid method and the diagonally scaled conjugate gradient method are applied to the preconditioning sub-block systems and a Krylov subspace iterative method (MINRES) is employed as an outer solver. We report the performance of the present solver through example problems in 2D and 3D, in comparison with the corresponding Stokes problems, and demonstrate that the outer iteration, as well as each block preconditioning sub-problem, can be solved within a fixed number of iterations. The required CPU time for the entire problem scales linearly with the number of degrees of freedom, indicating O(N) performance of this solution algorithm.     

Natural Vibrations of Complex Bodies

The paper sets forth a modified preconditioned conjugate-gradient method with shifted aggregated multilevel preconditioning (MPCG_AMIS). The method is intended to solve large-scale natural-vibration problems. Such problems are typical for the finite-element analysis of buildings and other complex structures and bodies. Using a proper shift in preconditioning improves considerably the spectral properties of the preconditioner and, hence, improves convergence. Using the MPCG_AMIS allows us to avoid lock of convergence, which is the case in the conventional PCG method. The performance of the method is illustrated by examples     

Efficient preconditioning techniques for finite‐element quadratic discretization arising from linearized incompressible Navier–Stokes equations

We develop an efficient preconditioning techniques for the solution of large linearized stationary and non‐stationary incompressible Navier–Stokes equations. These equations are linearized by the Picard and Newton methods, and linear extrapolation schemes in the non‐stationary case. The time discretization procedure uses the Gear scheme and the second‐order Taylor–Hood element P₂?P₁ is used for the approximation of the velocity and the pressure. Our purpose is to develop an efficient preconditioner for saddle point systems. Our tools are the addition of stabilization (penalization) term r?(div(·)), and the use of triangular block matrix as global preconditioner. This preconditioner involves the solution of two subsystems associated, respectively, with the velocity and the pressure and have to be solved efficiently. Furthermore, we use the P₁?P₂ hierarchical preconditioner recently proposed by the authors, for the block matrix associated with the velocity and an additive approach for the Schur complement approximation. Finally, several numerical examples illustrating the good performance of the preconditioning techniques are presented. Copyright © 2009 John Wiley & Sons, Ltd.     

An improvement to the Kunz preconditioner and numerical investigation of hydrofoil interactions in tandem

ABSTRACT

Numerical simulations of the tandem-system flow are widely conducted because of the complex interactions of the configuration. The cavitation phenomenon is an important factor that affects the hydrofoil in tandem. In this paper, we developed a new parameter for the Kunz preconditioner based on the local cavitation volume fraction. To assess this parameter, a type of Fourier footprint analysis and numerical test of the hydrofoil are adopted. The preconditioning method is also conducted in hydrofoil turbulent cavitation flows with RANS turbulence models, to prove that this method has good stability and convergence. Based on this, a tandem Clark-Y hydrofoil configuration is investigated. The results show that the distance of components has a strong influence on the cavitation and lift coefficient of the tandem hydrofoils. Therefore, the purpose of this study is to provide guidance on the design of marine vehicles that have tandem configurations.     

Evaluation of the deflated preconditioned CG method to solve bubbly and porous media flow problems on GPU and CPU

In both bubbly and porous media flow, the jumps in coefficients may yield an ill‐conditioned linear system. The solution of this system using an iterative technique like the conjugate gradient (CG) is delayed because of the presence of small eigenvalues in the spectrum of the coefficient matrix. To accelerate the convergence, we use two levels of preconditioning. For the first level, we choose between out‐of‐the‐box incomplete LU decomposition, sparse approximate inverse, and truncated Neumann series‐based preconditioner. For the second level, we use deflation. Through our experiments, we show that it is possible to achieve a computationally fast solver on a graphics processing unit. The preconditioners discussed in this work exhibit fine‐grained parallelism. We show that the graphics processing unit version of the two‐level preconditioned CG can be up to two times faster than a dual quad core CPU implementation. John Wiley & Sons, Ltd.