Optimization of the nonlinear convergence rate of the SIMPLER Picard algorithm for steady incompressible internal flows through enforcement of continuity projections

We discuss the performance optimization of the Semi‐Implicit Method for Pressure‐Linked Equations—Revised (SIMPLER) Picard algorithm for steady incompressible internal flows. We discuss the nonlinear convergence of the Picard iteration as a function of the pressure and scalar potential continuity projections stemming from the SIMPLER algorithm, for three example problems. In particular, we discuss the choice of under‐relaxation method, and choice of under‐relaxation factors; the choice of the projection algorithm; and the required tolerance for the linear solve of the generalized Poisson equations for the pressure and scalar potential equations that arise from the projection operations. We conclude that the convergence of the nonlinear Picard iteration can be effectively controlled by the optimal enforcement of the continuity projections. Copyright © 2005 John Wiley & Sons, Ltd.     

SOLUTION ALGORITHM FOR LOW-PECLET-NUMBER REACTING FLOW

An enhanced solution strategy based on the SIMPLER algorithm is presented for low-Peclet-number mass transport calculations with applications in low-pressure material processing. The accurate solution of highly diffusive flows requires boundary conditions that preserve specified chemical species mass fluxes. The implementation of such boundary conditions in the standard SIMPLER solution procedure leads to degraded convergence that scales with the Peclet number. Modifications to both the non-linear and linear parts of the solution algorithm remove the slow convergence problem. In particular, the linearized species transport equations must be implicitly coupled to the boundary condition equations and the combined system must be solved exactly at each non-linear iteration. The pressure correction boundary conditions are reformulated to ensure that continuity is preserved in each finite volume at each iteration. The boundary condition scaling problem is demonstrated with a simple linear model problem. The enhanced solution strategy is implemented in a baseline computer code that is used to solve the multicomponent Navier–Stokes equations on a generalized, multiple-block grid system. Accelerated convergence rates are demonstrated for several material-processing example problems. © 1997 John Wiley & Sons, Ltd.     

Bruck formula for a perturbed Lipschitzian iteration of Lipschitz pseudocontractive maps

Introduction InRef.[1],BrowderdefinedpseudocontractivemappinginBanachspaceand mentionedtherelationshipofthisclassofmappingtoanimportantclassofmappingknown asaccretive(monotoneinHilbertspace)operator.ThemappingAisaccretiveiffI-Ais pseudocontractive.Themapp…     

非线性复合材料杂交应力有限元的有效迭代方法

推导了面内剪应力应变关系非线性的复合材料的杂交应力有限元列式,给出了位移迭代和应力迭代的策略和步骤．提出一种非线性应力场迭代格式的改进方案,不仅提高了收敛速度,而且克服了大载荷下简单迭代法循环迭代而无法收敛的关键问题,使得所提出的非线性杂交应力元方法几乎对任意大载荷都能够收敛．数值算例表明该方法是确实可行的．     

基于同位网格下求解N-S方程的快速算法

在有限容积法基础上建立了基于同位网格的SIMPLEM算法。此算法使初始压力场与速度场耦合,让压力场和速度场同时更好地满足动量方程和连续性方程,且兼顾考虑扩散对流项对计算节点速度修正值的影响及源项与速度场之间的同步性,详细给出了算法的推导过程且对方腔顶盖驱动流进行了数值模拟。计算节点的布置采用同位网格技术,界面流速通过动量插值确定,在不同条件下讨论了迭代次数与残差的关系和不同算法的收敛性,同时验证了算法及程序是准确和可信的。     

A DOMAIN DECOMPOSITION ALGORITHM WITH FINITE ELEMENT-BOUNDARY ELEMENT COUPLING

A domain decomposition algorithm coupling the finite element and the boundary element was presented. It essentially involves subdivision of the analyzed domain into sub-regions being independently modeled by two methods, i.e., the finite element method (FEM) and the boundary element method (BEM). The original problem was restored with continuity and equilibrium conditions being satisfied on the interface of the two sub-regions using an iterative algorithm. To speed up the convergence rate of the iterative algorithm, a dynamically changing relaxation parameter during iteration was introduced. An advantage of the proposed algorithm is that the locations of the nodes on the interface of the two sub-domains can be inconsistent. The validity of the algorithm is demonstrated by the consistence of the results of a numerical example obtained by the proposed method and those by the FEM, the BEM and a present finite element-boundary element (FE-BE) coupling method.     

Three‐dimensional instability of axisymmetric flows: solution of benchmark problems by a low‐order finite volume method

Several problems on three‐dimensional instability of axisymmetric steady flows driven by convection or rotation or both are studied by a second‐order finite volume method combined with the Fourier decomposition in the periodic azimuthal direction. The study is focused on the convergence of the critical parameters with mesh refinement. The calculations are done on the uniform and stretched grids with variation of the stretching. Converged results are reported for all the problems considered and are compared with the previously published data. Some of the calculated critical parameters are reported for the first time. The convergence studies show that the three‐dimensional instability of axisymmetric flows can be computed with a good accuracy only on fine enough grids having about 100 nodes in the shortest spatial direction. It is argued that a combination of fine uniform grids with the Richardson extrapolation can be a good replacement for a grid stretching. It is shown once more that the sparseness of the Jacobian matrices produced by the finite volume method allows one to enhance performance of the Newton and Arnoldi iteration procedures by combining them with a direct sparse linear solver instead of using the Krylov‐subspace‐based iteration methods. Copyright © 2006 John Wiley & Sons, Ltd.     

最优化算法的收敛准则

收敛准则是最优化算法的重要组成部分，其选择得好与坏将直接影响到算法的成功与否以及收敛得快与慢。现有常用的收敛准则基本上是建立在前后迭代点的逼近和它们相应函数值的逼近是否达到一定的精度要求以及迭代点处函数梯度是否接近于零的基础上的。它们各自有自己的适用范围。但它们的共同特点是对迭代终止点的性质不能做出判断。本文在总结和分析现有算法收敛准则的基础上，借助于正定矩阵、一维优化方法中对分法和黄金分割法，提出了新的算法收敛准则。算例结果表明，这些收敛准则是有效实用的。     

A transient solution method for the finite element incompressible Navier-Stokes equations

A numerical procedure for solving the time-dependent, incompressible Navier-Stokes equations is presented. The present method is based on a set of finite element equations of the primitive variable formulation, and a direct time integration method which has unique features in its formulation as well as in its evaluation of the contribution of external functions. Particular processes regarding the continuity conditions and the boundary conditions lead to a set of non-linear recurrence equations which represent evolution of the velocities and the pressures under the incompressibility constraint. An iteration process as to the non-linear convective terms is performed until the convergence is achieved in every integration step. Excessively artificial techniques are not introduced into the present solution procedure. Numerical examples with vortex shedding behind a rectangular cylinder are presented to illustrate the features of the proposed method. The calculated results are compared with experimental data and visualized flow fields in literature.     

Olver迭代与Newton迭代的比较

Olver迭代是一个立方收敛的求根公式,而Newton迭代仅是平方收敛,但前者却不如后者为人们所熟知,以至于近来有作者其推导了一个新的高阶迭代公式,而实际就是Olver迭代公式却浑然不如。那么,到底是什么原因导致Olver迭代没有被广大的计算方法教科书介绍呢？本文对Newton迭代与Olver迭代做了详尽的分析,给出了两者各自的精度表达式,并对两者进行了比较,结论是：从计算效率及精度方面综合考虑,Olver迭代公式不如Newton迭代公式实用。     

An algorithm that accelerates convergence rates for incompressible Navier-Stokes problems

An algorithm, called the Algebraic Continuity Equations Solver (ACES), is developed based on the concept that two algebraic equations (three for 3D problems) can be generated from rearranging the discretized continuity equations. These rearranged equations are used to re-compute the two velocity components (three for 3D problems), whose values are already obtained from solving the momentum equations. When written in a Navier-Stokes computer code, this algorithm is equivalent to a fairly concise set of statements and can be implemented immediately after the computation of the continuity equation. In our analysis, ACES is used in conjunction with a grid having nodal velocity components at the vertices and the nodal pressure at the centre of each computational cell. With the aid of ACES, correction of velocity components during the iteration can be inexpensively made, leading to faster convergence rates or rendering otherwise divergent computations convergent. Test problems include benchmark problems such as lid-driven cavity flows and buoyancy-driven cavity flows of various parametric values and grid sizes. A 3D time-dependent flow in an irregular geometry is also investigated. Discussions are presented to clarify some relevant issues. A possible reason why we think ACES is capable of improving the convergence rates is also given.     

结构可靠指标的通用计算方法

在求解结构可靠指标时，保证迭代计算的收敛性是非常重要的，而实际计算表明，在有些情况下，用现有的计算方法（如JC法）进行迭代计算可能是不收敛的，这样给可靠指标的求解带来了困难。本文提出一个通用的可靠指标计算方法，通过引入可以根据迭代收敛条件自动调节的步长，实现对迭代过程和收敛性的控制。另外，本文方法不需要使用结构功能函数的偏导数，对于功能函数不能明确表达的可靠度问题尤为适用，对于功能函数可以明确表达但求导复杂的问题，可省去求导过程。最后，通过四个算例论证了本文方法的可行性。     

A spectral collocation method for compressible,non-similar boundary layers

An efficient and highly accurate algorithm based on a spectral collocation method is developed for numerical solution of the compressible, two-dimensional and axisymmetric boundary layer equations. The numerical method incorporates a fifth-order, fully implicit marching scheme in the streamwise (timelike) dimension and a spectral collocation method based on Chebyshev polynomial expansions in the wall-normal (spacelike) dimension. The discrete governing equations are cast in residual form and the residuals are minimized at each marching step by a preconditioned Richardson iteration scheme which fully couples energy, momentum and continuity equations. Preconditioning on the basis of the finite difference analogues of the governing equations results in a computationally efficient iteration with acceptable convergence properties. A practical application of the algorithm arises in the area of compressible linear stability theory, in the investigation of the effects of transverse curvature on the stability of flows over axisymmetric bodies. The spectral collocation algorithm is used to derive the non-similar mean velocity and temperature profiles in the boundary layer of a ‘fuselage’ (cylinder) in a high-speed (Mach 5) flow parallel to its axis. The stability of the flow is shown to be sensitive to the gradual streamwise evolution of the mean flow and it is concluded that the effects of transverse curvature on stability should not be ignored routinely.     

一种高效的等参有限元逆变换算法

采用Ｔａｙｌｏｒ展开技术构造了一种具有线性迭代格式的等参有限元逆变换算法，对算法的收敛性和收敛速度分别给出了理论证明和数值检验。该算法不仅形式简单、便于程序实现，且适合于任何类型的等参单元，是一种高效实用的逆变换算法。文中还给出了算法的实施框图。     

基于Newton/Gauss-Seidel迭代的DGM隐式方法

在Newton迭代方法的基础上,对高阶精度间断Galerkin有限元方法(DGM)的时间隐式格式进行了研究. Newton迭代 法的优势在于收敛效率高效,并且定常和非定常问题能够统一处理,对于非定常问题无需引入双时间步策略. 为了避免大型矩阵的求逆,采用一步Gauss-Seidel迭代和Matrix-free技术消去残值Jacobi矩阵的上、下三角矩阵,从而只需计算和存储对角(块)矩阵. 对角(块)矩阵采用数值方法计算. 空间离散采用Taylor基,其优势在于对于任意形状的网格,基函数的形式是一致的,有利于在混合网格上推广. 利用该方法,数值模拟了Bump绕流和NACA0012翼型绕流. 计算结果表明,与显式的Runge-Kutta时间格式相比,隐式格式所需的迭代步数和CPU时间均在很大程度上得到减少,计算效率能够提高1～ 2个量级.     

超椭球模型下结构非概率可靠性指标的迭代算法

迭代算法对于非概率可靠性指标的求解及其优化问题具有重要意义。本文基于不确定参数的超椭球描述,研究求解非概率可靠性指标的迭代算法。针对极限状态方程非线性情况较高时可能存在不收敛的问题,提出一个检测严重迂回振荡的判据,并在HL-RF迭代公式的基础上引入修正解,在一定程度上克服迭代不收敛的问题。数值算例验证了迭代算法的正确性和有效性。     

跨音速翼型反设计的一种大范围收敛方法

求解跨音速翼型的反设计问题时,传统的梯度型方法一般均为局部收敛. 为增大求解的收敛范围,依据同伦方法的思想,通过构造不动点同伦,将原问题的求解 转化为其同伦函数的求解,并依据拟Sigmoid函数调整同伦参数以提高计算效率,进而构造 出一种具有较高计算效率的大范围收敛反设计方法. 数值算例以RAE2822翼型的表面压力分 布为拟合目标,分别采用B样条方法, PARSEC方法及正交形函数方法等3种不同的 参数化方法,并分别以NACA0012, OAF139及VR15翼型为初始翼型进行迭代计 算. 计算结果证明,该方法适用于多种参数化方法,且具有较好的计算效率,从多 个不同的初始翼型出发,经较少次数迭代后, 均能与目标翼型很好地拟合,是一种高效的大范围收敛方法.     

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.     

圆板非线性振动有限元分析的一种迭代方法

同时考虑横向振动和板平面内的运动,用3节点有限元研究均匀圆板的轴对称大振幅非线性振动,构造了一个避免发散加速收敛的平均迭代法,并将计算结果与文献的已有结果做了比较。     

一种新的有限元模型移频动力缩聚法

将矩阵幂迭代法与移频技术相结合,建立了一种新的结构动力缩聚方法.该方法首先应用矩阵幂迭代法对结构的初始有限元模型进行一次缩聚,计算初始缩聚模型的特征值,然后通过判断低阶特征值的收敛情况确定移频位置,选择合适的移频值,建立移频后的广义特征方程;再根据矩阵幂迭代法迭代计算新的广义特征方程的动力缩聚矩阵,经迭代收敛后得到精确...