黏性不可压流体的自适应网格技术和基本特性方程分离算法的联合分析

组合基本特性方程分离算法和自适应网格技术,分析二维黏性不可压流体.该方法使用3节点三角单元,对速度分量和压力等变量分析,使用等阶次的插值函数.组合解法的主要优点在于,在自适应网格技术中,对解梯度变化大的区域,通过耦合误差估计生成小的单元,利于提高解的精度,在其它区域生成大单元,可以节省时间.最后,通过对一个黏性流体圆柱体绕流问题的瞬态和稳态特性分析,给出了组合解法性能的评价.     

对流扩散方程带罚函数项的有限体积格式及其分析

1引言 有限体积方法[l]一l’]作为守恒型的离散技术，被广泛应用于工程计算领域.文【2，3} 基于分片常数和分片常向量函数空间，对二维驻定对流扩散方程提出了一类非协调混合 有限体积(Covolume)格式，证明了格式具有。(hl/2)收敛精度.但该格式要求对偶剖分 比较规则，即采用重     

求解二维浅水方程的一种高分辨率有限体积法

本文将一种van Albada型可微的限制器函数引入到二维浅水方程的求解中，发展了一种求解二维浅水方程的有限体积法．数值实验结果表明，该方法不仅计算精度高，而且较其它求解二维浅水方程的高精度有限体积法，在数值解的收敛性能方面大有改善．     

随机结构系统基于可靠性的优化设计

提出了以梁板（薄板）为基体的随机结构系统（即结构元件的面积、长度、弹性模量和强度等均为随机变量）在随机载荷作用下,基于可靠性的优化设计方法．给出了随机结构系统安全余量和系统可靠性指标的敏度表达式;给出最佳矢量型算法．首先是用改进的一次二阶矩和随机有限元法求出安全余量的可靠性指标的表达式,然后用概率网络估算(PNET)法求出系统失效概率的公式,对该式两边求导得出了系统可靠性指标的敏度表达式,进而用最佳矢量型算法进行优化设计．在优化迭代过程中,采用梯度步和最佳矢量步相结合的方法进行计算．最后给出了一个算例,说明该方法计算效率高,收敛稳定,适合工程应用．     

投影型插值算子的超收敛性质及其应用

本文首先将证明矩形剖分单元上的Ｌｏｂａｔｔｏ点,Ｇａｕｓｓ点和拟Ｌｏｂａｔｔｏ点分别是二维投影型插值算子函数,梯度和二阶导数的逼近佳点;然后考虑了二阶椭圆边值问题的有限元近似．通过建立投影型插值算子各种形式的超收敛基本估计,证明了投影型插值算子的各类...     

基于正弦控制因子的Lateral变异鲨鱼优化算法

针对传统鲨鱼优化算法在求解高维目标函数时,易早熟收敛,陷入局部最优的缺陷.提出一种基于正弦控制因子的Lateral变异鲨鱼优化算法.通过正弦曲线的特性和自适应惯性权重,改善了传统鲨鱼优化算法中由于随机选取控制因子数值大小可能导致算法在迭代后期全局搜索能力降低的问题,提高了算法在迭代后期的全局收敛能力,并对最佳鲨鱼位置引入Lateral变异策略,加强了算法跳出局部最优的可能性.改进后的算法对多个shifted单峰,多峰以及固定维测试函数进行求解,实验结果表明,对比多种不同优化算法而言,本文所提LSSO算法具有更高的收敛精度和搜索速度.     

基于信赖域技术的非单调超记忆梯度算法

基于信赖域技术和修正拟牛顿方程,结合Zhang H.C.非单调策略,设计了新的求解无约束最优化问题的非单调超记忆梯度算法,分析了算法的收敛性和收敛速度.数值实验表明算法是有效的,适于求解大规模问题.     

变维数自适应神经模糊推理策略及财务诊断应用

提出一种基于主成分分析的变维数策略,用以克服自适应神经模糊推理系统(ANFIS)难以适应数据多维数情况的缺陷。然后结合企业财务分析领域的特点,将优化的自适应神经模糊推理系统应用于公司财务状况诊断。最后,利用样本公司实际指标数据对模型的诊断能力进行了实证研究,结果显示了这种方法的优越性。     

基于自适应权重的函数型数据聚类方法研究

基于有限维离散数据的传统聚类分析并不能直接用于函数型数据的分类挖掘。本文针对函数型数据的稀疏性和无穷维特殊性展开讨论,在综合剖析现有函数型聚类方法优势与不足的基础上,依据聚类指标的信息量差异重构加权主成分距离为函数相似性测度,提出了一种函数型数据的自适应权重聚类分析。相对同类函数型聚类算法,新方法的核心优势在于:(1)自适应赋权的距离函数体现了聚类指标分类效率的差异,并且有充分的理论基础保证其必要性和客观合理性;(2)基于有限维离散数据的聚类实现了无限维连续函数的聚类,能够显著降低计算成本。实证检验表明,新方法的分类正确率明显提高,能够有效解决传统聚类算法极端情形下的失效问题,有着复杂函数型数据分类问题下的灵活性和普遍适用性。     

计算流体力学在大型风力机空气动力学的应用进展北大核心CSCD

针对大型风力机设计中的关键空气动力学问题,比较系统地介绍了计算流体力学(computational fluid dynamics,CFD)方法的主要应用,特别是在大型风力机翼型气动分析、风力机流动的数值模拟、风轮空气动力特性的数值计算以及大型风力机叶片的多目标气动优化设计方面的进展.基于CFD方法分别实现了风力机翼型与叶片二维/三维气动特性的准确预测,风力机尾流场涡系结构的准确捕捉;并结合多目标遗传算法对1.5 MW风力机叶片进行了优化,获得了具有高风能利用效率的叶片方案.     

Local Multigrid in H（curl）

We consider H（curl, Ω）-elliptic variational problems on bounded Lipschitz polyhedra and their finite element Galerkin discretization by means of lowest order edge elements. We assume that the underlying tetrahedral mesh has been created by successive local mesh refinement, either by local uniform refinement with hanging nodes or bisection refinement. In this setting we develop a convergence theory for the the so-called local multigrid correction scheme with hybrid smoothing. We establish that its convergence rate is uniform with respect to the number of refinement steps. The proof relies on corresponding results for local multigrid in a H^1 （Ω）-context along with local discrete Helmholtz-type decompositions of the edge element space.     

An adaptive NS/ES-FEM approach for 2D contact problems using triangular elements

An adaptive contact analysis approach is presented for 2D solid mechanics problems using only triangular elements and the subdomain parametric variational principle (SPVP). The present approach is implemented for the node-based smoothed FEM (or NS-FEM), the edge-based smoothed FEM (ES-FEM) and the standard FEM models with automatically adaptive refinement scheme. A modified Coulomb frictional contact model and its corresponding discrete equations are introduced. The global discretized system equations are then formulated in an incremental form with the aid of the basic boundary value equations for friction contact and the subdomain parametric variational principle. A simple adaptive refining scheme is presented, and the Voronoi vertices are taken as candidate points to become new nodes because of duality property between the Voronoi diagrams and Delaunay triangulation. The present adaptive approach can properly simulate variable behaviors of a contact interface such as bonding/debonding, contacting/departing, and sticking/slipping. Several examples are presented to numerically validate the proposed approach via the comparison with reference solutions obtained by ABAQUS^®, and to investigate the effects of the various parameters used in the computations on the response of the contact system. The numerical results have demonstrated that the present adaptive contact analysis approach using the ES-FEM has higher accuracy and convergence rate in the strain energy than that using FEM and NS-FEM. However, the latter two methods can provide the lower and upper bound solution for the system strain energy, respectively.     

Adaptive meshless Galerkin boundary node methods for hypersingular integral equations

Adaptive refinement techniques are developed in this paper for the meshless Galerkin boundary node method for hypersingular boundary integral equations. Two types of error estimators are derived. One is a perturbation error estimator that is formulated based on the difference between numerical solutions obtained using two consecutive nodal arrangements. The other is a projection error estimator that is formulated based on the difference between the numerical solution itself and its projection. These error estimators are proven to have an upper and a lower bound by the constant multiples of the exact error in the energy norm. A localization scheme is presented to accomodate the non-local property of hypersingular integral operators for the needed computable local error indicators. The convergence of the adaptive meshless techniques is verified theoretically. To confirm the theoretical results and to show the efficiency of the adaptive techniques, numerical examples in 2D and 3D with high singularities are provided.     

基于非结构自适应网格的复合有限体积法

利用文献[1]中将Lax-Wendroff格式和Lax-Friedrichs格式整体复合作用构成二维无结构网格上的复合型有限体积法,同时利用Delaunay方法,根据流场流动特性变化的梯度值为指示器对网格进行加密和粗化,实现自适应,并将此方法应用到二维浅水波方程的求解上,进行了二维部分溃坝,倾斜水跃的数值实验.结果表明,该方法是一个计算稳定、能适应复杂的求解域、能很好地捕捉激波、且计算速度快的算法.     

基于耦合纯无网格方法时间分数阶下孤立子波碰撞过程的数值模拟研究北大核心CSCD

为数值预测时间分数阶耦合非线性Schrödinger(TF-CNLS)方程描述的孤立子波非弹性碰撞过程,首次发展了一种耦合纯无网格有限点集法(coupled finite pointset method,CFPM).其构造过程为:1)对时间分数阶Caputo导数项采用一种高精度的差分格式;2)对空间导数采用基于Taylor展开和加权最小二乘法的有限粒子法(FPM)离散格式;3)对区域进行局部加密和采用稳定性好的双曲余弦核函数以提高数值精度.数值研究中,首先,运用CFPM对有解析解的一维TF-CNLS方程进行求解,分析了节点均匀分布或局部加密情况下的误差和收敛阶,表明给出的耦合无网格法具有近似二阶精度和易局部加密求解的灵活性;其次,运用CFPM对无解析解一维TF-CNLS方程描述的孤立子波非弹性碰撞过程进行了数值预测,其出现的波塌缩现象与整数阶下出现的多波现象截然不同;最后,与有限差分结果作对比,表明CFPM数值预测时间分数阶下孤立子波非弹性碰撞过程的复杂传播现象是可靠的.     

On the Convergence of Adaptive Finite Element Methods

State of the art simulations in computational mechanics aim reliability and efficiency via adaptive finite element methods (AFEMs) with a posteriori error control. The a priori convergence of finite element methods is justified by the density property of the sequence of finite element spaces which essentially assumes a quasi‐uniform mesh‐refining. The advantage is guaranteed convergence for a large class of data and solutions; the disadvantage is a global mesh refinement everywhere accompanied by large computational costs. AFEMs automatically refine exclusively wherever the refinement indication suggests to do so and so violate the density property on purpose. Then, the a priori convergence of AFEMs is not guaranteed automatically and, in fact, crucially depends on algorithmic details. The advantage of AFEMs is a more effective mesh accompanied by smaller computational costs in many practical examples; the disadvantage is that the desirable error reduction property is not always guaranteed a priori. Efficient error estimators can justify a numerical approximation a posteriori and so achieve reliability. But it is not clear from the start that the adaptive mesh‐refinement will generate an accurate solution at all. This paper discusses particular versions of an AFEMs and their analyses for error reduction, energy reduction, and convergence results for linear and nonlinear problems. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Convergence of the Swartztrauber-Sweet Method for Parabolic Problems on a Disk with Singularities

In this article, we study the convergence analysis for the initial and boundary value problem of parabolic equations on a disk with singular solutions. It is assumed that the exact solution performs singular properties that its derivatives go to infinity at the boundary of the disk. We propose a fully implicit time-stepping numerical scheme. A stretching polynomial-like function with a parameter is used to construct a local grid refinement. Over the nonuniform partition, we combine the Swartztrauber-Sweet scheme and the backward Euler method in spatial and temporal discretization, respectively. We carry out convergence analysis and analyze the effects of the parameter. It is shown that our numerical scheme is of first order accuracy for temporal discretization and of almost second order accuracy for spatial discretization. Numerical experiments are performed to illustrate our analysis results and show that there exists an optimal value for the parameter to obtain a best approximate solution.     

A decomposition scheme for acoustic obstacle scattering in a multilayered medium

We consider the acoustic wave scattering by an impenetrable obstacle embedded in a multilayered background medium, which is modelled by a linear system constituted by the Helmholtz equations with different wave numbers and the transmission conditions across the interfaces. The aim of this article is to construct an efficient computing scheme for the scattered waves for this complex scattering process, with a rigorous mathematical analysis. First, we construct a set of functions by a series of coupled transmission problems, which are proven to be well-defined. Then, the solution to our complex scattering in each layer is decomposed as the summation in terms of these functions, which are essentially the contributions from two interfaces enclosing this layer. These contributions physically correspond to the scattered fields for simple scattering problems, which do not involve the multiple scattering and are coupled via the boundary conditions. Finally, we propose an iteration scheme to compute the wave field in each layer decoupling the multiple scattering effects, with the advantage that only the solvers for the well-known transmission problems and an obstacle scattering problem in a homogeneous background medium are applied. The convergence property of this iteration scheme is proven.     

An efficient adaptive analysis procedure for node-based smoothed point interpolation method (NS-PIM)

This paper presents an efficient adaptive analysis procedure being able to operate in the framework of the node-based smoothed point interpolation method (NS-PIM). The NS-PIM uses three-node triangular cells and is very easy to be implemented, which make it an ideal candidate for adaptive analysis. In the present adaptive procedure, a new error indicator is devised for NS-PIM settings; two ways are proposed to calculate the local critical value; a simple h-type local refinement scheme is adopted and Delaunay technology is used for regenerating optimal new mesh. A number of typical numerical examples involving stress concentration and solution singularities have been tested. The results demonstrate that the present procedure achieves much higher convergence rate results compared to the uniform refinement, and can obtain upper bound solution in strain energy.     

The Trefftz method using fundamental solutions for biharmonic equations

In this paper, the Trefftz method of fundamental solution (FS), called the method of fundamental solution (MFS), is used for biharmonic equations. The bounds of errors are derived for the MFS with Almansi’s fundamental solutions (denoted as the MAFS) in bounded simply connected domains. The exponential and polynomial convergence rates are obtained from highly and finitely smooth solutions, respectively. The stability analysis of the MAFS is also made for circular domains. Numerical experiments are carried out for both smooth and singularity problems. The numerical results coincide with the theoretical analysis made. When the particular solutions satisfying the biharmonic equation can be found, the method of particular solutions (MPS) is always superior to the MFS and the MAFS, based on numerical examples. However, if such singular particular solutions near the singular points do not exist, the local refinement of collocation nodes and the greedy adaptive techniques can be used for seeking better source points. Based on the computed results, the MFS using the greedy adaptive techniques may provide more accurate solutions for singularity problems. Moreover, the numerical solutions by the MAFS with Almansi’s FS are slightly better in accuracy and stability than those by the traditional MFS. Hence, the MAFS with the AFS is recommended for biharmonic equations due to its simplicity.