MG法求解严重病态方程

ＭＧ法求解严重病态方程王建华（河海大学,南京２１００２４）１问题提出用有限元法分析土与结构物相互作用问题时,导出的代数方程一般均呈病态,如在软土中打入钢管桩或混凝土桩时,由于混凝土和钢的弹性模量较大（钢：２．１×１０￣８ｋＰａ,混凝土：３．０×１０￣...     

自适应多重网格有限元网格生成器研制

基于协调三角形剖分算法、分子表数据结构和Ｚｉｅｎｋｉｅｗｉｃｚ－Ｚｈｕ误差估计方法，本文研制出适用于自适应多重网格有限元的网格生成器。该网格生成器可对复杂的区域进行自适应加密。当荷载作用边界随时间变化及在动力荷载作用下，网格生成器可退化与再加密网格。     

自适应多重网格有限元网格生成器研制

基于协调三角形剖分算法、分子表数据结构和Ｚｉｅｎｋｉｅｗｉｃｚ－Ｚｈｕ误估计方法，本文研制出适用于自适应多重网格有限元的网格生成器，该网格生成器可对复杂的区域进行自适应加密。当荷载作用边界随时间变及在动力荷载作用下，网格生成器可退化与再加密网格。     

基于叉树法的自适应有限元局部网格加密研究

本文以叉树法网格生成技术为基础，提出了效率高，易实现的局部网格加密步骤，同时设计了相互匹配的网格数据结构和树数据结构以及局部网格修正算法用以支持本文所提出的局部网格加密步骤，最后，给出了局部网格加密例子，用以证明本文所提出的方法可以很容易地生成任意密度分布的网格，对于实施自适应ｈ－方案是十分有利的。     

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

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

不可压Navier-Stokes方程基于误差估算的网格自适应解法

首先导出了广义Stokes方程Petrov—Galerkin有限元数值解的当地事后误差估算公式;以非连续二阶鼓包（bump）函数空间为速度、压强误差的近似空间,该估算基于求解当地单元上的广义Stokes问题。然后,证明了误差估算值与精确误差之间的等价性。最后,将误差估算方法应用于Navier—Stokes环境,以进行不可压粘流计算中的网格自适应处理。数值实验中成功地捕获了多强度物理现象,验证了本文所发展的方法。     

无网格介点法求解Helmholtz方程

作为一种配点型无网格法,无网格介点MIP法具有数值实施简单、计算精度高、运算高效和适用范围广等优点。Helmholtz方程是科学与工程问题中广泛应用的一类特殊方程,因此对MIP法求解此类方程的适用性进行了验证。利用MIP法的d适应性,给出了MIP法求解该方程的两种计算格式。在数值算例中,分别对平面规则域和不规则域上的一般Helmholtz方程,以及轴对称Helmholtz方程进行了数值分析。结果表明,MIP法完全适用于求解Helmholtz方程。而且,MIP法的计算精度和收敛性都优于普通配点法。此外,MIP法的两种计算格式中,L2C0型通常具有更好的计算效果,故建议将该计算格式作为MIP法求解该类方程的标准形式。     

自适应有限元局部P加密的面向对象程序实现

本文采用了面向对象的程序设计方法，以C 作为编程语言，构造了一个局部自适应有限元P加密程序。研究内容涉及从Serendipity函数的构造、单元的形成、自升阶算法以及误差估计和判断。最后采用C 的一系列类及成员函数实现了这些功能，并构造了相应的输入输出模块，使其成为一个完整的自适应有限元分析程序。文中给出的计算结果表明，在P加密有限元分析程序中，误差随着阶数的升高而下降。而且，局部P加密的区域也集中在应力奇异的部位。这验证了文中的理论推导及程序实现的正确性。     

全机绕流Euler方程多重网格分区计算方法

全机三维复杂形状绕流数值求解只能采用分区求解的方法,本文采用可压缩Euler方程有限体积方法以及多重网格分区方法对流场进行分区计算。数值方法采用改进的van Leer迎风型矢通量分裂格式和MUSCL方法,基于有限体积方法和迎风型矢通量分裂方法,建立一套处理子区域内分界面的耦合条件。各个子区域之间采用显式耦合条件,区域内部采用隐式格式和局部时间步长等,以加快收敛速度。计算结果飞机表面压力分布等气动力特性与实验值进行了比较,二者基本吻合。计算结果表明采用分析“V”型多重网格方法,能提高计算效率,加快收敛速度达到接近一个量级。根据全机数值计算结果和可视化结果讨论了流场背风区域旋涡的形成过程。     

使用不等距多重网格技术求解线接触热弹流润滑问题

使用不等距多重网格法求解了线接触热弹流润滑问题 .结果表明 :与等距多重网格法相比 ,新解法虽不能提高数值求解的稳定性 ,却能得到更为精确的压力、膜厚及温度分布 ;计算结果表明中载下第二压力峰是光滑的     

ADAPTIVE MESH REFINEMENT METHODS FOR THREE-DIMENSIONAL INVISCID FLOW PROBLEMS

SUMMARY

The local grid refinement technique is incorporated into a finite volume program that solves the three-dimensional compressible Euler equations. The underlying idea is to improve the solution accuracy in domains of dominating physical flow features, thus avoiding a global fine mesh to resolve most of the smooth flow. An unstructured data system is introduced to manage point enrichment on multiple refinement levels for structured meshes of hexahedral cells. Grid adaption is utilized to cluster points automatically in domains of interest. The multi-block formulation permits the application of the refinement method to various external flow configurations.     

ADAPTIVE GRID REFINEMENT USING CELL-LEVEL AND GLOBAL IMBALANCES

A methodology for local solution-adaptive mesh refinement in computational fluid dynamics (CFD) using cell-level and global kinetic energy balances is formulated and tested. Results are presented for two two-dimensional steady incompressible laminar benchmark problems: a lid-driven cavity (Reynolds number Re=1000) and a backward-facing step (Re=400). It is demonstrated that local kinetic energy imbalance correlates with local solution accuracy, that normalized global imbalance is an appropriate criterion for halting mesh refinement and that a specified level of accuracy is realized at lower computational effort using local refinement compared with a uniform finer mesh. © 1997 by John Wiley and Sons, Ltd.     

COMPARISON OF H AND P FINITE ELEMENT APPROXIMATIONS OF THE SHALLOW WATER EQUATIONS

A p-type finite element scheme is introduced for the three-dimensional shallow water equations with a harmonic expansion in time. The wave continuity equation formulation is used which decouples the problem into a Helmholtz equation for surface elevation and a momentum equation for horizontal velocity. An exploration of the applicability of p methods to this form of the shallow water problem is presented, with a consideration of the problem of continuity errors. The convergence rates and relative computational efficiency between h- and p- type methods are compared with the use of three test cases representing various degrees of difficulty. A channel test case establishes convergence rates, a continental shelf test case examines a problem with accuracy difficulties at the shelf break, and a field-scale test case examines problems with highly irregular grids. For the irregular grids, adaptive h combined with uniform p refinement was necessary to retain high convergence rates. © 1997 John Wiley & Sons, Ltd.     

自适应有限元方法及其工程应用

自适应有限元方法是一种能通过自适应分析自动调整算法以改进求解过程的数值方法．它以常规有限元法为基础,以误差估计和自适应网格改进技术为核心,是一种效率高、可靠性高的计算方法．文中简要介绍并综述了自适应有限元方法的重要发展及应用情况．并对其发展前景作了概要的预测      

AN ADAPTIVE UNSTRUCTURED TRI-TREE ITERATIVE SOLVER FOR MIXED FINITE ELEMENT FORMULATION OF THE STOKES EQUATIONS

An iterative adaptive equation solver for solving the implicit Stokes equations simultaneously with tri-tree grid generation is developed. The tri-tree grid generator builds a hierarchical grid structure which is mapped to a finite element grid at each hierarchical level. For each hierarchical finite element grid the Stokes equations are solved. The approximate solution at each level is projected onto the next finer grid and used as a start vector for the iterative equation solver at the finer level. When the finest grid is reached, the equation solver is iterated until a tolerated solution is reached. In order to reduce the overall work, the element matrices are integrated analytically beforehand. The efficiency and behaviour of the present adaptive method are compared with those of the previously developed iterative equation solver which is preconditioned by incomplete LU factorization with coupled node fill-in. The efficiency of the incomplete coupled node fill-in preconditioner is shown to be largely dependent on the global node numbering. The preconditioner is therefore tested for the natural node ordering of the tri-tree grid generator and for different ways of sorting the nodes.     

A NON-LINEAR ADAPTIVE FULL TRI-TREE MULTIGRID METHOD FOR THE MIXED FINITE ELEMENT FORMULATION OF THE NAVIER–STOKES EQUATIONS

The full adaptive multigrid method is based on the tri-tree grid generator. The solution of the Navier–Stokes equations is first found for a low Reynolds number. The velocity boundary conditions are then increased and the grid is adapted to the scaled solution. The scaled solution is then used as a start vector for the multigrid iterations. During the multigrid iterations the grid is first recoarsed a specified number of grid levels. The solution of the Navier–Stokes equations with the multigrid residual as right-hand side is smoothed in a fixed number of Newton iterations. The linear equation system in the Newton algorithm is solved iteratively by CGSTAB preconditioned by ILU factorization with coupled node fill-in. The full adaptive multigrid algorithm is demonstr ated for cavity flow. © 1997 by John Wiley & Sons, Ltd. Int. j. numer. methods fluids 24: 1037ndash;1047, 1997.     

ADAPTIVE PARALLEL MULTIGRID SOLUTION OF 2D INCOMPRESSIBLE NAVIER–STOKES EQUATIONS

In this paper an adaptive parallel multigrid method and an application example for the 2D incompressible Navier–Stokes equations are described. The strategy of the adaptivity in the sense of local grid refinement in the multigrid context is the multilevel adaptive technique (MLAT) suggested by Brandt. The parallelization of this method on scalable parallel systems is based on the portable communication library CLIC and the message-passing standards: PARMACS, PVM and MPI. The specific problem considered in this work is a two-dimensional hole pressure problem in which a Poiseuille channel flow is disturbed by a cavity on one side of the channel. Near geometric singularities a very fine grid is needed for obtaining an accurate solution of the pressure value. Two important issues of the efficiency of adaptive parallel multigrid algorithms, namely the data redistribution strategy and the refinement criterion, are discussed here. For approximate dynamic load balancing, new data in the adaptive steps are redistributed into distributed memories in different processors of the parallel system by block remapping. Among several refinement criteria tested in this work, the most suitable one for the specific problem is that based on finite-element residuals from the point of view of self-adaptivity and computational efficiency, since it is a kind of error indicator and can stop refinement algorithms in a natural way for a given tolerance. Comparisons between different global grids without and with local refinement have shown the advantages of the self-adaptive technique, as this can save computer memory and speed up the computing time several times without impairing the numerical accuracy. © 1997 By John Wiley & Sons, Ltd. Int. J. Numer. Methods Fluids 24, 875–892, 1997.     

一种四面体网格局部自适应方法在有限元中的应用

通过提出一种针对三维四面体网格的区域整形技术，给出了一种简便实用的四面体网格局部自适应加密方法，并将其与流量修正有限元法结合，应用于三维高速流的计算     

A NON–LINEAR ADAPTED TRI–TREE MULTIGRID SOLVER FOR FINITE ELEMENT FORMULATION OF THE NAVIER–STOKES EQUATIONS

An iterative adaptive equation multigrid solver for solving the implicit Navier–Stokes equations simultaneously with tri-tree grid generation is developed. The tri-tree grid generator builds a hierarchical grid structur e which is mapped to a finite element grid at each hierarchical level. For each hierarchical finite element multigrid the Navier–Stokes equations are solved approximately. The solution at each level is projected onto the next finer grid and used as a start vector for the iterative equation solver at the finer level. When the finest grid is reached, the equation solver is iterated until a tolerated solution is reached. The iterative multigrid equation solver is preconditioned by incomplete LU factorization with coupled node fill-in. The non-linear Navier–Stokes equations are linearized by both the Newton method and grid adaption. The efficiency and behaviour of the present adaptive method are compared with those of the previously developed iterative equation solver which is preconditioned by incomplete LU factorization with coupled node fill-in.     

广义对流扩散方程的隐式特征线混合元方法

提出了一个广义对流扩散方程的混合有限元方法,方程的基本变量及其空间梯度和流量在单 元内均作为独立变量分别插值. 基于胡海昌-Washizu三变量广义变分原理结合特征线法给 出了控制方程的单元弱形式. 混合元方法采用基于一点积分方案并结合可以滤掉虚假的 数值震荡的隐式特征线法. 数值结果证明了所提出的方法可以提供和四点积分同样的数 值计算结果,并能够提高计算效率.