Applications of mesh smoothing: copy,morph, and sweep on unstructured quadrilateral meshes

Mesh smoothing is demonstrated to be an effective means of copying, morphing, and sweeping unstructured quadrilateral surface meshes from a source surface to a target surface. Construction of the smoother in a particular way guarantees that the target mesh will be a ‘copy’ of the source mesh, provided the boundary data of the target surface is a rigid body rotation, translation, and/or uniform scaling of the original source boundary data and provided the proper boundary node correspondence between source and target has been selected. Copying is not restricted to any particular smoother, but can be based on any locally elliptic second‐order operator. When the bounding loops are more general than rigid body transformations the method generates high‐quality, ‘morphed’ meshes. Mesh sweeping, if viewed as a morphing of the source surface to a set of target surfaces, can be effectively performed via this smoothing algorithm. Published in 1999 by John Wiley & Sons, Ltd. This article is a U.S. government work and is in the public domain in the United States.     

Remeshing for metal forming simulations—Part I: Two‐dimensional quadrilateral remeshing

In this paper, a general framework of practical two‐dimensional quadrilateral remeshing, which includes the determination of remeshing time, automatic quadrilateral mesh generation, and data transfer process, will be formulated. In particular, the current work contains new algorithms of mesh density specification according to the distribution of effective strain‐rate gradients, mesh density smoothing by fast Fourier transform (FFT) and low‐pass filtering techniques, coarsening it by node placement scheme, and a modified Laplacian mesh smoothing technique. The efficiency of the developed remeshing scheme was tested through three practical two‐dimensional metal forming simulations. The results clearly indicate that the algorithms proposed in this study make it possible to simulate two‐dimensional metal forming problems efficiently and automatically. Copyright © 2002 John Wiley & Sons, Ltd.     

一种针对频率扫描测量系统的信号处理方法

设计了一种针对频率扫描绝对距离测量系统的信号处理算法。该系统采用基于电流调制式的频率扫描方法,利用一个比对干涉光路与一个测量干涉光路进行同步测量。两路扫描干涉信号分别由两个光电探测器进行光电转换,作为绝对距离计算处理的输入信号。分析了测量系统的原理与扫描干涉信号的特点,应用两步差分卷积算法进行信号处理,提取的比对光路与测量光路的周期或频率信息进行绝对距离测量。分析了该算法的周期计算误差。实验验证这种方法具有较大的计算优势。     

Remeshing for metal forming simulations—Part II: Three‐dimensional hexahedral mesh generation

In the present study, a hexahedral mesh generator was developed for remeshing in three‐dimensional metal forming simulations. It is based on the master grid approach and octree‐based refinement scheme to generate uniformly sized or locally refined hexahedral mesh system. In particular, for refined hexahedral mesh generation, the modified Laplacian mesh smoothing scheme mentioned in the two‐dimensional study (Part I) was used to improve the mesh quality while also minimizing the loss of element size conditions. In order to investigate the applicability and effectiveness of the developed hexahedral mesh generator, several three‐dimensional metal forming simulations were carried out using uniformly sized hexahedral mesh systems. Also, a comparative study of indentation analyses was conducted to check the computational efficiency of locally refined hexahedral mesh systems. In particular, for specification of refinement conditions, distributions of effective strain‐rate gradient and posteriori error values based on a Z² error estimator were used. From this study, it is construed that the developed hexahedral mesh generator can be effectively used for three‐dimensional metal forming simulations. Copyright © 2002 John Wiley & Sons, Ltd.     

All‐hexahedral mesh smoothing with a node‐based measure of quality

This research work deals with the analysis and test of a normalized‐Jacobian metric used as a measure of the quality of all‐hexahedral meshes. Instead of element qualities, a measure of node quality was chosen. The chosen metric is a bound for deviation from orthogonality of faces and dihedral angles. We outline the main steps and algorithms of a program that is successful in improving the quality of initially invalid meshes to acceptable levels. For node movements, the program relies on a combination of gradient‐driven and simulated annealing techniques. Some examples of the results and speed are also shown. Copyright © 2001 John Wiley & Sons, Ltd.     

The construction of improved‐quality mesh on a curved surface using mapping factors

Abstract

The Delaunay triangulation is broadly used on flat surfaces to generate well‐shaped elements. But the properties of Delaunay triangulation do not exist on curved surfaces whose Jacobians are different. In this paper we will present a modified algorithm to improve the shape of triangulation for the curved surface. The experiment results show that making use of “mapping factors” in the Delaunay triangulation and Laplacian method can produce better mesh (most aspect ratios≤3) on a curved surface.     

Achieving finite element mesh quality via optimization of the Jacobian matrix norm and associated quantities. Part I—a framework for surface mesh optimization

Structured mesh quality optimization methods are extended to optimization of unstructured triangular, quadrilateral, and mixed finite element meshes. New interpretations of well‐known nodally based objective functions are made possible using matrices and matrix norms. The matrix perspective also suggests several new objective functions. Particularly significant is the interpretation of the Oddy metric and the smoothness objective functions in terms of the condition number of the metric tensor and Jacobian matrix, respectively. Objective functions are grouped according to dimensionality to form weighted combinations. A simple unconstrained local optimum is computed using a modified Newton iteration. The optimization approach was implemented in the CUBIT mesh generation code and tested on several problems. Results were compared against several standard element‐based quality measures to demonstrate that good mesh quality can be achieved with nodally based objective functions. Published in 2000 by John Wiley & Sons, Ltd.     

Advanced 4‐node tetrahedrons

Tetrahedral elements are indispensable to complex finite element structural analysis. Two existing and two newly developed advanced 4‐node tetrahedrons are studied in this paper. The existing elements that use complicated displacement fields are significantly simplified. The spurious zero‐energy modes typical of all these elements are identified to be rigid‐body‐alike modes and are found to be naturally suppressible, making it possible to avoid any stabilization techniques and unknown parameters in formulation. Through the simplified form, we connect these four tetrahedrons and view them in a general framework of the partition‐of‐unity‐based approximation. This general view allows us to reveal many promising features of the newly developed tetrahedrons by comparing them with their existing counterparts: the newly developed tetrahedrons have straightforward formulation, no unsuppressed zero‐energy modes, no stabilization required, no unknown parameters contained, and a high consistency in implementation, in addition to good accuracy and extremely straightforward mesh generation. Copyright © 2006 John Wiley & Sons, Ltd.     

Enhanced Solar‐to‐Hydrogen Generation with Broadband Epsilon‐Near‐Zero Nanostructured Photocatalysts

The direct conversion of solar energy into fuels or feedstock is an attractive approach to address increasing demand of renewable energy sources. Photocatalytic systems relying on the direct photoexcitation of metals have been explored to this end, a strategy that exploits the decay of plasmonic resonances into hot carriers. An efficient hot carrier generation and collection requires, ideally, their generation to be enclosed within few tens of nanometers at the metal interface, but it is challenging to achieve this across the broadband solar spectrum. Here the authors demonstrate a new photocatalyst for hydrogen evolution based on metal epsilon‐near‐zero metamaterials. The authors have designed these to achieve broadband strong light confinement at the metal interface across the entire solar spectrum. Using electron energy loss spectroscopy, the authors prove that hot carriers are generated in a broadband fashion within 10 nm in this system. The resulting photocatalyst achieves a hydrogen production rate of 9.5 µmol h^?1 cm^?2 that exceeds, by a factor of 3.2, that of the best previously reported plasmonic‐based photocatalysts for the dissociation of H₂ with 50 h stable operation.     

Parallel computing of high‐speed compressible flows using a node‐based finite‐element method

An efficient parallel computing method for high‐speed compressible flows is presented. The numerical analysis of flows with shocks requires very fine computational grids and grid generation requires a great deal of time. In the proposed method, all computational procedures, from the mesh generation to the solution of a system of equations, can be performed seamlessly in parallel in terms of nodes. Local finite‐element mesh is generated robustly around each node, even for severe boundary shapes such as cracks. The algorithm and the data structure of finite‐element calculation are based on nodes, and parallel computing is realized by dividing a system of equations by the row of the global coefficient matrix. The inter‐processor communication is minimized by renumbering the nodal identification number using ParMETIS. The numerical scheme for high‐speed compressible flows is based on the two‐step Taylor–Galerkin method. The proposed method is implemented on distributed memory systems, such as an Alpha PC cluster, and a parallel supercomputer, Hitachi SR8000. The performance of the method is illustrated by the computation of supersonic flows over a forward facing step. The numerical examples show that crisp shocks are effectively computed on multiprocessors at high efficiency. Copyright © 2003 John Wiley & Sons, Ltd.     

HEXAHEDRAL MESH GENERATION BY MEDIAL SURFACE SUBDIVISION: PART II. SOLIDS WITH FLAT AND CONCAVE EDGES

A method is presented for the subdivision of a large class of solids into simple subregions suitable for automatic finite element meshing with hexahedral elements. The medial surface subdivision technique described previously in the literature is used as the basis for this work and is extended here to cover solids which have flat and concave edges. Problems where the medial surface is degenerated are also addressed. © 1997 by John Wiley & Sons, Ltd.     

Octree‐based reasonable‐quality hexahedral mesh generation using a new set of refinement templates

An octree‐based mesh generation method is proposed to create reasonable‐quality, geometry‐adapted unstructured hexahedral meshes automatically from triangulated surface models without any sharp geometrical features. A new, easy‐to‐implement, easy‐to‐understand set of refinement templates is developed to perform local mesh refinement efficiently even for concave refinement domains without creating hanging nodes. A buffer layer is inserted on an octree core mesh to improve the mesh quality significantly. Laplacian‐like smoothing, angle‐based smoothing and local optimization‐based untangling methods are used with certain restrictions to further improve the mesh quality. Several examples are shown to demonstrate the capability of our hexahedral mesh generation method for complex geometries. Copyright © 2008 John Wiley & Sons, Ltd.     

A node‐to‐node scheme with the aid of variable‐node elements for elasto‐plastic contact analysis

A strategy for a two‐dimensional contact analysis involving finite strain plasticity is developed with the aid of variable‐node elements. The variable‐node elements, in which nodes are added freely where they are needed, make it possible to transform the non‐matching meshes into matching meshes directly. They thereby facilitate an efficient analysis, maintaining node‐to‐node contact during the contact deformation. The contact patch test, wherein the contact patch is constructed out of variable‐node elements, is thus passed, and iterations for equilibrium solutions reach convergence faster in this scheme than in the conventional approach based on the node‐to‐surface contact. The effectiveness and accuracy of the proposed scheme are demonstrated through several numerical examples of elasto‐plastic contact analyses. Copyright © 2015 John Wiley & Sons, Ltd.     

Achieving finite element mesh quality via optimization of the Jacobian matrix norm and associated quantities. Part II—A framework for volume mesh optimization and the condition number of the Jacobian matrix

Three‐dimensional unstructured tetrahedral and hexahedral finite element mesh optimization is studied from a theoretical perspective and by computer experiments to determine what objective functions are most effective in attaining valid, high‐quality meshes. The approach uses matrices and matrix norms to extend the work in Part I to build suitable 3D objective functions. Because certain matrix norm identities which hold for 2×2 matrices do not hold for 3×3 matrices, significant differences arise between surface and volume mesh optimization objective functions. It is shown, for example, that the equality in two dimensions of the smoothness and condition number of the Jacobian matrix objective functions does not extend to three dimensions and further, that the equality of the Oddy and condition number of the metric tensor objective functions in two dimensions also fails to extend to three dimensions. Matrix norm identities are used to systematically construct dimensionally homogeneous groups of objective functions. The concept of an ideal minimizing matrix is introduced for both hexahedral and tetrahedral elements. Non‐dimensional objective functions having barriers are emphasized as the most logical choice for mesh optimization. The performance of a number of objective functions in improving mesh quality was assessed on a suite of realistic test problems, focusing particularly on all‐hexahedral ‘whisker‐weaved’ meshes. Performance is investigated on both structured and unstructured meshes and on both hexahedral and tetrahedral meshes. Although several objective functions are competitive, the condition number objective function is particularly attractive. The objective functions are closely related to mesh quality measures. To illustrate, it is shown that the condition number metric can be viewed as a new tetrahedral element quality measure. Published in 2000 by John Wiley & Sons, Ltd.     

Hexahedral mesh generation by medial surface subdivision: Part I. Solids with convex edges

A method is presented for subdividing a large class of solid objects into topologically simple subregions suitable for automatic finite element meshing with hexahedral elements. The technique uses a geometric property of a solid, its medial surface, to define the necessary subregions. The subregions are defined explicitly to be one of only 13 possible types. The subdividing cuts are between parts of the object in geometric proximity and produce good quality meshes of hexahedral elements. The method as introduced here is applicable to solids with convex edges and vertices, but the extension to complete generality is feasible.     

Time‐space PGD for the rapid solution of 3D nonlinear parametrized problems in the many‐query context

This work deals with the question of the resolution of nonlinear problems for many different configurations in order to build a ‘virtual chart’ of solutions. The targeted problems are three‐dimensional structures driven by Chaboche‐type elastic‐viscoplastic constitutive laws. In this context, parametric analysis can lead to highly expensive computations when using a direct treatment. As an alternative, we present a technique based on the use of the time‐space proper generalized decomposition in the framework of the LATIN method. To speed up the calculations in the parametrized context, we use the fact that at each iteration of the LATIN method, an approximation over the entire time‐space domain is available. Then, a global reduced‐order basis is generated, reused and eventually enriched, by treating, one‐by‐one, all the various parameter sets. The novelty of the current paper is to develop a strategy that uses the reduced‐order basis for any new set of parameters as an initialization for the iterative procedure. The reduced‐order basis, which has been built for a set of parameters, is reused to build a first approximation of the solution for another set of parameters. An error indicator allows adding new functions to the basis only if necessary. The gain of this strategy for studying the influence of material or loading variability reaches the order of 25 in the industrial examples that are presented. Copyright © 2015 John Wiley & Sons, Ltd.