椭圆特征值问题的局部径向基函数差分法（英）

本文介绍椭圆特征值问题的局部径向基函数差分法．这种方法的主要思想是人为选取各插值节点所对应的影响区域，只考虑影响区域内插值点对该插值节点的影响，忽略影响区域外插值点的影响．这种局部化方法在损失一定计算精度的同时离散得到稀疏矩阵，从而使算法能应用于计算大规模插值节点科学计算．通过数值实验，研究了节点分部，插值点数以及形状参数对该特征值问题计算结果的影响，并选用三种径向基函数进行计算比较．数值结果和解析解非常吻合．     

求解二维Navier-Stokes方程的移动网格方法

为了减少解在较小的局部区域内有着很强的奇异性、剧烈变化等的偏微分方程求解问题的计算量,提出了一种基于方程求解的移动网格方法,并将其应用于二维不可压缩Navier-Stokes方程的求解．与已有的大部分移动网格方法不同,网格节点的移动距离是通过求解一个变系数扩散方程得到的,避免了做区域映射,也不需要对控制函数进行磨光处理,所以算法很容易编程实现．数值算例表明所提算法能够在解梯度较大的位置加密网格,从而在保证提高数值解的分辨率的前提下,可以很好地节省了计算量．由于Navier-Stokes 的典型性,所得算法能够推广到求解很大一类偏微分方程数值问题．     

对流占优扩散方程的楔形基无网格法

传统的微分方程数值解方法求解对流占优扩散方程时,往往产生数值震荡现象,为了消除数值震荡,本文构建了一种新的数值求解方法――无网格方法进行数值求解。该方法采用配点法并引入一种新的楔形基函数构建了楔形基无网格方法,不需要网格划分,是一种真正的无网格方法,可以避免因为网格划分而影响计算效率。通过对新的楔形基函数的理论分析,证明了本文方法解的存在唯一性。最后,分别通过一维和二维的数值算例,表明该算法计算精度高,可以有效消除对流占优引起的数值震荡,是一种计算对流占优扩散方程数值解的高效方法。     

二维非线性对流扩散方程的特征混合有限元两重网格算法

本文构造了求解非线性对流扩散方程的两重网格算法,该算法首先是在步长为H的粗网格上求解一个非线性问题,再利用粗网格解得到一个线性问题并在细网格上求解一个线性问题.理论分析与数值计算表明,该算法不仅消除了数值振荡现象,还极大地提高了非线性对流扩散方程的计算效率.     

径向基函数、散乱数据拟合与无网格偏微分方程数值解

介绍了近年来国际上有关散乱数据拟合研究中的径向基函数方法，及其在散乱线性泛函信息插值，无网格偏微分方程数值解中应用的主要内容。     

全局弱式无网格方法求解消声器横向模态

应用全局弱式无网格方法求解消声器的横向模态,使用径向基函数点插值法离散本征方程,使用伽辽金加权残数法进行数值积分。分别应用全局弱式无网格方法计算了圆形截面,不规则截面以及含有穿孔截面的本征值和本征向量,计算结果与解析方法和二维有限元方法计算结果吻合较好,并且与二维有限元方法相比,全局弱式无网格方法比较节省计算时间。进而分析了支持域的尺寸以及径向基函数中形状参数对计算精度的影响。     

Hermite径向基函数点插值配点法求解消声器横向模态

为了避免划分网格,应用Hermite径向基函数点插值配点法(HRPIC)求解消声器横向本征方程,应用该方法计算的圆形和跑道圆横截面本征波数分别与解析结果和有限元计算结果吻合较好。进而分析影响域尺寸,问题域内计算点数目以及径向基函数的形状参数对本征波数计算误差的影响。结果表明,本征波数的计算误差在一定范围内会随着影响域尺寸和问题域内节点数目的增大而减小,但是不会一直减小,存在最优的数值,无量纲的形状参数直接影响本征波数的计算精度。最后比较Hermite径向基函数点插值配点法与有限元法的计算速度。     

基于径向基函数的点云岛屿孔洞自动修复

研究了利用点云获得的模型的孔洞修复,针对目前主要通过人工修复带有岛屿面片的孔洞耗时较长的问题,提出了一种基于径向基函数(RBF)自动修复岛屿孔洞的方法。该方法首先利用最小权重三角化法修复模型主体上的孔洞,其次计算模型主体上孔洞与岛屿面片的相关性,利用模型主体上孔洞和与其相关岛屿面片周围点来计算径向基函数,最后将粗修复后细分的点调整到径向基函数描述的曲面上。实验表明,与其他方法相比,该方法能快速、准确地修复缺陷模型。     

复合材料层合板自由振动的薄板样条无网格解

无网格全局配点法分为多项式配点法和径向基函数配点法,国内外很多文献利用径向基函数配点法对复合材料层合板进行了分析。利用一阶剪切变形理论和基于薄板样条径向基函数的无网格配点法计算了复合材料层合板自由振动的固有频率和振型。研究了薄板样条径向基函数中形状参数的选取和本工作方法的收敛性。结果表明:形状参数m=3时收敛性最好,计算精度最高。将本工作计算结果与文献中的实验结果进行了对比,验证了本文方法的精度和效率。     

正交各向异性和各向同性方板自由振动的三维无网格解

推导了正交各向异性和各向同性弹性体自由振动的三维控制微分方程,利用基于逆复合二次径向基函数的无网格配点法对三维控制微分方程和边界条件进行离散,通过数值算例选取了逆复合二次径向基函数的形状参数,结果表明:形状参数(是x方向的节点数)时计算结果收敛最快。计算了不同边界条件的正交各向异性和各向同性板的固有频率,该文中的结果与文献中的结果具有较好的一致性。     

A meshfree method for the solution of two-dimensional cubic nonlinear Schrödinger equation

In this paper, an efficient numerical technique is developed to approximate the solution of two-dimensional cubic nonlinear Schrödinger equations. The method is based on the nonsymmetric radial basis function collocation method (Kansa's method), within an operator Newton algorithm. In the proposed process, three-dimensional radial basis functions (especially, three-dimensional Multiquadrics (MQ) and Inverse multiquadrics (IMQ) functions) are used as the basis functions. For solving the resulting nonlinear system, an algorithm based on the Newton approach is constructed and applied. In the multilevel Newton algorithm, to overcome the instability of the standard methods for solving the resulting ill-conditioned system an interesting and efficient technique based on the Tikhonov regularization technique with GCV function method is used for solving the ill-conditioned system. Finally, the presented method is used for solving some examples of the governing problem. The comparison between the obtained numerical solutions and the exact solutions demonstrates the reliability, accuracy and efficiency of this method.     

A radial point interpolation meshless method extended with an elastic rate-independent continuum damage model for concrete materials

An advanced discretization meshless technique, the radial point interpolation method (RPIM), is applied to analyze concrete structures using an elastic continuum damage constitutive model. Here, the theoretical basis of the material model and the computational procedure are fully presented. The plane stress meshless formulation is extended to a rate-independent damage criterion, where both compressive and tensile damage evolutions are established based on a Helmholtz free energy function. Within the return-mapping damage algorithm, the required variable fields, such as the damage variables and the displacement field, are obtained. This study uses the Newton–Raphson nonlinear solution algorithm to achieve the nonlinear damage solution. The verification, where the performance is assessed, of the proposed model is demonstrated by relevant numerical examples available in the literature.     

A semi‐analytic collocation technique for steady‐state strongly nonlinear advection‐diffusion‐reaction equations with variable coefficients

The aim of this paper is to present a new semi‐analytic numerical method for strongly nonlinear steady‐state advection‐diffusion‐reaction equation (ADRE) in arbitrary 2‐D domains. The key idea of the method is the use of the basis functions which satisfy the homogeneous boundary conditions of the problem. Each basis function used in the algorithm is a sum of an analytic basis function and a special correcting function which is chosen to satisfy the homogeneous boundary conditions of the problem. The polynomials, trigonometric functions, conical radial basis functions, and the multiquadric radial basis functions are used in approximation of the ADRE. This allows us to seek an approximate solution in the analytic form which satisfies the boundary conditions of the initial problem with any choice of free parameters. As a result, we separate the approximation of the boundary conditions and the approximation of the ADRE inside the solution domain. The numerical examples confirm the high accuracy and efficiency of the proposed method in solving strongly nonlinear equations in an arbitrary domain.     

A novel domain decomposition method for highly oscillating partial differential equations

This paper is devoted to designing a novel domain decomposition method (DDM) for highly oscillating partial differential equations (PDE), especially, where the asymmetric meshless collocation method using radial basis functions (RBF), also Kansa's method is applied for a numerical solutions. It is found that the numerical error become worse when the original solution become more oscillating. To conquer this defect, we use a novel domain decomposition method which is motivated by time parallel algorithm. This DDM is based on a decomposition of computational domain by a coarse centers and a finer distribution of distinct centers. A corrector is designed to obtain better numerical solution after several iteration. Theoretical analysis and numerical examples are given to demonstrate the accuracy and efficiency of the proposed algorithm.     

An Adaptive Multi-resolution Method for Solving PDE's

In this paper, we present a multi-resolution adaptive algorithm for solving problems described by partial differential equations. The technique is based on the collocation method using Fup basis functions, which belong to a class of Rvachev's infinitely differentiable finite functions. As it is possible to calculate derivation values of Fup basis functions of high degree in a precise yet simple way, so it is possible to efficiently apply strong formulation procedures. The mesh free method developed in this work is named Adaptive Fup Collocation Method (AFCM). The distribution of collocation points within the observed area is changed adaptively, depending on the character of the solution function and the accuracy criteria. The numerical procedure is designed through a method of lines (MOL). The basic characteristic of the method is an adaptive multi-resolution approach in solving problems with different spatial and temporal scales and with a desired level of accuracy using the entire family of Fup basis functions. Good performance of the proposed method is shown through the numerical examples by using a few general advection dominated problems. The results demonstrate that the method is very convenient for solving engineering problems which require extensive computational resources, especially in describing sharp fronts or high gradients and changes of narrow transition zones in space and time.     

Weighted radial basis collocation method for boundary value problems

This work introduces the weighted radial basis collocation method for boundary value problems. We first show that the employment of least‐squares functional with quadrature rules constitutes an approximation of the direct collocation method. Standard radial basis collocation method, however, yields a larger solution error near boundaries. The residuals in the least‐squares functional associated with domain and boundary can be better balanced if the boundary collocation equations are properly weighted. The error analysis shows unbalanced errors between domain, Neumann boundary, and Dirichlet boundary least‐squares terms. A weighted least‐squares functional and the corresponding weighted radial basis collocation method are then proposed for correction of unbalanced errors. It is shown that the proposed method with properly selected weights significantly enhances the numerical solution accuracy and convergence rates. Copyright © 2006 John Wiley & Sons, Ltd.     

Structural shape and topology optimization using a meshless Galerkin level set method

This paper aims to propose a meshless Galerkin level set method for shape and topology optimization of continuum structures. To take advantage of the implicit free boundary representation scheme, the design boundary is represented as the zero level set of a scalar level set function, to flexibly handle complex shape fidelity and topology changes by maintaining concise and smooth interface. Compactly supported radial basis functions (CSRBFs) are used to parameterize the level set function and construct the shape functions for meshfree approximations based on a set of unstructured field nodes. The meshless Galerkin method with global weak form is used to implement the discretization of the state equations. This provides a pathway to unify the two different numerical stages in most conventional level set methods: (1) the propagation of discrete level set function on a set of Eulerian grid and (2) the approximation of discrete equations on a set of Lagrangian mesh. The original more difficult shape and topology optimization based on the level set equation is transformed into a relatively easier size optimization, to which many efficient optimization algorithms can be applied. The proposed level set method can describe the moving boundaries without remeshing for discontinuities. The motion of the free boundary is just a question of advancing the discrete level set function in time by solving the size optimization. Several benchmark examples are used to demonstrate the effectiveness of the proposed method. The numerical results show that the proposed method can simplify numerical process and avoid numerical difficulties involved in most conventional level set methods. It is straightforward to apply the proposed method to more advanced shape and topology optimization problems. Copyright © 2011 John Wiley & Sons, Ltd.     

A boundary knot method for harmonic elastic and viscoelastic problems using single-domain approach

The boundary knot method is a promising meshfree, integration-free, boundary-type technique for the solution of partial differential equations. It looks for an approximation of the solution in the linear span of a set of specialized radial basis functions that satisfy the governing equation of the problem. The boundary conditions are taken into account through the collocation technique. The specialized radial basis function for harmonic elastic and viscoelastic problems is derived, and a boundary knot method for the solution of these problems is proposed. The completeness issue regarding the proposed set of radial basis functions is discussed, and a formal proof of incompleteness for the circular ring problem is presented. In order to address the numerical performance of the proposed method, some numerical examples considering simple and complex domains are solved.     

A trust region-based approach to optimize triple response systems

This article presents a new computing procedure for the global optimization of the triple response system (TRS) where the response functions are non-convex quadratics and the input factors satisfy a radial constrained region of interest. The TRS arising from response surface modelling can be approximated using a nonlinear mathematical program that considers one primary objective function and two secondary constraint functions. An optimization algorithm named the triple response surface algorithm (TRSALG) is proposed to determine the global optimum for the non-degenerate TRS. In TRSALG, the Lagrange multipliers of the secondary functions are determined using the Hooke–Jeeves search method and the Lagrange multiplier of the radial constraint is located using the trust region method within the global optimality space. The proposed algorithm is illustrated in terms of three examples appearing in the quality-control literature. The results of TRSALG compared to a gradient-based method are also presented.     

An approximated computational method for fast stress reconstruction in large strain plasticity

This article describes a numerical method to reconstruct the stress field starting from strain data in elastoplasticity. Usually, this reconstruction is performed using the radial return algorithm, commonly implemented also in finite element codes. However, that method requires iterations to converge and can bring to errors if applied to experimental strain data affected by noise. A different solution is proposed here, where an approximated numerical method is used to derive the stress from the strain data with no iterations. The method is general and can be applied to any plasticity model with a convex surface of the yield locus in nonproportional loading. The theoretical basis of the method is described and then it is implemented on two constitutive models of anisotropic plasticity, namely, Hill48 and Yld2000-2D. The accuracy of the proposed method and the advantage in terms of computational time with respect to the classical radial-return algorithm are discussed. The possibility of using such method to reconstruct the stress field in case of few temporal data and noisy strain fields is also investigated.