A Spectral Mortar Element Discretization of the Poisson Equation with Mixed Boundary Conditions

In this paper, we study a spectral mortar element discretization of the Poisson equation on a square subject to mixed boundary conditions of Dirichlet and Neumann type. We carry out the numerical analysis of the method and derive error estimates. An efficient algorithm for the solution of the problem is proposed and numerical tests confirming the theoretical results are presented.     

Bending of anisotropic plates by charge simulation method

A boundary element method, called the charge simulation method, is presented for analysis of anisotropic thin-plate bending problems. In this method the singular integrals involved in the other boundary element methods are eliminated and there is no numerical integration involved. Further, the domain integral is replaced by a polynomial particular integral; hence the domain discretization is avoided. This method is conceptually very simple. The results obtained by this method are compared with the available analytical solutions for various anisotropic and symmetric laminates and the results are in good agreement.     

A new approach for data clustering and visualization using self-organizing maps

A self-organizing map (SOM) is a nonlinear, unsupervised neural network model that could be used for applications of data clustering and visualization. One of the major shortcomings of the SOM algorithm is the difficulty for non-expert users to interpret the information involved in a trained SOM. In this paper, this problem is tackled by introducing an enhanced version of the proposed visualization method which consists of three major steps: (1) calculating single-linkage inter-neuron distance, (2) calculating the number of data points in each neuron, and (3) finding cluster boundary. The experimental results show that the proposed approach has the strong ability to demonstrate the data distribution, inter-neuron distances, and cluster boundary, effectively. The experimental results indicate that the effects of visualization of the proposed algorithm are better than that of other visualization methods. Furthermore, our proposed visualization scheme is not only intuitively easy understanding of the clustering results, but also having good visualization effects on unlabeled data sets.     

基于SPH与FEM的结构入水分析方法

建立基于光滑粒子动力学（smoothed particle hydrodynamics, SPH）、有限元法（finite element method, FEM）和无反射边界耦合的结构入水分析方法,将无限水域利用无反射边界条件截断成有限水域,将有限水域分为流体变形大的SPH区域、流体变形小的FEM区域和声学流体FEM区域,结构用FEM离散。采用通用接触算法模拟SPH与FEM的耦合,采用声固耦合方法处理FEM区域之间的耦合,建立流固耦合的SPH FEM分析方法。该方法结合SPH模拟大变形的优点和FEM的高效性,可实现含自由液面变形、液体飞溅和无限水域等特点的流固耦合问题的模拟,为结构入水分析缩小离散区域、降低自由度和SPH粒子数等提供一种有效的分析方法。     

Efficient implementation of Jacobi iterative method for large sparse linear systems on graphic processing units

In this paper, an original Jacobi implementation is considered for the solution of sparse linear systems of equations. The proposed algorithm helps to optimize the parallel implementation on GPU. The performance analysis of GPU-based (using CUDA) algorithm of the implementation of this algorithm is compared to the corresponding serial CPU-based algorithm. Numerical experiments performed on a set of matrices arising from the finite element discretization of various equations (3D Laplace equation, 3D gravitational potential equation, 3D Heat equation) with different meshes, illustrate the performance, robustness and efficiency of our algorithm, with a speed up to 23\(\times \) in double-precision arithmetics.     

二维Helmholtz方程外问题基于自然边界归化的重叠型区域分解算法

１．引 言 设是平面光滑闭曲线,是以为边界的外部区域,考虑二维Ｈｅｌｍｈｏｌｔｚ方程外Ｎｅｕｍａｎｎ问题并在无穷远处满足Ｓｏｍｍｅｒｆｅｌｄ辐射条件其中是区域的边界的外法线方向,即指向由包围的内部区域．κ在许多情况下（例如约化波动方程）是实数,在另一些情况下则是纯虚数．本文仅讨论κ为纯虚数的情况,且不失一般性,可设Ｉｍ（ｋ）＞０． 用某些数值方法求解线性抛物型方程或线性双曲型方程的初边值问题时,可能导致求解Ｈｅｌｍｈｏｌｔｚ方程的外问题．例如,用自然边界元法求解线性抛物型方程的初边值问题时就导致求…     

A finite element scheme with a high order absorbing boundary condition for elastodynamics

A high-order absorbing boundary condition (ABC) is devised on an artificial boundary for time-dependent elastic waves in unbounded domains. The configuration considered is that of a two-dimensional elastic waveguide. In the exterior domain, the unbounded elastic medium is assumed to be isotropic and homogeneous. The proposed ABC is an extension of the Hagstrom–Warburton ABC which was originally designed for acoustic waves, and is applied directly to the displacement field. The order of the ABC determines its accuracy and can be chosen to be arbitrarily high. The initial boundary value problem including this ABC is written in second-order form, which is convenient for geophysical finite element (FE) analysis. A special variational formulation is constructed which incorporates the ABC. A standard FE discretization is used in space, and a Newmark-type scheme is used for time-stepping. A long-time instability is observed, but simple means are shown to dramatically postpone its onset so as to make it harmless during the simulation time of interest. Numerical experiments demonstrate the performance of the scheme.     

A Schwarz alternating algorithm for a three-dimensional exterior harmonic problem with prolate spheroid boundary

In this paper, we investigate a Schwarz alternating algorithm for a three-dimensional exterior harmonic problem with prolate spheroid boundary. Based on natural boundary reduction, the algorithm is constructed and its convergence is discussed. The finite element method and the natural boundary element method are alternatively applied to solve the problem in a bounded subdomain and a typical unbounded subdomain. The convergence rate is analyzed in detail for a typical domain. Two numerical examples are presented to demonstrate the effectiveness and accuracy of the proposed method.     

Semi-Unstructured Grids

We present a novel automatic grid generator for the finite element discretization of partial differential equations in 3D. The grids constructed by this grid generator are composed of a pure tensor product grid in the interior of the domain and an unstructured grid which is only contained in boundary cells. The unstructured component consists of tetrahedra, each of which satisfies a maximal interior angle condition. By suitable constructing the boundary cells, the number of types of boundary subcells is reduced to 12 types. Since this grid generator constructs large structured grids in the interior and small unstructured grids near the boundary, the resulting semi-unstructured grids have similar properties as structured tensor product grids. Some appealing properties of this method are computational efficiency and natural construction of coarse grids for multilevel algorithms. Numerical results and an analysis of the discretization error are presented. Received July 17, 2000; revised October 27, 2000     

Iterative solution of bem equations by GMRES algorithm

This paper presents a performance study of the GMRES algorithm for the solution of non-symmetric dense systems of equations arising from the boundary element discretization of two-dimensional elasticity. Comparisons with Gauss elimination and bi-conjugate gradients show the computer effectiveness and accuracy of the preconditioned GMRES algorithm.     

Greedy algorithms for eigenvalue optimization problems in shape design of two-density inhomogeneous materials

This paper studies the eigenvalue optimization problems in the shape design of the two-density inhomogeneous materials. Two types of greedy algorithms are proposed to solve three optimization problems in finite element discretization. In the first type, the whole domain is initialized by one density. For each problem of the eigenvalue optimizations, we define a measurement of the element, which is the criterion to determine the ‘best’ element. We change the density of the ‘best’ element to the other density. Then the algorithm repeats the procedure until the area constraint is satisfied. In the second type, the algorithm begins with the density distribution satisfying the area constraint. Also, according to the measurement of the element, the algorithm finds a pair of the ‘best’ elements and exchanges their densities between each other. Furthermore, the accelerating greedy algorithms are proposed to speed up both two types. Three numerical examples are provided to illustrate the results.     

无穷凹角区域椭圆边值问题的重叠型区域分解算法

§1.引言许多科学和工程计算问题都可归结为无界区域上的偏微分方程边值问题,数值求解无界     

Effective approach for the identification of boundary conditions in distributed-parameter systems

This paper is concerned with the identification of boundary conditions in parabolic-type distributed systems with boundaries of irregular shape. In the present approach, finite element discretization in the spatial domain and orthogonal functions expansion in the time domain are adopted to reduce the partial differential equation to a set of algebraic equations. The boundary conditions are then estimated by the method of least squares using state observations taken at a few interior points. The present approach is very straightforward and, at least as shown in illustrative examples, the results are in excellent agreement with exact results.     

A Posteriori Estimates for a Natural Neumann–Neumann Domain Decomposition Algorithm on a Unilateral Contact Problem

In this paper we present an error estimator for unilateral contact problems solved by a Neumann–Neumann Domain Decomposition algorithm. This error estimator takes into account both the spatial error due to the finite element discretization and the algebraic error due to the domain decomposition algorithm. To differentiate specifically the contribution of these two error sources to the global error, two quantities are introduced: a discretization error indicator and an algebraic error indicator. The effectivity indices and the convergence of both the global error estimator and the error indicators are shown on several examples.     

光滑粒子动力学核心算法与软件开发中的关键问题

针对光滑粒子动力学(Smoothed Particle Hydrodynamics,SPH)软件开发中诸多关键性问题未得到解决、开发进程相对滞后的问题,从SPH的精度、粒子近似离散格式、粒子分布和大小、变形的自适应、时间积分步长的自适应及边界算法和耦合算法等方面,分析核心算法以及SPH软件开发中的关键问题,如高性能计算...     

Automatic mesh generation for finite element analysis

The finite element analysis in engineering applications comprises three phases: domain discretization, equation solving and error analysis. The domain discretization or mesh generation is the pre-processing phase which plays an important role in the achievement of accurate solutions. In this paper, the improvement of one particularly promising technique for generating two-dimensional meshes is presented. Our technique shows advantages and efficiency over some currently available mesh generators.     

基于分类体数据的四面体网格剖分算法

虚拟内窥手术是以真实病人的CT或者MRI扫描数据为基础，首先通过组织分割，在计算机内部建立起三维模型，然后通过虚拟现实技术来模拟窥镜手术全过程的一项技术。其中，人体器官的三维网格建模是该技术中一个十分重要的部分，为了准确地进行了人体器官三维网格建模，在对三维体数据进行组织分割的基础上，提出了一种由分类体数据直接建立三维四面体网格的方法，由于Delaunay三角剖分所产生的网格质量比较高，所以该方法沿用逐点插入算法的思想，以特征点的提取和Steiner布点为基础来生成四面体网格，并通过组织边界的判定准则和利用flip操作来恢复组织边界，实践证明，该方法所生成的网格具有自适应的网格密度。     

Continuum shape sensitivity analysis of a mixed-mode fracture in functionally graded materials

This paper presents two new methods for conducting a continuum shape sensitivity analysis of a crack in an isotropic, linear-elastic functionally graded material. These methods involve the material derivative concept from continuum mechanics, domain integral representation of interaction integrals, known as the M-integral, and direct differentiation. Unlike virtual crack extension techniques, no mesh perturbation is needed to calculate the sensitivity of stress–intensity factors. Since the governing variational equation is differentiated prior to the process of discretization, the resulting sensitivity equations are independent of approximate numerical techniques, such as the meshless method, finite element method, boundary element method, or others. Three numerical examples are presented to calculate the first-order derivative of the stress–intensity factors. The results show that first-order sensitivities of stress intensity factors obtained using the proposed method are in excellent agreement with the reference solutions obtained using the finite-difference method for the structural and crack geometries considered in this study.     

基于有效并行求解策略的显式有限元分析并行算法

针对大规模结构非线性动力问题的有限元分析非常耗时,基于消息传递接口（MPI）机群环境,提出多种基于并行求解策略的显式有限元并行算法。基于显式消息传递的区域分解技术,采取重叠、非重叠区域分解技术及动态任务分配方法,通过将计算与通信重叠,优化处理器间的通信,对非重叠通信区域分解并行算法、重叠通信区域分解并行算法、群动态任务分配算法、动态任务分配算法及动态负载平衡算法进行研究。为在机群环境下实现非线性动力有限元分析,开发了基于有效并行求解策略的显式有限元并行算法。编写了基于消息传递编程模式的并行有限元程序,在工作站机群上实现了数值算例,分析了算法的性能,并与传统的Newmark算法进行了比较。算例表明：群动态任务分配算法的性能优于动态任务分配算法,低于区域分解算法的性能,动态负载平衡算法最优。对相同规模的问题提出的算法比Newmark算法快,优于Newmark算法。对结构非线性动力问题的有限元分析,所提出的并行算法是可行有效的。     

Refinement of flexible space–time finite element meshes and discontinuous Galerkin methods

In this paper we present an algorithm to refine space–time finite element meshes as needed for the numerical solution of parabolic initial boundary value problems. The approach is based on a decomposition of the space–time cylinder into finite elements, which also allows a rather general and flexible discretization in time. This also includes adaptive finite element meshes which move in time. For the handling of three-dimensional spatial domains, and therefore of a four-dimensional space–time cylinder, we describe a refinement strategy to decompose pentatopes into smaller ones. For the discretization of the initial boundary value problem we use an interior penalty Galerkin approach in space, and an upwind technique in time. A numerical example for the transient heat equation confirms the order of convergence as expected from the theory. First numerical results for the transient Navier–Stokes equations and for an adaptive mesh moving in time underline the applicability and flexibility of the presented approach.