共查询到20条相似文献,搜索用时 15 毫秒
1.
Alvaro L. G. A. Coutinho Marcos A. D. Martins Rubens M. Sydenstricker Renato N. Elias 《International journal for numerical methods in engineering》2006,66(3):431-460
Several performance improvements for finite‐element edge‐based sparse matrix–vector multiplication algorithms on unstructured grids are presented and tested. Edge data structures for tetrahedral meshes and triangular interface elements are treated, focusing on nodal and edges renumbering strategies for improving processor and memory hierarchy use. Benchmark computations on Intel Itanium 2 and Pentium IV processors are performed. The results show performance improvements in CPU time ranging from 2 to 3. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
2.
P. BATTEN C. LAMBERT D. M. CAUSON 《International journal for numerical methods in engineering》1996,39(11):1821-1838
Despite their geometric flexibility, unstructured mesh schemes for compressible gas dynamics do not usually resolve captured shocks and contact discontinuities as well as corresponding structured mesh schemes. The main reason for this appears to be the difficulty in constructing analogous extensions to higher-order accuracy. This issue is addressed in some detail and a new, compact stencil, Maximum Limited Gradient (MLG) reconstruction technique is presented for unstructured elements. The MLG reconstruction turns out to be a multidimensional analogue of the one-dimensional Superbee slope. We then describe a simple and robust extension to systems of equations, which does not require any diagonalization of flux Jacobian matrices. An application to a blast wave hazard prediction problem is presented using the wave-by-wave extension of the MLG limiter to the Euler equations. 相似文献
3.
M. J. van Haaren H. C. Stoker A. H. van den Boogaard J. Hutink 《International journal for numerical methods in engineering》2000,49(5):697-720
The arbitrary Lagrangian–Eulerian (ALE) finite element method is applied to the simulation of forming processes where material is highly deformed. Here, the split formulation is used: a Lagrangian step is done with an implicit finite element formulation, followed by an explicit (purely convective) Eulerian step. The purpose of this study is to investigate the Eulerian step for quadratic triangular elements. To solve the convection equation for integration point values, a new method inspired by Van Leer is constructed. The new method is based on direct convection of integration point values without intervention of nodal point values. The Molenkamp test and a so‐called block test were executed to check the performance and stability of the convection scheme. From these tests it is concluded that the new convection scheme shows accurate results. The scheme is extended to an ALE‐algorithm. An extrusion process was simulated to test the applicability of the scheme to engineering problems. It is concluded that direct convection of integration point values with the presented algorithm leads to accurate results and that it can be applied to ALE‐simulations. Copyright © 2000 John Wiley & Sons, Ltd. 相似文献
4.
Baili Zhang Yong Zhao 《International journal for numerical methods in engineering》2001,50(11):2443-2457
An upwind characteristic‐based finite volume method on unstructured grids is employed for numerical simulation of incompressible laminar flow and forced convection heat transfer in 2D channels containing simultaneously fluid layers and fluid‐saturated porous layers. Hydrodynamic and heat transfer results are reported for two configurations: the first one is a backward‐facing step channel with a porous block inserted behind the step, and the second one is a partially porous channel with discrete heat sources on the bottom wall. The effects of Darcy numbers on heat transfer augmentation and pressure loss were investigated for low Reynolds laminar flows. The results demonstrate the accuracy and robustness of the numerical scheme proposed, and suggest that partially porous insertion in a channel can significantly improve heat transfer performance with affordable pressure loss. Copyright © 2001 John Wiley & Sons, Ltd. 相似文献
5.
Traian Iliescu 《International journal for numerical methods in engineering》1999,46(7):993-1000
This paper proposes and studies an algorithm for aligning a triangulation with a given convection field. Approximate solutions of convection‐dominated problems on flow‐aligned meshes typically have sharper internal layers, less over and undershooting and higher accuracy. The algorithm we present can be imported easily into any 2D finite element solver, does not change the number of meshpoints, and can improve solution quality quite dramatically. This improvement in solution quality on the flow‐aligned triangulation is illustrated for both the usual Galerkin method and the streamline‐diffusion method. Copyright © 1999 John Wiley & Sons, Ltd. 相似文献
6.
针对传统有限元法求解Oldroyd-B本构方程时需加入稳定化方案的缺点,本文基于非结构网格给出了统一间断有限元求解框架.该框架包含采用IPDG(interior penalty discontinuous Galerkin)求解质量方程和动量方程,与采用RKDG(Runge-Kutta discontinuous Galerkin)求解本构方程这两个核心.数值结果表明:该方法在求解Oldroyd-B本构方程时无需加入稳定化方案,实施比有限元法简便,且具有较高的计算精度,可有效地模拟包含应力奇异点的复杂粘弹流动问题,进而揭示非牛顿粘弹流动的基本特征. 相似文献
7.
We describe a Gauss–Seidel algorithm for optimizing a three‐dimensional unstructured grid so as to conform to a given metric. The objective function for the optimization process is based on the maximum value of an elemental residual measuring the distance of any simplex in the grid to the local target metric. We analyse different possible choices for the objective function, and we highlight their relative merits and deficiencies. Alternative strategies for conducting the optimization are compared and contrasted in terms of resulting grid quality and computational costs. Numerical simulations are used for demonstrating the features of the proposed methodology, and for studying some of its characteristics. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
8.
A framework for the construction of node-centred schemes to solve the compressible Euler and Navier–Stokes equations is presented. The metric quantities are derived by exploiting some properties of C0 finite element shape functions. The resulting algorithm allows to implement both artificial diffusion and one-dimensional upwind-type discretizations. The proposed methodology adopts a uniform data structure for diverse grid topologies (structured, unstructured and hybrid) and different element shapes, thus easing code development and maintenance. The final schemes are well suited to run on vector/parallel computer architectures. In the case of linear elements, the equivalence of the proposed method with a particular finite volume formulation is demonstrated. 相似文献
9.
10.
11.
Gustavo C. Buscaglia Enzo A. Dari 《International journal for numerical methods in engineering》1997,40(22):4119-4136
The construction of solution-adapted meshes is addressed within an optimization framework. An approximation of the second spatial derivative of the solution is used to get a suitable metric in the computational domain. A mesh quality is proposed and optimized under this metric, accounting for both the shape and the size of the elements. For this purpose, a topological and geometrical mesh improvement method of high generality is introduced. It is shown that the adaptive algorithm that results recovers optimal convergence rates in singular problems, and that it captures boundary and internal layers in convection-dominated problems. Several important implementation issues are discussed. © 1997 John Wiley & Sons, Ltd. 相似文献
12.
Nazmiye Acikgoz Carlo L. Bottasso 《International journal for numerical methods in engineering》2007,71(2):201-223
We report on results obtained with a metric-driven mesh optimization procedure for simplicial meshes based on the simulated annealing (SA) method. The use of SA improves the chances of removing pathological clusters of bad elements, that have the tendency to lock into frozen configurations in difficult regions of the model such as corners and complex face intersections, prejudicing the overall quality of the final grid. A local version of the algorithm is developed that significantly lowers the computational cost. Numerical examples illustrate the effectiveness of the proposed methodology, which is compared to a classical greedy Gauss–Seidel optimization. Substantial improvement in the quality of the worst elements of the grid is observed for the local simulated annealing optimization. Furthermore, the method appears to be robust to the choice of the algorithmic parameters. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
13.
Alexander A. Shostko Rainald Lhner William C. Sandberg 《International journal for numerical methods in engineering》1999,44(9):1359-1376
A method for the rapid construction of meshes over intersecting triangulated shapes is described. The method is based on an algorithm that automatically generates a surface mesh from intersecting triangulated surfaces by means of Boolean intersection/union operations. After the intersection of individual components is obtained, the exposed surface parts are extracted. The algorithm is intended for rapid interactive construction of non‐trivial surfaces in engineering design, manufacturing, visualization and molecular modelling applications. Techniques to make the method fast and general are described. The proposed algorithm is demonstrated on a number of examples, including intersections of multiple spheres, planes and general engineering shapes, as well as generation of surface and volume meshes around clusters of intersecting components followed by the computation of flow field parameters. Copyright © 1999 John Wiley & Sons, Ltd. 相似文献
14.
B. Kaan Karamete Rao V. Garimella Mark S. Shephard 《International journal for numerical methods in engineering》2001,50(6):1389-1409
This study describes an algorithm for recovering an edge which is arbitrarily inserted onto a pre‐triangulated surface mesh. The recovery process does not rely on the parametric space of the surface mesh provided by the geometric modeller. The topological and geometrical validity of the surface mesh is preserved through the entire recovery process. The ability of inserting and recovering an arbitrary edge onto a surface mesh can be an invaluable tool for a number of meshing applications such as boundary layer mesh generation, solution adaptation, preserving the surface conformity, and possibly as a primary tool for mesh generation. The edge recovery algorithm utilizes local surface mesh modification operations of edge swapping, collapsing and splitting. The mesh modification operations are decided by the results of pure geometrical checks such as point and line projections onto faces and face‐line intersections. The accuracy of these checks on the recovery process are investigated and the substantiated precautions are devised and discussed in this study. Copyright © 2001 John Wiley & Sons, Ltd. 相似文献
15.
Nucleation Crystallography of Ni Grains on CrFeNb Inoculants Investigated by Edge‐to‐Edge Matching Model in an IN718 Superalloy
下载免费PDF全文

Wenchao Yang Pengfei Qu Lin Liu Ziqi Jie Taiwen Huang Feng Wang Jun Zhang 《Advanced Engineering Materials》2018,20(2)
16.
L. Cueto‐Felgueroso I. Colominas J. Fe F. Navarrina M. Casteleiro 《International journal for numerical methods in engineering》2006,65(3):295-331
This paper introduces the use of moving least‐squares (MLS) approximations for the development of high‐order finite volume discretizations on unstructured grids. The field variables and their successive derivatives can be accurately reconstructed using this mesh‐free technique in a general nodal arrangement. The methodology proposed is used in the construction of two numerical schemes for the shallow water equations on unstructured grids: a centred Lax–Wendroff method with added shock‐capturing dissipation, and a Godunov‐type upwind scheme, with linear and quadratic reconstructions. This class of mesh‐free techniques provides a robust and general approximation framework which represents an interesting alternative to the existing procedures, allowing, in addition, an accurate computation of the viscous fluxes. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
17.
针对一般方法模拟具有运动界面的多介质可压缩流动问题计算量大、实施复杂的缺点,本文发展了一种基于非结构网格的数值模拟方法.该方法采用RKDG(RungeKutta Discontinuous Galerkin)方法的弱形式求解Euler方程,用强形式求解可压缩流场模拟中的Level Set方程,并用Simple Fix方法耦合两套方程的数值求解.二维多介质可压缩流的模拟表明:该方法成功地抑制了界面附近的非物理振荡,计算量小、实施简单,并可有效求解具有运动界面的多介质可压缩流动问题. 相似文献
18.
Juan R. Cebral Fernando E. Camelli Rainald Lhner 《International journal for numerical methods in engineering》2002,55(2):177-190
Several extensions and improvements to surface merging procedures based on the extraction of iso‐surfaces from a distance map defined on an adaptive background grid are presented. The main objective is to extend the application of these algorithms to surfaces with sharp edges and corners. In order to deal with objects of different length scales, the initial background grids are created using a Delaunay triangulation method and local voxelizations. A point enrichment technique that introduces points into the background grid along detected surface features such as ridges is used to ensure that these features are preserved in the final merged surface. The surface merging methodology is extended to include other Boolean operations between surface triangulations. The iso‐surface extraction algorithms are modified to obtain the correct iso‐surface for multi‐component objects. The procedures are demonstrated with various examples, ranging from simple geometrical entities to complex engineering applications. The present algorithms allow realistic modelling of a large number of complex engineering geometries using overlapping components defined discretely, i.e. via surface triangulations. This capability is very useful for grid generation starting from data originated in measurements or images. Copyright © 2002 John Wiley & Sons, Ltd. 相似文献
19.
C. T. Wu Wei Hu G. R. Liu 《International journal for numerical methods in engineering》2014,100(5):374-398
This paper presents a bubble‐enhanced smoothed finite element formulation for the analysis of volume‐constrained problems in two‐dimensional linear elasticity. The new formulation is derived based on the variational multi‐scale approach in which unequal order displacement‐pressure pairs are used for the mixed finite element approximation and hierarchical bubble function is selected for the fine‐scale displacement approximation. An area‐weighted averaging scheme is employed for the two‐scale smoothed strain calculation under the framework of edge‐based smoothed FEM. The smoothed fine‐scale solution is shown to naturally contain the stress field jump of the smoothed coarse‐scale solution across the boundary of edge‐based smoothing domain and thus provides the possibility to stabilize the global solution for volume‐constrained problems. A global monolithic solution strategy is employed, and the fine‐scale solution is solved without the consideration of approximating the strong form of the fine‐scale equation. Several numerical examples are analyzed to demonstrate the accuracy of the present formulation. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
20.
Subhajit Sanfui Deepak Sharma 《International journal for numerical methods in engineering》2020,121(17):3824-3848
With the development of parallel computing architectures, larger and more complex finite element analyses (FEA) are being performed with higher accuracy and smaller execution times. Graphics processing units (GPUs) are one of the major contributors of this computational breakthrough. This work presents a three-stage GPU-based FEA matrix generation strategy with the key idea of decoupling the computation of global matrix indices and values by use of a novel data structure referred to as the neighbor matrix. The first stage computes the neighbor matrix on the GPU based on the unstructured mesh. Using this neighbor matrix, the indices and values of the global matrix are computed separately in the second and third stages. The neighbor matrix is computed for three different element types. Two versions for performing numerical integration and assembly in the same or separate kernels are implemented and simulations are run for different mesh sizes having up to three million degrees of freedom on a single GPU. Comparison with GPU-based parallel implementation from the literature reveals speedup ranging from 4× to 6× for the proposed workload division strategy. Furthermore, the same kernel implementation is found to outperform the separate kernel implementation by 70% to 150% for different element types. 相似文献