Search NASA⌕ Search

SEARCH · Search NASA

Results for “Unstructured”

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.

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

At least 919 records · Page 51

A coupled ALE-AMR method for shock hydrodynamics

We present a numerical method combining adaptive mesh refinement (AMR) with arbitrary Lagrangian-Eulerian (ALE) mesh motion for the simulation of shock hydrodynamics on unstructured grids. The primary goal of the coupled method is to use AMR to reduce numerical error in ALE simulations at reduced computational expense relative to uniform fine mesh calculations, in the same manner that AMR has been used in Eulerian simulations. We also identify deficiencies with ALE methods that AMR is able to mitigate, and discuss the unique coupling challenges. The coupled method is demonstrated using three-dimensional unstructured meshes of up to O(10 7 ) tetrahedral cells. Convergence of ALE-AMR solutions towards both uniform fine mesh ALE results and analytic solutions is demonstrated. Speed-ups of 5-10× for a given level of error are observed relative to uniform fine mesh calculations.

42 ENGINEERING↗

Multi-material hydrodynamics with algebraic sharp interface capturing

A finite volume method for Eulerian multi-material hydrodynamics with sharp interface capturing is presented here. The pressure-temperature non-equilibrium multi-material system with finite-rate pressure relaxation in mixed-cells is considered here. This pressure closure facilitates material-property-dependent pressure relaxation, rather than instantaneous pressure equilibration, which in turn allows the use of unsplit high-order time-integrators. A modified tangent of hyperbola for interface capturing (THINC) method is used to reconstruct multi-material (> 2) interfaces, on three-dimensional unstructured meshes. A simple modification which extends the THINC reconstruction to interfaces between more than two materials is proposed. It is demonstrated that the modified THINC can capture multi-material interfaces within 2–4 tetrahedral cells. Since no geometric reconstructions are required by the THINC method, the presented multi-material method is algorithmically simple, and computationally efficient. Consistent reconstructions of conserved quantities at material interfaces ensure that conservation and closure laws are satisfied at the discrete level. Through a suite of test problems solved on unstructured meshes, it is demonstrated that the presented method is a promising candidate for accurate and efficient multi-material hydrodynamics computations.

97 MATHEMATICS AND COMPUTING↗

An efficient reconstruction algorithm for diffusion on triangular grids using the nodal discontinuous Galerkin method

High-energy-density (HED) hydrodynamics studies such as those relevant to inertial confinement fusion and astrophysics require highly disparate densities, temperatures, viscosities, and other diffusion parameters over relatively short spatial scales. This presents a challenge for high-order accurate methods to effectively resolve the hydrodynamics at these scales, particularly in the presence of highly disparate diffusion. A significant volume of engineering and physics applications use an unstructured discontinuous Galerkin (DG) method developed based on the finite element mesh generation and algorithmic framework. This work discusses the application of an affine reconstructed nodal DG method for unstructured grids of triangles. Solving the diffusion terms in the DG method is non-trivial due to the solution representations being piecewise continuous. Hence, the diffusive flux is not defined on the interface of elements. The proposed numerical approach reconstructs a smooth solution in a parallelogram that is enclosed by the quadrilateral formed by two adjacent triangle elements. The interface between these two triangles is the diagonal of the enclosed parallelogram. Similar to triangles, the mapping of parallelograms from a physical domain to a reference domain is an affine mapping, which is necessary for an accurate and efficient implementation of the numerical algorithm. Thus, all computations can still be performed on the reference domain, which promotes efficiency in computation and storage. This reconstruction does not make assumptions on choice of polynomial basis. Reconstructed DG algorithms have previously been developed for modal implementations of the convection–diffusion equations. However, to the best of the authors’ knowledge, this is the first practical guideline that has been proposed for applying the reconstructed algorithm on a nodal discontinuous Galerkin method with a focus on accuracy and efficiency. As a result, the algorithm is demonstrated on a number of benchmark cases as well as a challenging substantive problem in HED hydrodynamics with highly disparate diffusion parameters.

Computational efficiency↗

Efficient exascale discretizations: High-order finite element methods

Efficient exploitation of exascale architectures requires rethinking of the numerical algorithms used in many large-scale applications. These architectures favor algorithms that expose ultra fine-grain parallelism and maximize the ratio of floating point operations to energy intensive data movement. One of the few viable approaches to achieve high efficiency in the area of PDE discretizations on unstructured grids is to use matrix-free/partially assembled high-order finite element methods, since these methods can increase the accuracy and/or lower the computational time due to reduced data motion. In this paper we provide an overview of the research and development activities in the Center for Efficient Exascale Discretizations (CEED), a co-design center in the Exascale Computing Project that is focused on the development of next-generation discretization software and algorithms to enable a wide range of finite element applications to run efficiently on future hardware. CEED is a research partnership involving more than 30 computational scientists from two US national labs and five universities, including members of the Nek5000, MFEM, MAGMA and PETSc projects. We discuss the CEED co-design activities based on targeted benchmarks, miniapps and discretization libraries and our work on performance optimizations for large-scale GPU architectures. We also provide a broad overview of research and development activities in areas such as unstructured adaptive mesh refinement algorithms, matrix-free linear solvers, high-order data visualization, and list examples of collaborations with several ECP and external applications.

97 MATHEMATICS AND COMPUTING↗

Assessing a mini-application as a performance proxy for a finite element method engineering application

The performance of a large-scale, production-quality science and engineering application (‘app’) is often dominated by a small subset of the code. Even within that subset, computational and data access patterns are often repeated, so that an even smaller portion can represent the performance-impacting features. If application developers, parallel computing experts, and computer architects can together identify this representative subset and then develop a small mini-application (‘miniapp’) that can capture these primary performance characteristics, then this miniapp can be used to both improve the performance of the app as well as provide a tool for co-design for the high-performance computing community. However, a critical question is whether a miniapp can effectively capture key performance behavior of an app. This study provides a comparison of an implicit finite element semiconductor device modeling app on unstructured meshes with an implicit finite element miniapp on unstructured meshes. The goal is to assess whether the miniapp is predictive of the performance of the app. Finally, single compute node performance will be compared, as well as scaling up to 16,000 cores. Results indicate that the miniapp can be reasonably predictive of the performance characteristics of the app for a single iteration of the solver on a single compute node.

97 MATHEMATICS AND COMPUTING↗

An efficient time-domain perfectly matched layers formulation for elastodynamics on spherical domains

Many practical applications require the analysis of elastic wave propagation in a homogeneous isotropic media in an unbounded domain. One widely used approach for truncating the infinite domain is the so called method of perfectly matched layers (PMLs). Most existing PML formulations are developed for finite difference methods based on the first-order velocity-stress form of the elasticity equations, and they are not straight-forward to implement using standard finite element methods (FEMs) on unstructured meshes. Some of the problems with these formulations include the application of boundary conditions in half-space problems and in the treatment of edges and/or corners for time-domain problems. Several PML formulations, which do work with FEMs have been proposed, although most of them still have some of these problems and/or they require a large number of auxiliary nodal history/memory variables. Here in this work, we develop a new PML formulation for time-domain elastodynamics on a spherical domain, which reduces to a two-dimensional formulation under the assumption of axisymmetry. Our formulation is well-suited for implementation using FEMs, where it requires lower memory than existing formulations, and it allows for natural application of boundary conditions. We solve example problems on two-dimensional and three-dimensional domains using a high-order discontinuous Galerkin (DG) discretization on unstructured meshes and explicit time-stepping. We also study an approach for stabilization of the discrete equations, and we show several practical applications for quality factor predictions of micromechanical resonators along with verifying the accuracy and versatility of our formulation.

42 ENGINEERING↗

Maintaining Trust in Reduction: Preserving the Accuracy of Quantities of Interest for Lossy Compression

As the growth of data sizes continues to outpace computational resources, there is a pressing need for data reduction techniques that can significantly reduce the amount of data and quantify the error incurred in compression. Compressing scientific data presents many challenges for reduction techniques since it is often on non-uniform or unstructured meshes, is from a high-dimensional space, and has many Quantities of Interests (QoIs) that need to be preserved. To illustrate these challenges, we focus on data from a large scale fusion code, XGC. XGC uses a Particle-In-Cell (PIC) technique which generates hundreds of PetaBytes (PBs) of data a day, from thousands of timesteps. XGC uses an unstructured mesh, and needs to compute many QoIs from the raw data, f.One critical aspect of the reduction is that we need to ensure that QoIs derived from the data (density, temperature, flux surface averaged momentums, etc.) maintain a relative high accuracy. We show that by compressing XGC data on the high-dimensional, nonuniform grid on which the data is defined, and adaptively quantizing the decomposed coefficients based on the characteristics of the QoIs, the compression ratios at various error tolerances obtained using a multilevel compressor (MGARD) increases more than ten times. We then present how to mathematically guarantee that the accuracy of the QoIs computed from the reduced f is preserved during the compression. We show that the error in the XGC density can be kept under a user-specified tolerance over 1000 timesteps of simulation using the mathematical QoI error control theory of MGARD, whereas traditional error control on the data to be reduced does not guarantee the accuracy of the QoIs.

Gong, Qian↗

Integrating Natural Language Processing and Machine Learning Algorithms to Categorize Oncologic Response in Radiology Reports

A significant volume of medical data remains unstructured. Natural language processing (NLP) and machine learning (ML) techniques have shown to successfully extract insights from radiology reports. However, the codependent effects of NLP and ML in this context have not been well-studied. Between April 1, 2015 and November 1, 2016, 9418 cross-sectional abdomen/pelvis CT and MR examinations containing our internal structured reporting element for cancer were separated into four categories: Progression, Stable Disease, Improvement, or No Cancer. We combined each of three NLP techniques with five ML algorithms to predict the assigned label using the unstructured report text and compared the performance of each combination. The three NLP algorithms included term frequency-inverse document frequency (TF-IDF), term frequency weighting (TF), and 16-bit feature hashing. The ML algorithms included logistic regression (LR), random decision forest (RDF), one-vs-all support vector machine (SVM), one-vs-all Bayes point machine (BPM), and fully connected neural network (NN). The best-performing NLP model consisted of tokenized unigrams and bigrams with TF-IDF. Increasing N-gram length yielded little to no added benefit for most ML algorithms. With all parameters optimized, SVM had the best performance on the test dataset, with 90.6 average accuracy and F score of 0.813. The interplay between ML and NLP algorithms and their effect on interpretation accuracy is complex. The best accuracy is achieved when both algorithms are optimized concurrently.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Structural determination of a full-length plant cellulose synthase informed by experimental and in silico methods

Three-dimensional structure determination and prediction of proteins with intrinsically disordered regions, unstructured regions, conformational flexibility, and lacking homologous structures are challenging. We previously predicted and refined an in silico structure of a plant cellulose synthase from cotton (GhCESA1), and more recently, cryo-electron microscopy (cryo-EM) has resolved a majority of the lengths of two CESA structures from poplar (PttCESA8) and cotton (GhCESA7). However, 26–30% of these cryo-EM structures remain unresolved, including the N-terminal domain, half of the class-specific region, the gating loop region, and the C-terminal domain. Here, we describe the generation and evaluation of a full-length hybrid GhCESA1 model based on this cryo-EM PttCESA8 structure, with unresolved regions completed using this in silico refined GhCESA1 model. All-atom molecular dynamics simulations and subsequent energy minimizations were performed for the in silico and hybrid GhCESA1 models in a lipid bilayer-water-ion environment, and structural stability, dynamics, energetics, contacts, and quality were evaluated. The unresolved regions were found to be the most dynamic, in agreement with their poor electron density with cryo-EM. The hybrid model exhibited a higher total secondary structure content, more favorable intra-protein and protein-lipid interaction energies, and improved quality metrics. Moreover, hydrogen bonding was revealed to be a primary mechanism for intra-protein and protein-lipid contacts. These results demonstrate that in silico structure prediction and refinement may be useful to augment experimental structure determination, especially for disordered and unstructured regions. Furthermore, this hybrid model can serve as a steppingstone to derive full-length homology models of other CESAs found in more experimentally tractable organisms.

59 BASIC BIOLOGICAL SCIENCES↗

Particle tracking approach for transport in three-dimensional discrete fracture networks: Particle tracking in 3-D DFNs

The discrete fracture network (DFN) model is a method to mimic discrete pathways for fluid flow through a fractured low-permeable rock mass, and may be combined with particle tracking simulations to address solute transport. However, experience has shown that it is challenging to obtain accurate transport results in three-dimensional DFNs because of the high computational burden and difficulty in constructing a high-quality unstructured computational mesh on simulated fractures. We present a new particle tracking capability, which is adapted to control volume (Voronoi polygons) flow solutions on unstructured grids (Delaunay triangulations) on three-dimensional DFNs. The locally mass-conserving finite-volume approach eliminates mass balance-related problems during particle tracking. The scalar fluxes calculated for each control volume face by the flow solver are used to reconstruct a Darcy velocity at each control volume centroid. The groundwater velocities can then be continuously interpolated to any point in the domain of interest. The control volumes at fracture intersections are split into four pieces, and the velocity is reconstructed independently on each piece, which results in multiple groundwater velocities at the intersection, one for each fracture on each side of the intersection line. This technique enables detailed particle transport representation through a complex DFN structure. Verified for small DFNs, the new simulation capability enables numerical experiments on advective transport in large DFNs to be performed. As a result, we demonstrate this particle transport approach on a DFN model using parameters similar to those of crystalline rock at a proposed geologic repository for spent nuclear fuel in Forsmark, Sweden.

58 GEOSCIENCES↗

Local Decomposition of Hexahedral Singular Nodes into Singular Curves

Hexahedral (hex) meshing is a long studied topic in geometry processing with many challenging associated problems. Hex meshes vary from structured to unstructured depending on application or domain of interest. Fully structured meshes require that all interior mesh edges be adjacent to four hexes each. Edges failing this criteria are singular and indicate an unstructured hex mesh. Singular edges join together into singular curves that either form closed cycles, end on the mesh boundary, or end at a singular node, a complex junction of more than two singular curves. Hex meshes with more complex singular nodes tend to have more distorted elements and smaller scaled Jacobian values. In this work, we study the topology of singular nodes. We show that all eight of the most common singular nodes are decomposable into just singular curves. We further show that all singular nodes, regardless of edge valence, are locally decomposable. Finally we demonstrate these decompositions on hex meshes, thereby decreasing their distortion and converting all singular nodes into singular curves. In conclusion, with this decomposition, the enigmatic complexity of 3D singular nodes becomes effectively 2D.

97 MATHEMATICS AND COMPUTING↗

An immersed interface method for microstructure-scale electrochemical battery models: numerical formulation and performance portable implementation

We present the numerical formulation, verification, and performance portable implementation of an immersed interface method for microstructure scale electrochemical modeling of batteries. The innovation in this approach is the resolution of chemical species and electrostatic potential discontinuities at active interfaces without the use of interface conforming unstructured grids. A unified formulation on Cartesian grids for all domains (electrodes and electrolyte) is used with interfacial flux conditions applied using volume fraction or “color” function gradients. We have developed one dimensional and two dimensional test cases with analytic solutions for electrochemical modeling using which we verified the consistency and accuracy of our scheme. Our solver is also validated against solutions from a macroscale model and an unstructured multi-subdomain solver for a full lithium ion cell. We then demonstrated the utility of our solver on an image-based complex battery electrode microstructure at high charging rate. Our technique also exhibits good scalability on distributed memory architectures using central processing units (CPU), with problem sizes up to 1.8 billion degrees of freedom and with 5400 ranks. Initial performance studies of our open-source performance portable solver showed about 70 times speed up using a graphics processing unit (GPU) compared to single compute core for a problem with 4 million cells.

25 ENERGY STORAGE↗

Reissner-Mindlin Legendre Spectral Finite Elements with Mixed Reduced Quadrature

Legendre spectral finite elements (LSFEs) are examined through numerical experiments for static and dynamic Reissner-Mindlin plate bending and a mixed-quadrature scheme is proposed. LSFEs are high-order Lagrangian-interpolant finite elements with nodes located at the Gauss-Lobatto-Legendre quadrature points. Solutions on unstructured meshes are examined in terms of accuracy as a function of the number of model nodes and total operations. While nodal-quadrature LSFEs have been shown elsewhere to be free of shear locking on structured grids, locking is demonstrated here on unstructured grids. LSFEs with mixed quadrature are, however, locking free and are significantly more accurate than low-order finite-elements for a given model size or total computation time.

97 MATHEMATICS AND COMPUTING↗

Simple and efficient relaxation methods for interfaces separating compressible fluids, cavitating flows and shocks in multiphase mixtures

Numerical approximation of the five-equation two-phase flow of Kapila et al. [A.K. Kapila, R. Menikoff, J.B. Bdzil, S.F. Son, D.S. Stewart, Two-phase modeling of deflagration-to-detonation transition in granular materials: reduced equations, Physics of Fluids 13(10) (2001) 3002-3024] is examined. This model has shown excellent capabilities for the numerical resolution of interfaces separating compressible fluids as well as wave propagation in compressible mixtures [A. Murrone, H. Guillard, A five equation reduced model for compressible two phase flow problems, Journal of Computational Physics 202(2) (2005) 664-698; R. Abgrall, V. Perrier, Asymptotic expansion of a multiscale numerical scheme for compressible multiphase flows, SIAM Journal of Multiscale and Modeling and Simulation (5) (2006) 84-115; F. Petitpas, E. Franquet, R. Saurel, O. Le Metayer, A relaxation-projection method for compressible flows. Part II. The artificial heat exchange for multiphase shocks, Journal of Computational Physics 225(2) (2007) 2214-2248]. However, its numerical approximation poses some serious difficulties. Among them, the non-monotonic behavior of the sound speed causes inaccuracies in wave's transmission across interfaces. Moreover, volume fraction variation across acoustic waves results in difficulties for the Riemann problem resolution, and in particular for the derivation of approximate solvers. Volume fraction positivity in the presence of shocks or strong expansion waves is another issue resulting in lack of robustness. To circumvent these difficulties, the pressure equilibrium assumption is relaxed and a pressure non-equilibrium model is developed. It results in a single velocity, non-conservative hyperbolic model with two energy equations involving relaxation terms. It fulfills the equation of state and energy conservation on both sides of interfaces and guarantees correct transmission of shocks across them. This formulation considerably simplifies numerical resolution. Following a strategy developed previously for another flow model [R. Saurel, R. Abgrall, A multiphase Godunov method for multifluid and multiphase flows, Journal of Computational Physics 150 (1999) 425-467], the hyperbolic part is first solved without relaxation terms with a simple, fast and robust algorithm, valid for unstructured meshes. Second, stiff relaxation terms are solved with a Newton method that also guarantees positivity and robustness. The algorithm and model are compared to exact solutions of the Euler equations as well as solutions of the five-equation model under extreme flow conditions, for interface computation and cavitating flows involving dynamics appearance of interfaces. In order to deal with correct dynamic of shock waves propagating through multiphase mixtures, the artificial heat exchange method of Petitpas et al. [F. Petitpas, E. Franquet, R. Saurel, O. Le Metayer, A relaxation-projection method for compressible flows. Part II. The artificial heat exchange for multiphase shocks, Journal of Computational Physics 225(2) (2007) 2214-2248] is adapted to the present formulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On using moving windows in finite element time domain simulation for long accelerator structures

A finite element moving window technique is developed to simulate the propagation of electromagnetic waves induced by the transit of a charged particle beam inside large and long structures. The window moving along with the beam in the computational domain adopts high-order finite element basis functions through p refinement and/or a high-resolution mesh through h refinement so that a sufficient accuracy is attained with substantially reduced computational costs. Algorithms to transfer discretized fields from one mesh to another, which are the keys to implementing a moving window in a finite element unstructured mesh, are presented. Numerical experiments are carried out using the moving window technique to compute short-range wakefields in long accelerator structures. The results are compared with those obtained from the normal finite element time domain (FETD) method and the advantages of using the moving window technique are discussed.

97 MATHEMATICS AND COMPUTING↗

A discontinuous Galerkin method for gravity-driven viscous fingering instabilities in porous media

We present a new approach to the simulation of gravity-driven viscous fingering instabilities in porous media flow. These instabilities play a very important role during carbon sequestration processes in brine aquifers. Our approach is based on a nonlinear implementation of the discontinuous Galerkin method, and possesses a number of key features. First, the method developed is inherently high order, and is therefore well suited to study unstable flow mechanisms. Secondly, it maintains high-order accuracy on completely unstructured meshes. The combination of these two features makes it a very appealing strategy in simulating the challenging flow patterns and very complex geometries of actual reservoirs and aquifers. This article includes an extensive set of verification studies on the stability and accuracy of the method, and also features a number of computations with unstructured grids and non-standard geometries.

97 MATHEMATICS AND COMPUTING↗

A multiscale two-point flux-approximation method

A large number of multiscale finite-volume methods have been developed over the past decade to compute conservative approximations to multiphase flow problems in heterogeneous porous media. In particular, several iterative and algebraic multiscale frameworks that seek to reduce the fine-scale residual towards machine precision have been presented. Common for all such methods is that they rely on a compatible primal–dual coarse partition, which makes it challenging to extend them to stratigraphic and unstructured grids. Herein, we propose a general idea for how one can formulate multiscale finite-volume methods using only a primal coarse partition. To this end, we use two key ingredients that are computed numerically: (i) elementary functions that correspond to flow solutions used in transmissibility upscaling, and (ii) partition-of-unity functions used to combine elementary functions into basis functions. We exemplify the idea by deriving a multiscale two-point flux-approximation (MsTPFA) method, which is robust with regards to strong heterogeneities in the permeability field and can easily handle general grids with unstructured fine- and coarse-scale connections. The method can easily be adapted to arbitrary levels of coarsening, and can be used both as a standalone solver and as a preconditioner. Several numerical experiments are presented to demonstrate that the MsTPFA method can be used to solve elliptic pressure problems on a wide variety of geological models in a robust and efficient manner.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A subzone reconstruction algorithm for efficient staggered compatible remapping

Staggered-grid Lagrangian hydrodynamics algorithms frequently make use of subzonal discretization of state variables for the purposes of improved numerical accuracy, generality to unstructured meshes, and exact conservation of mass, momentum, and energy. For Arbitrary Lagrangian–Eulerian (ALE) methods using a geometric overlay, it is difficult to remap subzonal variables in an accurate and efficient manner due to the number of subzone–subzone intersections that must be computed. This becomes prohibitive in the case of 3D, unstructured, polyhedral meshes. A new procedure is outlined in this paper to avoid direct subzonal remapping. The new algorithm reconstructs the spatial profile of a subzonal variable using remapped zonal and nodal representations of the data. The reconstruction procedure is cast as an under-constrained optimization problem. Enforcing conservation at each zone and node on the remapped mesh provides the set of equality constraints; the objective function corresponds to a quadratic variation per subzone between the values to be reconstructed and a set of target reference values. Numerical results for various pure-remapping and hydrodynamics tests are provided. Ideas for extending the algorithm to staggered-grid radiation-hydrodynamics are discussed as well as ideas for generalizing the algorithm to include inequality constraints.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗