A preconditioned alternating inner-outer iterative solution method for the mixed finite element formulation of the Navier-Stokes equations

In the present work a new iterative method for solving the Navier-Stokes equations is designed. In a previous paper a coupled node fill-in preconditioner for iterative solution of the Navier-Stokes equations proved to increase the convergence rate considerably compared with traditional preconditioners. The further development of the present iterative method is based on the same storage scheme for the equation matrix as for the coupled node fill-in preconditioner. This storage scheme separates the velocity, the pressure and the coupling of pressure and velocity coefficients in the equation matrix. The separation storage scheme allows for an ILU factorization of both the velocity and pressure unknowns. With the inner-outer solution scheme the velocity unknowns are eliminated before the resulting equation system for the pressures is solved iteratively. After the pressure unknown has been found, the pressures are substituted into the original equation system and the velocities are also found iteratively. The behaviour of the inner-outer iterative solution algorithm is investigated in order to find optimal convergence criteria for the inner iterations and compared with the solution algorithm for the original equation system. The results show that the coupled node fill-in preconditioner of the original equation system is more efficient than the coupled node fill-in preconditioner of the reduced equation system. However, the solution technique of the reduced equation system revals properties which may be advantageous in future solution algorithms.     

ADAPTIVE LINEARIZATION AND GRID ITERATIONS WITH THE TRI-TREE MULTIGRID REFINEMENT–RECOARSEMENT ALGORITHM FOR THE NAVIER–STOKES EQUATIONS

The tri-tree algorithm for refinements and recoarsements of finite element grids is explored. The refinement–recoarsement algorithm not only provides an accurate solution in certain parts of the grid but also has a major influence on the finite element equation system itself. The refinements of the grid lead to a more symmetric and linear equation matrix. The recoarsements will ensure that the grid is not finer than is necessary for preventing divergence in an iterative solution procedure. The refinement–recoarsement algorithm is a dynamic procedure and the grid is adapted to the instant solution. In the tri-tree multigrid algorithm the solution from a coarser grid is scaled relatively to the increase in velocity boundary condition for the finer grid. In order to have a good start vector for the solution of the finer grid, the global Reynolds number or velocity boundary condition should not be subject to large changes. For each grid and velocity solution the element Reynolds number is computed and used as the grid adaption indicator during the refinement–recoarsement procedure. The iterative tri-tree multigrid method includes iterations with respect to the grid. At each Reynolds number the same boundary condition s are applied and the grid is adapted to the solution iteratively until the number of unknowns and elements in the grid becomes constant. In the present paper the following properties of the tri-tree algorithm are explored: the influence of the increase in boundary velocities and the size of the grid adaption indicator on the amount of work for solving the equations, the number of linear iterations and the solution error estimate between grid levels. The present work indicates that in addition to the linear and non-linear iterations, attention should also be given to grid adaption iterations. © 1997 by John Wiley & Sons, Ltd.     

大型陀螺特征值问题的广义Arnoldi减缩算法

基于Ａｒｎｏｌｄｉ法，建立陀螺特征值问题的广义Ａｒｎｏｌｄｉ格式，并利用系统矩阵的反对称特性，得到极其简洁的甚至比对称矩阵Ｌａｎｃｚｏｓ法更为简单的递推格式，可称为陀螺Ａｒｎｏｌｄｉ减缩算法。     

Least squares based iterative identification algorithms for input nonlinear controlled autoregressive systems based on the auxiliary model

For the difficulty that the information vector in the identification model contains the unknown variables, we substitute these unknown variables with the outputs of the auxiliary model and then develop an auxiliary model based recursive least squares algorithm, an auxiliary model based least squares iterative (AM-LSI) algorithm, and derive an equivalent matrix decomposition based AM-LSI algorithm for input nonlinear controlled autoregressive systems based on the auxiliary model. The simulation results show that the proposed algorithms can estimate the parameters of a class of input nonlinear systems.     

Axially symmetric cavitation flow at small cavitation numbers

A method for computing the drag coefficient of a body in an axially symmetric, steady-state cavitation flow is presented. A ‘vortex ring’ distribution along the wetted body surface and along the cavity interface is assumed. Since the location of the cavitation interface is unknown a priori, an iterative procedure is used, where, for the first stage, an arbitrary cavitation interface is assumed. The flow field is then solved, and by an iterative process the location of the cavitation interface is corrected. Even though the flow field is governed by the linear Laplace equation, strong non-linearity resulting from the kinematic boundary conditions appears along the cavitation interface. An improved numerical scheme for solving the dual Fredholm integral equations is obtained by formulating high-order approximations to the singular integrals in order to reduce the matrix dimensions. Good agreement is found between the numerical results of the present work, experimental results and other solutions.     

A NON－INCREMENTAL TIME－SPACE ALGORITHM FOR NUMERICAL SIMULATION OF FORMING PROCESS

ＡＮＯＮ－ＩＮＣＲＥＭＥＮＴＡＬＴＩＭＥ－ＳＰＡＣＥＡＬＧＯＲＩＴＨＭＦＯＲＮＵＭＥＲＩＣＡＬＳＩＭＵＬＡＴＩＯＮＯＦＦＯＲＭＩＮＧＰＲＯＣＥＳＳＬｉｕＢａｏｓｈｅｎｇ（柳葆生）ＣｈｅｎＤａｐｅｎｇ（陈大鹏）ＬｉｕＹｕ（刘渝）（ＲｅｃｅｉｖｅｄＡｐｒ...     

ARNOLDI REDUCTION ALGORITHM FOR LARGE SCALE GYROSCOPIC EIGENVALUE PROBLEM

Based on Arnoldi's method, a version of generalized Arnoldi algorithm has been devel-oped for the reduction of gyroscopic eigenvalue problems. By utilizing the skew symmetry of systemmatrix, a very simple recurrence scheme, named gyroscopic Arnoldi reduction algorithm has been ob-tained, which is even simpler than the Lanczos algorithm for symmetric eigenvalue problems. Thecomplex number computation is completely avoided. A restart technique is used to enable the reductionalgorithm to have iterative characteristics. It has been found that the restart technique is not only ef-fective for the convergence of multiple eigenvalues but it also furnishes the reduction algorithm with atechnique to check and compute missed eigenvalues. By combining it with the restart technique, the al-gorithm is made practical for large-scale gyroscopic eigenvalue problems. Numerical examples are giv-en to demonstrate the effectiveness of the method proposed.     

Several new types of finite-difference schemes for shallow-water equation with initial-boundary value and their numerical experiment

This paper proposed several new types of finite-difference methods for the shallow water equation in absolute coordinate system and put forward an effective two-step predictorcorrector method, a compact and iterative algorithm for five diagonal matrix. Then the iterative method was used for a multigrid procedure for shallow water equation. At last, an initial-boundary value problem was considered, and the numerical results show that the linear sinusoidal wave would successively evolve into conoidal wave.     

框架结构屈曲的精确有限元求解

基于屈曲微分控制方程的一般解,构造了Euler梁在轴力作用下的精确形函数,建立了用于框架结构屈曲分析的精确有限单元,得到了单元刚度矩阵和几何刚度矩阵的显式表达,并提出了基于常规特征值计算的迭代算法以确定屈曲载荷及相应失稳模态的精确解. 研究表明, 对于线性稳定性分析而言,常规框架有限单元可视为精确有限单元的一种近似. 若采用精确单元,无需进行网格细分就可以获得精确的屈曲载荷和失稳模态. 数值算例证明了新单元和算法的效率和精度.      

Numerical implementation of Aristov–Pukhnachev's formulation for axisymmetric viscous incompressible flows

In the present work a finite‐difference technique is developed for the implementation of a new method proposed by Aristov and Pukhnachev (Doklady Phys. 2004; 49 (2):112–115) for modeling of the axisymmetric viscous incompressible fluid flows. A new function is introduced that is related to the pressure and a system similar to the vorticity/stream function formulation is derived for the cross‐flow. This system is coupled to an equation for the azimuthal velocity component. The scheme and the algorithm treat the equations for the cross‐flow as an inextricably coupled system, which allows one to satisfy two conditions for the stream function with no condition on the auxiliary function. The issue of singularity of the matrix is tackled by adding a small parameter in the boundary conditions. The scheme is thoroughly validated on grids with different resolutions. The new numerical tool is applied to the Taylor flow between concentric rotating cylinders when the upper and lower lids are allowed to rotate independently from the inner cylinder, while the outer cylinder is held at rest. The phenomenology of this flow is adequately represented by the numerical model, including the hysteresis that takes place near certain specific values of the Reynolds number. Thus, the present results can be construed to demonstrate the viability of the new model. The success can be attributed to the adequate physical nature of the auxiliary function. The proposed technique can be used in the future for in‐depth investigations of the bifurcation phenomena in rotating flows. Copyright © 2009 John Wiley & Sons, Ltd.     

Auxiliary principle and approximation solvability for system of new generalized mixed equilibrium problems in reflexive Banach spaces

A new system of generalized mixed equilibrium problems (SGMEPs) involving generalized mixed variational-like inequality problems is introduced and studied in reflexive Banach spaces. A system of auxiliary generalized mixed equilibrium problems (SAGMEPs) for solving the SGMEPs is first introduced. Existence and uniqueness of the solutions to the SAGMEPs is proved under quite mild assumptions without any coercive conditions in reflexive Banach spaces. Using the auxiliary principle technique, a new iterative algorithm for solving the SGMEPs is proposed and analyzed. Strong convergence of the iterative sequences generated by the algorithm is also proved under quite mild assumptions without any coercive conditions. These results improve, unify, and generalize some recent results in this field.     

Stress–Strain Analysis of Thin-Walled Shells with Massive Ribs

A multifrontal method is proposed for solving large-scale finite-element problems with a symmetric stiffness matrix. This approach is based on node ordering rather than element ordering as in the traditional frontal or multifrontal methods. This allows us to employ the efficient well-known ordering techniques such as the minimum-degree algorithm or the nested dissection method. A thin-walled cylindrical shell with massive ribs is considered as an example. The efficiency of the method proposed is illustrated against the classical skyline and aggregation multilevel conjugate-gradient iterative solvers     

A finite element solutionof three-dimensional mixed convection gas flows in horizontal chnnels using preconditioned iterative metrix methods

An algorithm is presented for the finite element solution of three-dimensional mixed convection gas flows in channels heated from below. The algorithm uses Newton's method and iterative matrix methods. Two iterative solution algorithms, conjugate gradient squared (CGS) and generalized minimal residual (GMERS), are used in conjunction with a preconditioning technique that is simple to implement. The preconditioner is a subset of the full Jacobian matrix centered around the main diagonal but retaining the most fundamental axial coupling of the residual equations. A domain-renumbering scheme that enhances the overall algorithm performance is proposed on the basis of and analysis of the preconditioner. Comparison with the frontal elimination method demonstrates that the iterative method will be faster when the front width exceeds approximately 500. Techniques for the direct assembly f the problem into a compressed sparse row storage format are demonstrated. Elimination of fixed boundary conditions is shown to decrease the size of the matrix problem by up to 30%. Finally, fluid flow solutions obtained with the numerical technique are presented. These solutions reveal complex three-dimensional mixed convection fluid flow phenomena at low Reynolds numbers, including the reversal of the direction of longitudinal rolls in the presence of a strong recirculation in the entrance region of the channel.     

Stiffness properties of particulate composites containing debonded particles

This paper considers the problem of determining the nonlinear bimodular stiffness properties, i.e., the tensile and compressive Young’s moduli and Poisson’s ratios, and the shear modulus, of particulate composite materials with particle–matrix interfacial debonding. It treats the general case in which some of the particles are debonded while the others remain intact. The Mori–Tanaka approach is extended to formulate the method of solution for the present problem. The resulting auxiliary problem of a single debonded particle in an infinite matrix subjected to a remote stress equal to the average matrix stress, for which Eshelby’s solution does not exist, is solved by the finite element method accounting for the particle–matrix separation and contact at the debonded particle–matrix interface. Because of the nonlinear nature of the problem, an iterative process is employed in calculating the stiffness properties. The predicted stiffness properties are compared to the exact solutions of the stiffness properties of particulate composites with body-centered cubic packing arrangement.     

A vertex‐centered linearity‐preserving discretization of diffusion problems on polygonal meshes

This paper introduces a vertex‐centered linearity‐preserving finite volume scheme for the heterogeneous anisotropic diffusion equations on general polygonal meshes. The unknowns of this scheme are purely the values at the mesh vertices, and no auxiliary unknowns are utilized. The scheme is locally conservative with respect to the dual mesh, captures exactly the linear solutions, leads to a symmetric positive definite matrix, and yields a nine‐point stencil on structured quadrilateral meshes. The coercivity of the scheme is rigorously analyzed on arbitrary mesh size under some weak geometry assumptions. Also, the relation with the finite volume element method is discussed. Finally, some numerical tests show the optimal convergence rates for the discrete solution and flux on various mesh types and for various diffusion tensors. Copyright © 2015 John Wiley & Sons, Ltd.     

Iterative and multigrid methods in the finite element solution of incompressible and turbulent fluid flow

Multigrid and iterative methods are used to reduce the solution time of the matrix equations which arise from the finite element (FE) discretisation of the time‐independent equations of motion of the incompressible fluid in turbulent motion. Incompressible flow is solved by using the method of reduce interpolation for the pressure to satisfy the Brezzi–Babuska condition. The k–l model is used to complete the turbulence closure problem. The non‐symmetric iterative matrix methods examined are the methods of least squares conjugate gradient (LSCG), biconjugate gradient (BCG), conjugate gradient squared (CGS), and the biconjugate gradient squared stabilised (BCGSTAB). The multigrid algorithm applied is based on the FAS algorithm of Brandt, and uses two and three levels of grids with a ‘V‐cycling’ schedule. These methods are all compared to the non‐symmetric frontal solver. Copyright © 1999 John Wiley & Sons, Ltd.     

Auxiliary principle and approximation solvability for system of new generalized mixed equilibrium problems in reflexive Banach spaces

A new system of generalized mixed equilibrium problems (SGMEPs) involving generalized mixed variational-like inequality problems is introduced and studied in reflexive Banach spaces. A system of auxiliary generalized mixed equilibrium problems (SAGMEPs) for solving the SGMEPs is first introduced. Existence and uniqueness of the solutions to the SAGMEPs is proved under quite mild assumptions without any coercive conditions in reflexive Banach spaces. Using the auxiliary principle technique, a new iterative algorithm for solving the SGMEPs is proposed and analyzed. Strong convergence of the iterative sequences generated by the algorithm is also proved under quite mild assumptions without any coercive conditions. These results improve, unify, and generalize some recent results in this field.     

Iterative algorithm of solutions for multivalued general mixed implicit equilibrium-like problems

The multivalued general mixed implicit equilibrium-like problems are introduced and studied. To solve these problems, a new predictor-corrector iterative algorithm is proposed and analyzed using the auxiliary principle technique. The convergence of the suggested algorithm is also proved in weaker conditions.     

Auxiliary principle and three-step iterative algorithms for generalized set-valued strongly nonlinear mixed variational-like inequalities

An auxiliary principle technique to study a class of generalized set-valued strongly nonlinear mixed variational-like inequalities is extended. The existence and uniqueness of the solution of the auxiliary problem for the generalized set-valued strongly nonlinear mixed variational-like inequalities are proved, a novel and innovative three-step iterative algorithm to compute approximate solution is constructed, and the existence of the solution of the generalized set-valued strongly nonlinear mixed variational-like inequality is shown using the auxiliary principle technique. The convergence of three-step iterative sequences generated by the algorithm is also proved.     

基于分区加速和总体共轭梯度法的耦合界面数据传递问题研究

对于耦合动力学问题的分析过程,在界面上需频繁进行数据交换。为此,基于紧支径向基函数和多项式基函数推导了界面数据传递的插值算法,给出了传递矩阵的具体形式。通过分析时间复杂度,找出该算法在大节点量时效率不高的原因在于径向基矩阵的构造和传递矩阵的计算。为加快径向基矩阵的构造速度,提出分区加速处理以提高相关节点的搜索效率;为避免传递矩阵求解过程中的求逆运算,将其转化为多右端项的大型稀疏对称线性方程组问题,引入多右端项的总体共轭梯度迭代方法求解,并讨论了初始估计矩阵的选取方法。数值算例结果表明,结合使用分区加速原理和总体共轭梯度迭代方法,可在不损失插值精度的前提下显著提高求解效率。