捷联惯导系统圆锥补偿算法优化设计

高速、高速度的圆锥偿补算法是提高捷联惯性导航系统（ＳＩＮＳ）性能的重要环节。本文对Ｃｈａｎ Ｇｏｏｋ Ｐａｒｋ等提出的新圆锥补偿方法进行了进一步的研究。文中给出了经典圆锥运动的角速度模型,推导出了经典圆锥运动的角增量公式、角增量叉乘公式、圆锥补偿系数方程和误差公式,并将该方法拓展至利用前一圆锥补偿周期角增量和的圆锥补偿算法。     

A multi-variable non-singular BEM in 2D elasticity

A new BEM algorithm is proposed in the paper. This algorithm is based on the coincident collocation of the non-singular boundary integral equations (BIEs) of displacement and its derivatives, and the basic variables of the new BEM system equation are the boundary nodal displacements, tractions and displacement derivatives. Due to the non-singular character of the BIEs, all integrals in the algorithm can be evaluated by the Gaussian quadrature. Furthermore, the conforming element can be used for this algorithm as the displacement derivative can be considered independent of the displacement. Once the new BEM system equation is solved, the boundary stress can be evaluated immediately from the obtained displacement derivatives. Numerical examples show the validity of the algorithm.     

率相关本构方程积分新算法

提出一种积分率相关本构方程的隐式积分新算法,引入0～1范围内的缩放因子λ对本构方程进行间接求解,可以避免直接求解等效塑性应变或等效塑性应变率时,由于其数值过大或过小而造成的收敛困难或收敛失败,实现对率相关本构方程的快速准确求解.以B-P统一本构方程及双曲正弦本构方程为例,验证了算法的可行性.结果表明,新算法对于准静态变形条件下的无硬化本构方程也可以得出准确的解.     

基于黎曼几何的非线性振子动力学分析递推解析算法

基于黎曼几何和变分原理,推导了黎曼流形上非线性耗散动力系统的二阶微分动力学方程,并运用流形收缩的概念将动力学方程离散化,进而建立了相应的递推求解格式。选取3个自治非线性阻尼振子系统,分别采用递推解析算法和龙格库塔法求解微分动力学方程,并比较分析了不同的时间步长下两种算法的计算耗时。结果表明,与龙格库塔法相比,基于黎曼几何的递推算法不仅能得到每一时步的解析表达式,而且计算耗时短,计算效率高。基于黎曼流形的动力学方程递推算法为非线性动力学系统的解析求解提供了新思路。     

延性单晶非均匀变形的三维有限元模拟

对延性单晶在拉伸载荷作用下的应变局域化和颈缩等非均匀变形过程进行了三维有限元数值模拟。将相关晶体塑性本构模型及一种新的数值积分方法补充到ABAQUS6.1商用有限元软件中。该方法的特点是，利用晶体塑性的动力学方程，获得一个关于晶体弹性变形梯度的演化方程，采用半隐式积分方案进行求解。本文推导出一种新的应力变本构矩阵。按此方式更新本构矩阵，计算速度和计算稳定性大大提高。加载方式，边界条件和变形程度等因素影响着滑移系的启动状况，这是平面模型所不能预测的。本文利用三维有限元方法模拟了不同取向下滑移系的启动状况，全面地考虑了FCC单晶材料12个可能滑移系在变形过程中的启动状况，合理地模拟了FCC面心立方单晶沿不同取向加载时晶轴旋转导致的应变局域化和颈缩等非均匀变形过程。     

弹性力学混合状态方程的小波解法

应用小波理论求解弹性力学混合状态方程，讨论了解的收敛性。从文中的数值算例不难看出，该方法不失为混合状态方程一种新的求解途径。     

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

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

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.     

A modification of the artificial compressibility algorithm with improved convergence characteristics

The artificial compressibility algorithm has a significant drawback in the difficulty of choosing the artificial compressibility parameter, improper choice of which leads either to slow convergence or divergence. A simple modification of the equation for pressure in the artificial compressibility algorithm which removes the difficulty of choosing the artificial compressibility parameter is proposed. It is shown that the choice of the relaxation parameters for the new algorithm is relatively straightforward, and that the same values can be used to provide robust convergence for a range of application problems. This new algorithm is easily parallelized making it suitable for computations such as direct numerical simulation (DNS) which require the use of distributed memory machines. Two key benchmark problems are studied in evaluating the new algorithm: DNS of a fully developed turbulent channel flow, and DNS of a driven‐cavity flow, using both explicit and implicit time integration schemes. The new algorithm is also validated for a more complex flow configuration of turbulent flow over a backward‐facing step, and the computed results are shown to be in good agreement with experimental data and previous DNS work. Copyright © 2007 John Wiley & Sons, Ltd.     

考虑翘曲时任意截面梁的优化设计

首先以考虑翘曲的位移模式出发，导出了关于变位的控制微分方程和有限元刚度方程；然后通过引入新的坐标变换阵，得出了一般坐标系下关于梁两端任意点Ｐ．Ｑ的刚度矩阵；进而通过引入三种不同层次的变量，给出了数学模型与敏度分析方法。最后采用内切球法解之。将本文方法应用于某汽车主梁的优化设计，取得了合理的结果。     

类电磁机制算法研究与改进

针对原算法中初始种群不均匀、局部搜索随机性强及移动公式效率低等问题,提出了一种改进的类电磁机制算法。采用随机化均匀设计方法构造初始种群,将混沌搜索与试探性移动方法相结合进行局部搜索,运用改进后的公式计算粒子之间的合力,将遗传变异思想融入移动公式来更新粒子。实验结果表明,改进后的算法具有更好的收敛效果和更高的求解精度。     

四面体单元网格加密过程中的曲面逼近算法及程序实现

本文介绍了一种在四面体单元网格的加密过程中实现曲面逼近的算法．单元加密采用了最长边加密算法．曲面逼近实现了对二次曲面的逼近功能．当加密点所在边是边界面上的边时，将该点挪到对应的边界面上．挪动时根据该边所参与的两个边界三角形面的法向方向来确定加密点的挪动方向，再结合二次曲面方程来计算出挪动后点的新坐标．算例表明，对于由二次曲面边界围成的物体，这种算法能够有效地实现网格加密过程中的曲面边界逼近功能．     

开口薄壁杆件结构稳定分析的精确单元和两步求解算法

从控制微分方程的通解出发,构造受偏心压力作用开口薄壁杆件的精确形函数,建立用于开口薄壁杆件结构稳定性分析的精确有限元,得到了单元刚度矩阵和几何刚度矩阵的显式表达,提出了计算给定区间内各阶临界荷载以及相应失稳模态的两步计算方法。计算结果表明,与常规单元相比,采用精确单元无需进行网格细分就可以获得精确的数值结果,结合本文的两步求解算法,可以准确获得给定区间内全部临界荷载和失稳模态。     

A new numerical algorithm for viscoelastic fluid flows : The grid-by-grid inversion method

We present a new algorithm for solving viscoelastic flows with a general constitutive equation. In our approach the hyperbolic constitutive equation is split such that the term for the convective transport of stress tensor is treated as a source. This allows the stress tensor at each grid point to be expressed mainly in terms of the velocity gradient tensor at the same point. Then, the set of six stress tensor components is found after inverting a six by six matrix at each grid point. Thus we call this algorithm the grid-by-grid inversion method. The convective transport of stress tensor in the constitutive equation, which has been treated as a source, is updated iteratively. The present algorithm can be combined with finite volume method, finite element method or the spectral methods. To corroborate the accuracy and robustness of the present algorithm we consider viscoelastic flow past a cylinder placed at the center between two plates, which has served as a benchmark problem. Also considered is the investigation of the pattern and strength of the secondary flows in the viscoelastic flows through a rectangular pipe. It is found that the present method yields accurate results even for large relaxation times.     

双臂空间机器人关节空间的补偿学习控制

在载体位置与姿态均不受控制情况下,结合动量(矩)守恒关系对系统进行了运动学、动力学的分析,得到了漂浮基双臂空间机器人的系统动力学方程.采用PD控制的计算力矩法,得到了系统的闭环动态误差方程,在此基础上设计了针对不确定性的自由漂浮空间机器人的控制方案,提出了一种基于遗传算法的补偿学习控制方法.将补偿学习控制与计算力矩法相结合,利用遗传算法的进化学习消除不确定因素的影响,实现机器人轨迹跟踪的良好控制.     

一种基于面-面局部搜索的接触算法

接触-碰撞算法是影响动态接触问题数值分析精度的重要因素,发展健壮、精确的局部搜索算法对提高数值模拟精度具有重要意义。为解决点-面接触搜索算法存在的盲区问题,提出了一种基于面-面的局部搜索算法,并发展了相应的接触力计算方法。新的接触算法以面心坐标与特征长度表征接触片,进行预搜索快速排除不会发生接触的潜在接触对;利用主从接触片的投影与侵入深度关系确定接触片间的接触状态;利用等参逆变换解析给出接触点,避免了方程组的迭代求解。典型算例与工程实例计算表明,本文算法消除了接触搜索的盲区,具有很好的健壮性与计算精度。     

A comparative study of pressure correction and block-implicit finite volume algorithms on parallel computers

A comparison of a new parallel block-implicit method and the parallel pressure correction procedure for the solution of the incompressible Navier–Stokes equations is presented. The block-implicit algorithm is based on a pressure equation. The system of non-linear equation s is solved by Newton's method. For the solution of the linear algebraic systems the Bi-CGSTAB algorithm with incomplete lower–upper (ILU) decomposition of the matrix is applied. Domain decomposition serves as a strategy for the parallelization of the algorithms. Different algorithms for the parallel solution of the linear system of algebraic equations in conjunction with the pressure correction procedure are proposed. Three different flows are predicted with the parallel algorithms. Results and efficiency data of the block-implicit method are compared with the parallel version of the pressure correction algorithm. The block-implicit method is characterized by stable convergence behaviour, high numerical efficiency, insensitivity to relaxation parameters and high spatial accuracy. © 1997 John Wiley & Sons, Ltd.     

Investigation of use of reach-back characteristics method for 2D dispersion equation

The use of the Holly-Preissmann two-point scheme has been very popular for the calculation of the dispersion equation. The key to this scheme is to use the characteristics method incorporating the Hermite cubic interpolation technique to approximate the trajectory foot of the characteristics. This method can avoid the excessive numerical damping and oscillation associated with most finite difference schemes for advection computation. On the basis of the fundamental idea of the Holly-Preissmann two-point scheme, a new technique is introduced herein for the computation of the two-dimensional dispersion equation. This new scheme allows the characteristics projecting back several time steps to fall on the spatial or temporal axis, while the characteristics foot is still solved by the Holly-Preissmann two-point method. The diffusion portion of the dispersion equation is solved by the commonly used Crank-Nicholson method. The calculation for these two processes consisting of advection and diffusion is carried out separately but consecutively in one time step, a method known as the split operator algorithm. A hypothetical model was constructed to demonstrate the applicability of this new technique for the calculation of the pure advection and dispersion equation in two dimensions.     

Existence and algorithm of solutions for a system of generalized mixed implicit equilibrium problems in Banach spaces

A new system of generalized mixed implicit equilibrium problems is introduced and studied in Banach spaces. First, the notion of the Yosida proximal mapping for generalized mixed implicit equilibrium problems is introduced. By using the notion, a system of generalized equation problems is considered, and its equivalence with the system of generalized mixed implicit equilibrium problems is also proved. Next, by applying the system of generalized equation problems, we suggest and analyze an iterative algorithm to compute the approximate solutions of the system of generalized mixed implicit equilibrium problems. The strong convergence of the iterative sequences generated by the algorithm is proved under quite mild conditions. The results are new and unify and generalize some recent results in this field.     

Energy-Conserving Simulation of Incompressible Electro-Osmotic and Pressure-Driven Flow

A numerical model for electro-osmotic flow is described. The advecting velocity field is computed by solving the incompressible Navier–Stokes equation. The method uses a semi-implicit multigrid algorithm to compute the divergence-free velocity at each grid point. The finite differences are second-order accurate and centered in space; however, the traditional second-order compact finite differencing of the Poisson equation for the pressure field is shown not to conserve energy in the inviscid limit. We have designed a non-compact finite differencing for the Laplacian in the pressure equation that allows exact energy conservation and affords second-order accuracy. The model also incorporates a new numerical method for passive scalar advection, called parcel advection, which accurately predicts the evolution of a passively traveling scalar pulse without requiring the addition of any artificial diffusion. The algorithm is used to confirm the experimentally observed asymmetric concentration profile that arises when an external pressure drop is imposed on electro-osmotic flow. Received 25 January 2001 and accepted 10 May 2002 Published online 30 October 2002 Communicated by H.J.S. Fernando