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

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

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

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

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

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

车桥耦合振动迭代求解数值稳定性问题

本文首先建立简化的等效弹簧振子模型进行车桥耦合振动迭代求解稳定性理论分析,然后将分析结论推广到复杂车桥系统进行验证.论文揭示了迭代不收敛的机理,再现了分离迭代发散的现象,提出了解决或者改善迭代稳定性的方法.研究表明迭代计算稳定性主要由所采用的轮轨接触假设决定,轮轨密贴接触假设是迭代不收敛的主要根源,而采用轮轨非密贴接触假设基本不会导致迭代不收敛.若采用轮轨密贴接触假设,在足够小的积分步长下,轮对质量与轮轨接触处桥梁单元的节点集中质量之比是影响迭代稳定性的关键因素,而桥梁和车辆系统的刚度、阻尼是影响迭代稳定性的次要因素.可采取如下方法改善迭代稳定性:忽略轮对惯性力对桥梁的作用,采用迭代加速技术,选用较大的时间积分步长等.     

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

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

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

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

弹性地基上圆板在轴对称载荷作用下的迭代解

提出了弹性地基上圆板承受轴对称载荷作用弯曲问题的一种新的解法－迭代法。文中导出了迭代过程的一般公式，并给出了关于收敛性的一般说明。未方法简单可靠，能收敛于精确解，可直接计算弹性地基圆板在轴对称载荷作用下的弯曲问题。文后给出算例，只二次迭代即得到了满意的结果。     

Z2—对称破缺音叉分歧点的分裂迭代算法

Ｗｒｒｎｅｒ和Ｓｐｅｎｃｅ在（５）中提出了一个正则的扩张系统，用以计算Ｚ２－对称破缺音叉分歧点。这种方法即是直接法。本文将用另一种方法－－分列迭代算法来计算Ｚ２－对称破缺音叉分歧点，分裂迭代算法超线性收敛，并明显地节约计算的工作量和计算所占用的内存。数值例子的计算成功地说明分裂迭代算法的有效笥。     

一类加权全局迭代参数卡尔曼滤波算法

结合参数卡尔曼滤波算法和全局迭代推广卡尔曼滤波算法本文提出了加权全局迭代参数卡尔曼滤波算法。参数卡尔曼滤波算法可避免系统参数和状态变量之间的非线性耦合 ,同时通过带有目标函数的全局迭代算法保证能够获取到稳定、收敛的识别结果。分别针对线性结构模型和随动强化双线性结构模型进行了仿真参数识别。结果显示 ,不加权的全局迭代参数卡尔曼滤波算法对线性系统是有效的 ,而对非线性系统必须使用加权的全局迭代参数卡尔曼滤波算法。当信噪比较大 ,迭代无法得到收敛的结果时 ,目标函数保证了较好识别结果的获得     

分步迭代加权残值法

本文提出一种分步迭代的加权残值方法,并从理论上证明了分步迭代的最小二乘法用于求解线性问题时的收敛性。文中应用所提出的方法计算了方形固支板的位移,方形杆的扭转刚度及柔性圆板的大挠度位移和应力。结果表明了文中的方法可逐步提高计算精度。     

Iteration schemes for rapid post‐stall aerodynamic prediction of wings using a decambering approach

Nonlinear aerodynamics of wings may be evaluated using an iterative decambering approach. In this approach, the effect of flow separation due to stall at any wing section is modeled as an effective reduction in section camber. The approach uses a wing analysis method for potential‐flow calculations and viscous airfoil lift curves for the sections as input. The calculation procedure is implemented using a Newton–Raphson iteration to simultaneously satisfy the boundary condition, which comes from potential‐flow wing theory, and drive the sectional operating points toward their respective viscous lift curves, as required for convergence. Of particular interest in this research is the calculation of the residuals during the Newton iteration. Unlike a typical implementation of the Newton iteration, the residual calculation is not performed via a straightforward function evaluation, but rather by estimating the target operating points on the input viscous lift curves. Estimation of these target operating points depends on the assumptions made in the cross‐coupling of the decambering at the different sections. This paper presents four residual calculation schemes for the decambering approach. The residual calculation schemes are compared against each other to assess computational speed and robustness. Decambering results are also compared with higher‐order computational fluid dynamics (CFD) solutions for rectangular and swept wings. Results from the best scheme compare well with the CFD solutions for the rectangular wing, motivating further development of the method. Poor predictions for the swept wings are traced to spanwise propagation of separated flow at stall, highlighting the limitations of the current approach. Copyright © 2014 John Wiley & Sons, Ltd.     

New conditions of stability and convergence of Stokes and Newton iterations for Navier-Stokes equations

This paper considers Stokes and Newton iterations to solve stationary Navier- Stokes equations based on the finite element discretization. We obtain new sufficient conditions of stability and convergence for the two iterations. Specifically, when 0 < σ = (N‖f‖-1)/v² ≤ 1/($\sqrt{2}$+1), the Stokes iteration is stable and convergent, where N is defined in the paper. When 0 < σ ≤ 5/11, the Newton iteration is stable and convergent. This work gives a more accurate admissible range of data for stability and convergence of the two schemes, which improves the previous results. A numerical test is given to verify the theory.     

非常应变模式数字相关方法的初值估计

本文给出了基于高精度非常应变子区位移模式数字相关方法的Newton-Raphson迭代法求解的新通用公式,对相关迭代算法中的初值估计问题进行了研究,提出两种初值估计方法：（1）利用“实时相减”和“精密调节”相结合的方法而获得零初值;（2）快速迭代初值估计方法,从而有效地解决了Newton-Raphson迭代算法中的初值估计问题,并提高了迭代的收敛速度。     

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.     

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

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

Kantorovich theorem for variational inequalities

Kantorovich theorem was extended to variational inequalities by which the convergence of Newton iteration, the existence and uniqueness of the solution of the problem can be tested via computational conditions at the initial point.     

Stability of convective flows in cavities: solution of benchmark problems by a low‐order finite volume method

A problem of stability of steady convective flows in rectangular cavities is revisited and studied by a second‐order finite volume method. The study is motivated by further applications of the finite volume‐based stability solver to more complicated applied problems, which needs an estimate of convergence of critical parameters. It is shown that for low‐order methods the quantitatively correct stability results for the problems considered can be obtained only on grids having more than 100 nodes in the shortest direction, and that the results of calculations using uniform grids can be significantly improved by the Richardson's extrapolation. It is shown also that grid stretching can significantly improve the convergence, however sometimes can lead to its slowdown. It is argued that due to the sparseness of the Jacobian matrix and its large dimension it can be effective to combine Arnoldi iteration with direct sparse solvers instead of traditional Krylov‐subspace‐based iteration techniques. The same replacement in the Newton steady‐state solver also yields a robust numerical process, however, it cannot be as effective as modern preconditioned Krylov‐subspace‐based iterative solvers. Copyright © 2006 John Wiley & Sons, Ltd.