结构性软土弹塑性模型的隐式算法实现

对于考虑软土结构性的高度非线性弹塑性本构模型,在采用Newton-CPPM隐式算法对模型进行数值实现的过程中容易出现Jacobian矩阵奇异和不收敛问题.为此,本文提出了两种改进隐式算法.考虑到Newton-CPPM隐式算法是局部收敛性算法,因此引入大范围收敛的同伦延拓算法对Newton-CPPM算法的迭代初值进行改进,形成了同伦–Newton-CPPM算法.考虑到Newton-CPPM隐式算法单个迭代步的计算量过大,因此借鉴显式算法的思想提出一种两阶段迭代算法,第一阶段先求出一致性参数,第二阶段采用类似于显示算法的方法进行回代得出状态变量的值.然后,以考虑软土结构性的SANICLAY模型为例,从弹塑性本构模型的组成和算法的特点两个角度分析了引起Jacobian矩阵奇异和不收敛问题的原因,并且在单单元计算的基础上,对全显式算法、传统隐式算法和两种改进隐式算法在计算收敛性、计算精度和计算效率方面进行了对比.最后,将同伦–Newton-CPPM算法和传统隐式算法用于地基承载力多单元计算中,结果表明该算法能够有效地解决Jacobian矩阵奇异和不收敛问题.     

推进－迭代算法计算效率的研究

本文对求解三维定常超音速动性流场的一次空间推进，在每一个推进站沿伪时间层局部迭代的推进－迭代算法作了进一步的研究．在每一推进站（侧向平面）沿伪时间层局部迭代时，给出了四种不同的隐式迭代方法，即沿侧面两个方向（法向和周向）全用隐式；法向隐式而周向采用Ｇａｕｓｓ－Ｓｉｌｄｌｅ来回扫描迭代；法向隐式而周向显式及以系数矩阵谱半径代替系数矩阵的简化标量隐式算法．用这四种算法模拟了三维球锥黏性绕流，给出了四种不同算法的计算效率和收敛特性比较．     

高阶谱元区域分解算法求解定常方腔驱动流

主要利用Jacobian-free的Newton-Krylov方法求解定常不可压缩Navier-Stokes方程,将基于高阶谱元法的区域分解Stokes算法的非定常时间推进步作为Newton迭代的预处理,回避了传统Newton方法Jacobian矩阵的显式装配,节省了程序内存,同时降低了Newton迭代线性系统的条件数,且没有非线性对流项的隐式求解,大大加快了收敛速度。对有分析解的Kovasznay流动的计算结果表明,本高阶谱元法在空间上有指数收敛的谱精度,且对定常解的Newton迭代是二次收敛的。本文模拟了二维方腔顶盖一致速度驱动流,同基准解符合得很好,表明本文方法是准确可靠的。本文还考虑了Re=800时方腔顶盖正弦速度驱动流,除得到已知的一个稳定对称解和一对稳定非对称解外,还获得了一对新的不稳定的非对称解。     

具有奇异位置的多体系统动力学方程的隐式算法

本文研究了在运动过程中具有奇异位置的多体系统动力学方程的隐式算法，给出了隐式算法所用的Ｊａｃｏｂｉ矩阵，并建立了该矩阵中各子矩阵间的计算关系，提高了计算效率，计算结果表明隐式算法的计算速度和精度明显优于显式算法。     

黏弹-Perzyna黏塑性有限元法应力更新隐式算法

黏弹-黏塑性耦合模型的黏弹性部分由弹簧、黏壶和Kelvin链串联而成,黏塑性部分为双曲线型DruckerPrager屈服函数、各向同性硬化和Perzyna黏塑性流动模型。基于黏弹性蠕变柔度,通过定义与弹性问题相对应的与时间增量相关的黏弹性剪切模量和体积模量,导出增量递推形式的本构方程。为保证算法的收敛和稳定性,把Perzyna黏塑性流动方程转化为与弹塑性相似的一致性条件,建立黏塑性增量因子单侧逼近其收敛值的N-R迭代算法。最后,给出应力更新完全隐式算法和最终计算公式。分别采用黏弹性、黏弹-塑性和黏弹-黏塑性本构关系对一地基蠕变模型进行三维有限元分析和比较,结果表明,本文算法具有较高的计算效率和稳定性。     

非饱和多孔介质非线性有限元分析的一致性算法

在文[1]工作的基础上，对非饱和多孔材料非线性问题进行分析，给出分析的本构模型，模型中考虑了毛吸压力的影响。给出问题分析的求解技术与算法策略，在此基础上，为保证迭代算法的收敛性，文中给出适合于广义塑性本构模型分析的一致性算法与一致性切线刚度矩阵。给出的数值算例证实了理论与算法的正确与有效性。     

考虑弹簧阻尼作动器解析雅可比矩阵的多刚体动力学分析

弹簧-阻尼-作动器(spring-damper-actuator,SDA)是多体系统中常见的力元,在工程领域中有着广泛的应用.采用绝对坐标方法建立的多体系统动力学控制方程通常是复杂的非线性微分-代数方程组.为了保证数值解的精度和稳定性,通常需要采用隐式算法求解动力学方程,而雅可比矩阵的计算在隐式数值求解过程中至关重要.对于含有SDA的多体系统,SDA造成的附加雅可比矩阵是与广义坐标和广义速度相关的高度非线性函数.目前的很多研究工作专注于广义力向量的计算,然而对附加雅克比矩阵的计算则少有关注.针对含SDA的多刚体系统进行动力学分析,首先基于Newmark算法研究其在动力学方程求解中的雅可比矩阵的构成形式;然后推导SDA的广义力向量对应的附加雅可比矩阵,其中包括广义力向量对广义坐标和对广义速度的偏导数矩阵.最后通过两个数值算例研究附加雅可比矩阵对动力学分析收敛性的影响;数值分析表明:当SDA的刚度、阻尼和作动力数值较大时,SDA导致的附加雅可比矩阵对数值解的收敛性有重要影响;当考虑SDA对应的附加雅可比矩阵时,动力学分析可以以较少的迭代步实现收敛,从而减少分析时间.     

推进－迭代算法计算效率的研究

本文对求解三维定常超音速动性流场的一次空间推进，在每一个推进站沿伪时间层局部迭代的推进－迭代算法作了进一步的研究．在每一推进站（侧向平面）沿伪时间层局部迭代时，给出了四种不同的隐式迭代方法，即沿侧面两个方向（法向和周向）全用隐式；法向隐式而周向采用Ｇａｕｓｓ－Ｓｉｌｄｌｅ来回扫描迭代；法向隐式而周向显式及以系数矩阵谱半径代替系数矩阵的简化标量隐式算法．用这四种算法模拟了三维球锥黏性绕流，给出了四种不同算法的计算效率和收敛特性比较．     

弹塑性问题参数二次规划分析的隐式算法

传统的二次规划算法求解弹塑性问题时一般要经过对问题的线性化,如对屈服条件的一阶近似展开等,这在一定程度上会造成数值解的误差。为此,本文提出一种改进的策略,引入迭代与规划算法相结合的技术对问题进行处理,算法收敛平稳迅速,在大步长荷载增量下使算法的精度大大提高。由于本文的算法属于隐式算法,因而也就弥补了原二次规划算法求解弹塑性问题时只有显式算法的不足,从而达到了对原算法的进一步完善。     

牛顿迭代一致性算法及其在板弹塑性有限元分析中的应用

本文简略讨论了有限载荷增量弹塑性有限元分析中传统切线刚度法丧失精度和牛顿迭代平方收敛速度的原因,并提出保持牛顿迭代平方收敛速度、保证一阶精度和无条件稳定性的一致性算法.一致性算法具备以下两个特征:1)采用路径无关计算格式;2)采用一致弹塑性切线模量。根据一致性算法构造出以弯矩和曲率为基本变量的弹塑性板弯曲有限元NIDKQ元。数值结果表明NIDKQ元具有令人满意的精度,同时验证了有限载荷增量下牛顿迭代一致性算法的平方收敛率特性,而传统切线刚度法随着塑性区的扩展将大大降低收敛速度。     

带约束多体系统动力学方程的隐式算法

研究了带约束多体系统隐式算法,用子矩阵的形式推导出了多体系统正则方程的Ｊａｃｏｂｉ矩阵,它适用于多种隐式算法并给出了隐式Ｒｕｎｇｅ－Ｋｕｔｔａ算法,最后用一算例表明了隐式算法的计算效率和精度明显优于算法。     

改进的速度迭代弹塑性大变形动力半显式算法

提出了基于速度迭代的弹塑性大变形动力半显式算法，并且在此基础上采用拟弯曲膜单元，结合有模卸载方式数值模拟了U形弯曲以及S形导轨回弹过程，着重比较了动力半显式算法与动力显式算法和实验的回弹结果．给出了动力半显式算法的迭代格式和收敛标准．     

A nonlinear finite element model for the stress analysis of soft solids with a growing mass

The paper presents a new finite element (FE) model for the stress analysis of soft solids with a growing mass based on the work of Lubarda and Hoger (2002). Contrary to the traditional numerical methods emphasizing on the influence of growth on constitutive equations, an equivalent body force is firstly detected, which is resulted from the linearization of the nonlinear equation and acts as the driver for material growth in the numerical aspect. In the algorithm, only minor correction on the traditional tangent modulus is needed to take the growth effects into consideration and its objectivity could be guaranteed comparing with the traditional method. To solve the resulted equation in time domain, both explicit and implicit integration algorithms are developed, where the growth tensor is updated as an internal variable of Gauss point. The explicit updating scheme shows higher efficiency, while the implicit one seems to be more robust and accurate. The algorithm validation and its good performance are demonstrated by several two-dimensional examples, including free growth, constrained growth and stress dependent growth.     

树形多体系统动力学的隐式数值算法

研究了树形多体系统动力学的隐式算法．用矩阵形式给出了多体系统的正则方程及其右端函数的Ｊａｃｏｂｉ矩阵，并给出该矩阵的分块算法和对角隐式Ｒｕｎｇｅ－Ｋｕｔａ法（ＤＩＲＫＭ）以及隐式辛Ｒｕｎｇｅ－Ｋｕｔａ法（ＩＳＲＫＭ）．该算法便于编程计算，能提高计算效率，保持长期计算的稳定性．并用算例说明该算法的有效性     

An improved SIP scheme for numerical solutions of transonic streamfunction equations

A new improved strongly implicit procedure (SIP) is presented for solving large sets of transonic streamfunction equations with matrix of coefficients [ B ]. This algorithm has several advantages over those now in use. First, Stone's auxiliary matrix [ B ′] is non-symmetric, while in the present scheme the auxiliary matrix [ B ′] is symmetric and the matrix [ B + B ′] is positive definite and symmetric when [ B ] is a symmetric matrix. This ensures the numerical stability of the iterative algorithms. Secondly, for an appropriate choice of iterative parameter ω, the rate of convergence of the new iterative procedure should be faster than the original SIP scheme. Numerical results of the blade-to-blade flows are given with the present scheme. It is shown that the algorithm is efficient and robust.     

Fully coupled finite volume solutions of the incompressible Navier–Stokes and energy equations using an inexact Newton method

An inexact Newton method is used to solve the steady, incompressible Navier–Stokes and energy equation. Finite volume differencing is employed on a staggered grid using the power law scheme of Patankar. Natural convection in an enclosed cavity is studied as the model problem. Two conjugate-gradient -like algorithms based upon the Lanczos biorthogonalization procedure are used to solve the linear systems arising on each Newton iteration. The first conjugate-gradient-like algorithm is the transpose-free quasi-minimal residual algorithm (TFQMR) and the second is the conjugate gradients squared algorithm (CGS). Incomplete lower-upper (ILU) factorization of the Jacobian matrix is used as a right preconditioner. The performance of the Newton- TFQMR algorithm is studied with regard to different choices for the TFQMR convergence criteria and the amount of fill-in allowed in the ILU factorization. Performance data are compared with results using the Newton-CGS algorithm and previous results using LINPACK banded Gaussian elimination (direct-Newton). The inexact Newton algorithms were found to be CPU competetive with the direct-Newton algorithm for the model problem considered. Among the inexact Newton algorithms, Newton-CGS outperformed Newton- TFQMR with regard to CPU time but was less robust because of the sometimes erratic CGS convergence behaviour.     

Implicit high-order discontinuous Galerkin method with HWENO type limiters for steady viscous flow simulations

Two types of implicit algorithms have been improved for high order discontinuous Galerkin (DG) method to solve compressible Navier-Stokes (NS) equations on triangular grids. A block lower-upper symmetric Gauss-Seidel (BLU-SGS) approach is implemented as a nonlinear iterative scheme. And a modified LU-SGS (LLU-SGS) approach is suggested to reduce the memory requirements while retain the good convergence performance of the original LU-SGS approach. Both implicit schemes have the significant advantage that only the diagonal block matrix is stored. The resulting implicit high-order DG methods are applied, in combination with Hermite weighted essentially non-oscillatory (HWENO) limiters, to solve viscous flow problems. Numerical results demonstrate that the present implicit methods are able to achieve significant efficiency improvements over explicit counterparts and for viscous flows with shocks, and the HWENO limiters can be used to achieve the desired essentially non-oscillatory shock transition and the designed high-order accuracy simultaneously.     

g-η-Monotone mapping and resolvent operator technique for solving generalized implicit variational-like inclusions

A new class of g-η-monotone mappings and a class of generalized implicit variational-like inclusions involving g-η-monotone mappings are introduced. The resolvent operator of g-η-monotone mappings is defined and its Lipschitz continuity is presented.An iterative algorithm for approximating the solutions of generalized implicit variationallike inclusions is suggested and analyzed. The convergence of iterative sequences generated by the algorithm is also proved.