SEARCH · Engineering Papers

Results for “Mesh Adaptivity”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,207 records · Page 67

All sources NASA NTRS DOE OSTI

DOE OSTI2011

Robust, multidimensional mesh motion based on Monge-Kantorovich equidistribution

Mesh-motion (r-refinement) grid adaptivity schemes are attractive due to their potential to minimize the numerical error for a prescribed number of degrees of freedom. However, a key roadblock to a widespread deployment of this class of techniques has been the formulation of robust, reliable mesh-motion governing principles, which (1) guarantee a solution in multiple dimensions (2D and 3D), (2) avoid grid tangling (or folding of the mesh, whereby edges of a grid cell cross somewhere in the domain), and (3) can be solved effectively and efficiently. In this study, we formulate such a mesh-motion governing principle, based on volume equidistribution via Monge-Kantorovich optimization (MK). In earlier publications [1] and [2], the advantages of this approach with regard to these points have been demonstrated for the time-independent case. In this study, we demonstrate that Monge-Kantorovich equidistribution can in fact be used effectively in a time-stepping context, and delivers an elegant solution to the otherwise pervasive problem of grid tangling in mesh-motion approaches, without resorting to ad hoc time-dependent terms (as in moving-mesh PDEs, or MMPDEs [3] and [4]). We explore two distinct r-refinement implementations of MK: the direct method, where the current mesh relates to an initial, unchanging mesh, and the sequential method, where the current mesh is related to the previous one in time. We demonstrate that the direct approach is superior with regard to mesh distortion and robustness. The properties of the approach are illustrated with a hyperbolic PDE, the advection of a passive scalar, in 2D and 3D. Velocity flow fields with and without flow shear are considered. Three-dimensional grid, time-step, and nonlinear tolerance convergence studies are presented which demonstrate the optimality of the approach.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2019

Mesh Generation for Microstructures

A parallel, adaptive overlay grid procedure is proposed for use in generating all-hex meshes for stochastic (SVE) and representative (RVE) volume elements in computational materials modeling. The mesh generation process is outlined including several new advancements such as data filtering to improve mesh quality from voxelated and 3D image sources, improvements to the primal contouring method for constructing material interfaces and pillowing to improve mesh quality at boundaries. We show specific examples in crystal plasticity and syntactic foam modeling that have benefitted from the proposed mesh generation procedure and illustrate results of the procedure with several practical mesh examples.

36 MATERIALS SCIENCE↗

DOE OSTI2018

Center for Extended Magnetohydrodynamic Modeling

The RPI team efforts focused on providing unstructured mesh technologies to the Center for Extended Magnetohydrodynamic Modeling’s efforts on the development of the M3D-C1 plasma physics code. Specific developments included: Providing the parallel unstructured mesh infrastructure used within the M3D-C1 code; Creating a tool for the generation and subsequent adaptation of the unstructured meshes; A set of procedures to be able to initiate an M3D-C1 simulation in 2D and automatically moving the simulation to a full 3D finite element model when 3D modes begin to appear; Developing a set of physics/mesh based diagonal preconditioners; Supporting the installation of M3D-C1 on various super computer systems; Supplementing the mesh generation procedures to support a model wall region to support the application of an advanced resistive wall model; Providing M3D-C1 with tools to support PIC operations on distributed meshes.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2015

An adaptive extended finite element method for the analysis of agglomeration of colloidal particles in a flowing fluid

Direct numerical simulations of the flow-nanoparticle interaction in a colloidal suspension are presented using an extended finite element method (XFEM) in which the dynamics of the nanoparticles is solved in a fully-coupled manner with the flow. The method is capable of accurately describing solid-fluid interfaces without the need of boundary-fitted meshes to investigate the dynamics of particles in complex flows. In order to accurately compute the high interparticle shear stresses and pressures while minimizing computing costs, an adaptive meshing technique is incorporated with the fluid-structure interaction algorithm. The particle-particle interaction at the microscopic level is modeled using the Lennard-Jones (LJ) potential and the corresponding potential parameters are determined by a scaling procedure. The study is relevant to the preparation of inks used in the fabrication of catalyst layers for fuel cells. In this paper, we are particularly interested in investigating agglomeration of the nanoparticles under external shear flow in a sliding bi-periodic Lees-Edwards frame. The results indicate that the external shear has a crucial impact on the structure formation of colloidal particles in a suspension.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2011

Extended Virtual Spring Mesh (EVSM): The Distributed Self-Organizing Mobile Ad Hoc Network for Area Exploration

Mobile Ad hoc NETworks (MANETs) are distributed self-organizing networks that can change locations and configure themselves on the fly. This paper focuses on an algorithmic approach for the deployment of a MANET within an enclosed area, such as a building in a disaster scenario, which can provide a robust communication infrastructure for search and rescue operations. While a virtual spring mesh (VSM) algorithm provides scalable, self-organizing, and fault-tolerant capabilities required by aMANET, the VSM lacks the MANET's capabilities of deployment mechanisms for blanket coverage of an area and does not provide an obstacle avoidance mechanism. This paper presents a new technique, an extended VSM (EVSM) algorithm that provides the following novelties: (1) new control laws for exploration and expansion to provide blanket coverage, (2) virtual adaptive springs enabling the mesh to expand as necessary, (3) adapts to communications disturbances by varying the density and movement of mobile nodes, and (4) new metrics to assess the performance of the EVSM algorithm. Simulation results show that EVSM provides up to 16% more coverage and is 3.5 times faster than VSM in environments with eight obstacles.

42 ENGINEERING↗

DOE OSTI2022

Sequential Decision Making (SDM) for Mesh Refinement and Model Selection in Multiscale, Multi-Physics Applications

Intelligent automation and decision support are needed to enhance computational efficiency and robustness in multiscale and multi-physics problems, including materials science, manufacturing, and climate and weather modeling. Current scientific computing approaches for enabling decisions by scientists fail to explore the role of learning, reasoning, and probabilistic planning. Often these decisions are not performed in real-time during the computation but are made prior to the start of the computation, which must be interrupted in order to make changes to the prior choices. Such interruptions at different stages of the computation increase the total computing time and the need for a human expert to frequently monitor the results. State of art scientific computing methods consist of rule-based algorithms that cannot automatically adapt to a dynamically changing computing environment. The development of a Sequential Decision Making (SDM) framework will automate scientific computing by optimizing the policies for mesh refinement, time-stepping, model and algorithm selection, resource allocation, and pre and post-processing. Our agent SDM framework for scientific computing will consist of data-driven learning (Classifier), automated reasoning (contextual knowledge), and probabilistic planning (Reinforcement Learning). In this project, we focused on three problems to demonstrate our SDM framework on a set of ordinary and partial differential equations. Classification of Lorenz system regions using Feed-Forward Neural Networks examined learning in the SDM framework. On the other hand, reasoning and planning in the SDM framework were used in two problems: adaptive time-stepping for nonlinear ODEs using on-policy RL algorithms, and adaptive mesh refinement for 2-D PDEs using off-policy RL algorithms.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1997

Aerodynamic Shape Sensitivity Analysis and Design Optimization of Complex Configurations Using Unstructured Grids

A three-dimensional unstructured grid approach to aerodynamic shape sensitivity analysis and design optimization has been developed and is extended to model geometrically complex configurations. The advantage of unstructured grids (when compared with a structured-grid approach) is their inherent ability to discretize irregularly shaped domains with greater efficiency and less effort. Hence, this approach is ideally suited for geometrically complex configurations of practical interest. In this work the nonlinear Euler equations are solved using an upwind, cell-centered, finite-volume scheme. The discrete, linearized systems which result from this scheme are solved iteratively by a preconditioned conjugate-gradient-like algorithm known as GMRES for the two-dimensional geometry and a Gauss-Seidel algorithm for the three-dimensional; similar procedures are used to solve the accompanying linear aerodynamic sensitivity equations in incremental iterative form. As shown, this particular form of the sensitivity equation makes large-scale gradient-based aerodynamic optimization possible by taking advantage of memory efficient methods to construct exact Jacobian matrix-vector products. Simple parameterization techniques are utilized for demonstrative purposes. Once the surface has been deformed, the unstructured grid is adapted by considering the mesh as a system of interconnected springs. Grid sensitivities are obtained by differentiating the surface parameterization and the grid adaptation algorithms with ADIFOR (which is an advanced automatic-differentiation software tool). To demonstrate the ability of this procedure to analyze and design complex configurations of practical interest, the sensitivity analysis and shape optimization has been performed for a two-dimensional high-lift multielement airfoil and for a three-dimensional Boeing 747-200 aircraft.

Taylor, Arthur C., III↗

DOE OSTI2020

A Virtual Element Method for the Full MHD system

In this manuscript we present a novel discretization for the incompressible MHD system. Our approach follows the framework of the Virtual Element Method and offers two main advantages. The method can be implemented in unstructured meshes making it highly versatile and capable of handling a wide array of problems involving interfaces, free-boundaries or adaptive refinements on the mesh. The second advantage involves the divergence of the magnetic field, our approach guarantees that it remains solenoidal. We include a theoretical proof of the condition on the magnetic field as well as energy estimates and a well-posedness study. The latter sheds light as to the stability properties of the method.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2019

Camellia: A Rapid Development Framework for Finite Element Solvers

We report the discontinuous Petrov–Galerkin (DPG) methodology of Demkowicz and Gopalakrishnan guarantees the optimality of the finite element solution in a user-controllable energy norm, and provides several features supporting adaptive schemes. The approach provides stability automatically; there is no need for carefully derived numerical fluxes (as in DG schemes) or for mesh-dependent stabilization terms (as in stabilized methods). In this paper, we focus on features of Camellia that facilitate implementation of new DPG formulations; chief among these is a rich set of features in support of symbolic manipulation, which allow, e.g., bilinear formulations in the code to appear much as they would on paper. Many of these features are general in the sense that they can also be used in the implementation of other finite element formulations. In fact, because DPG’s requirements are essentially a superset of those of other finite element methods, Camellia provides built-in support for most common methods. We believe, however, that the combination of an essentially “hands-free” finite element methodology as found in DPG with the rapid development features of Camellia are particularly winsome, so we focus on use cases in this class. In addition to the symbolic manipulation features mentioned above, Camellia offers support for one-irregular adaptive meshes in 1D, 2D, 3D, and space-time. It provides a geometric multigrid preconditioner particularly suited for DPG problems, and supports distributed parallel execution using MPI. For its load balancing and distributed data structures, Camellia relies on packages from the Trilinos project, which simplifies interfacing with other computational science packages. Camellia also allows loading of standard mesh formats through an interface with the MOAB package. Camellia includes support for static condensation to eliminate element-interior degrees of freedom locally, usually resulting in substantial reduction of the cost of the global problem. Finally, we include a discussion of the variational formulations built into Camellia, with references to those formulations in the literature, as well as an MPI performance study.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2012

Quadrilateral/hexahedral finite element mesh coarsening

A technique for coarsening a finite element mesh ("FEM") is described. This technique includes identifying a coarsening region within the FEM to be coarsened. Perimeter chords running along perimeter boundaries of the coarsening region are identified. The perimeter chords are redirected to create an adaptive chord separating the coarsening region from a remainder of the FEM. The adaptive chord runs through mesh elements residing along the perimeter boundaries of the coarsening region. The adaptive chord is then extracted to coarsen the FEM.

36 MATERIALS SCIENCE↗

DOE OSTI2021

Uniform Subspace Correction Preconditioners for Discontinuous Galerkin Methods with hp-Refinement

In this paper, we develop subspace correction preconditioners for discontinuous Galerkin (DG) discretizations of elliptic problems with hp-refinement. These preconditioners are based on the decomposition of the DG finite element space into a conforming subspace, and a set of small nonconforming edge spaces. The conforming subspace is preconditioned using a matrix-free low-order refined technique, which in this work, we extend to the hp-refinement context using a variational restriction approach. The condition number of the resulting linear system is independent of the granularity of the mesh h, and the degree of the polynomial approximation p. The method is amenable to use with meshes of any degree of irregularity and arbitrary distribution of polynomial degrees. Furthermore, numerical examples are shown on several test cases involving adaptively and randomly refined meshes, using both the symmetric interior penalty method and the second method of Bassi and Rebay (BR2).

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2015

Large-scale 3D geoelectromagnetic modeling using parallel adaptive high-order finite element method

Here, we have investigated the use of the adaptive high-order finite-element method (FEM) for geoelectromagnetic modeling. Because high-order FEM is challenging from the numerical and computational points of view, most published finite-element studies in geoelectromagnetics use the lowest order formulation. Solution of the resulting large system of linear equations poses the main practical challenge. We have developed a fully parallel and distributed robust and scalable linear solver based on the optimal block-diagonal and auxiliary space preconditioners. The solver was found to be efficient for high finite element orders, unstructured and nonconforming locally refined meshes, a wide range of frequencies, large conductivity contrasts, and number of degrees of freedom (DoFs). Furthermore, the presented linear solver is in essence algebraic; i.e., it acts on the matrix-vector level and thus requires no information about the discretization, boundary conditions, or physical source used, making it readily efficient for a wide range of electromagnetic modeling problems. To get accurate solutions at reduced computational cost, we have also implemented goal-oriented adaptive mesh refinement. The numerical tests indicated that if highly accurate modeling results were required, the high-order FEM in combination with the goal-oriented local mesh refinement required less computational time and DoFs than the lowest order adaptive FEM.

58 GEOSCIENCES↗

DOE OSTI2012

Modeling Fluid Flow in Domains Containing Moving Interfaces

Numerical simulations of fluid flow in domains containing moving rigid objects or boundaries are still challenging when meshes have to be adapted and periodically regenerated. A numerical strategy that falls into the general category of Arbitrary Lagrangian - Eulerian (ALE) methods is being developed. The method is based on a fixed mesh that is locally modified both in space and time to describe the moving interfaces which are allowed to move independently of the mesh. This results in a fully robust formulation capable of calculating in irregular meshes containing moving devises of complex geometry and free of mesh entanglement problems. The present work constitutes the first stage in the development of a three-dimensional model to interface with the new KIVA-hpFE simulator. The method’s accuracy has been assessed in two dimensions using a case that has an analytical solution.

02 PETROLEUM↗

DOE OSTI2020

Simulation-driven optimization of high-order meshes in ALE hydrodynamics

Here we propose tools for high-order mesh optimization and demonstrate their benefits in the context of multi-material Arbitrary Lagrangian-Eulerian (ALE) compressible shock hydrodynamic applications. The mesh optimization process is driven by information provided by the simulation which uses the optimized mesh, such as shock positions, material regions, known error estimates, etc. These simulation features are usually represented discretely, for instance, as finite element functions on the Lagrangian mesh. The discrete nature of the input is critical for the practical applicability of the algorithms we propose and distinguishes this work from approaches that strictly require analytical information. Our methods are based on node movement through a high-order extension of the Target-Matrix Optimization Paradigm (TMOP). The proposed formulation is fully algebraic and relies only on local Jacobian matrices, so it is applicable to all types of mesh elements, in 2D and 3D, and any order of the mesh. We discuss the notions of constructing adaptive target matrices and obtaining their derivatives, reconstructing discrete data in intermediate meshes, node limiting that enables improvement of global mesh quality while preserving space-dependent local mesh features, and appropriate normalization of the objective function. The adaptivity methods are combined with automatic ALE triggers that can provide robustness of the mesh evolution and avoid excessive remap procedures. The benefits of the new high-order TMOP technology are illustrated on several simulations performed in the high-order ALE application BLAST.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2015

Three-dimensional local ALE-FEM method for fluid flow in domains containing moving boundaries/objects interfaces

A three-dimensional finite element method for the numerical simulations of fluid flow in domains containing moving rigid objects or boundaries is developed. The method falls into the general category of Arbitrary Lagrangian Eulerian methods; it is based on a fixed mesh that is locally adapted in the immediate vicinity of the moving interfaces and reverts to its original shape once the moving interfaces go past the elements. The moving interfaces are defined by separate sets of marker points so that the global mesh is independent of interface movement and the possibility of mesh entanglement is eliminated. The results is a fully robust formulation capable of calculating on domains of complex geometry with moving boundaries or devises that can also have a complex geometry without danger of the mesh becoming unsuitable due to its continuous deformation thus eliminating the need for repeated re-meshing and interpolation. Moreover, the boundary conditions on the interfaces are imposed exactly. This work is intended to support the internal combustion engines simulator KIVA developed at Los Alamos National Laboratories. The model's capabilities are illustrated through application to incompressible flows in different geometrical settings that show the robustness and flexibility of the technique to perform simulations involving moving boundaries in a three-dimensional domain.

16 TIDAL AND WAVE POWER↗

DOE OSTI2016

A template-based approach for parallel hexahedral two-refinement

Here, we provide a template-based approach for generating locally refined all-hex meshes. We focus specifically on refinement of initially structured grids utilizing a 2-refinement approach where uniformly refined hexes are subdivided into eight child elements. The refinement algorithm consists of identifying marked nodes that are used as the basis for a set of four simple refinement templates. The target application for 2-refinement is a parallel grid-based all-hex meshing tool for high performance computing in a distributed environment. The result is a parallel consistent locally refined mesh requiring minimal communication and where minimum mesh quality is greater than scaled Jacobian 0.3 prior to smoothing.

2-refinement↗

DOE OSTI2019

The Target-Matrix Optimization Paradigm for High-Order Meshes

Here, we describe a framework for controlling and improving the quality of high-order finite element meshes based on extensions of the Target-Matrix Optimization Paradigm (TMOP) of [P. Knupp, Eng. Comput., 28 (2012), pp. 419--429]. This approach allows high-order applications to have a very precise control over local mesh quality, while still improving the mesh globally. We address the adaption of various TMOP components to the settings of general isoparametric element mappings, including the mesh quality metric in 2D and 3D, the selection of sample points and the solution of the resulting mesh optimization problem. We also investigate additional practical concerns, such as tangential relaxation and restricting the deviation from the original mesh. The benefits of the new high-order TMOP algorithms are illustrated on a number of test problems and examples from a high-order arbitrary Lagrangian--Eulerian (ALE) application [BLAST: High-order curvilinear finite elements for shock hydrodynamics, http://www.llnl.gov/CASC/blast]. Our implementation is freely available in an open-source library form [MFEM: Modular parallel finite element methods library, http://mfem.org].

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2016

Balancing Particle and Mesh Computation in a Particle-In-Cell Code

The XGC1 plasma microturbulence particle-in-cell simulation code has both particle-based and mesh-based computational kernels that dominate performance. Both of these are subject to load imbalances that can degrade performance and that evolve during a simulation. Each separately can be addressed adequately, but optimizing just for one can introduce significant load imbalances in the other, degrading overall performance. A technique has been developed based on Golden Section Search that minimizes wallclock time given prior information on wallclock time, and on current particle distribution and mesh cost per cell, and also adapts to evolution in load imbalance in both particle and mesh work. In problems of interest this doubled the performance on full system runs on the XK7 at the Oak Ridge Leadership Computing Facility compared to load balancing only one of the kernels.

Worley, Patrick H↗