Search NASA⌕ Search

SEARCH · Search NASA

Results for “Mesh Optimization”

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 649 records · Page 36

Reinforcement learning for block decomposition of planar CAD models

Abstract The problem of hexahedral mesh generation of general CAD models has vexed researchers for over 3 decades and analysts often spend more than 50% of the design-analysis cycle time decomposing complex models into simpler blocks meshable by existing techniques. The decomposed blocks are required for generating good quality meshes (tilings of quadrilaterals or hexahedra) suitable for numerical simulations of physical systems governed by conservation laws. We present a novel AI-assisted method for decomposing (segmenting) planar CAD (computer-aided design) models into well shaped rectangular blocks. Even though the simple examples presented here can also be meshed using many conventional methods, we believe this work is proof-of-principle of a AI-based decomposition method that can eventually be generalized to complex 2D and 3D CAD models. Our method uses reinforcement learning to train an agent to perform a series of optimal cuts on the CAD model that result in a good quality block decomposition. We show that the agent quickly learns an effective strategy for picking the location and direction of the cuts and maximizing its rewards. This paper is the first successful demonstration of an agent autonomously learning how to perform this block decomposition task effectively, thereby holding the promise of a viable method to automate this challenging process for more complex cases.

97 MATHEMATICS AND COMPUTING↗

Stress-hybrid virtual element method on six-noded triangular meshes for compressible and nearly-incompressible linear elasticity

In this paper, we present a first-order Stress-Hybrid Virtual Element Method (SH-VEM) on six-noded triangular meshes for linear plane elasticity. Here, we adopt the Hellinger–Reissner variational principle to construct a weak equilibrium condition and a stress based projection operator. In each element, the stress projection operator is expressed in terms of the nodal displacements, which leads to a displacement based formulation. This stress-hybrid approach assumes a globally continuous displacement field while the stress field is discontinuous across each element. The stress field is initially represented by divergence-free tensor polynomials based on Airy stress functions, but we also present a formulation that uses a penalty term to enforce the element equilibrium conditions, referred to as the Penalty Stress-Hybrid Virtual Element Method (PSH-VEM). Numerical results are presented for PSH-VEM and SH-VEM, and we compare their convergence to the composite triangle FEM and B-bar VEM on benchmark problems in linear elasticity. The SH-VEM converges optimally in the L 2 norm of the displacement, energy seminorm, and the L 2 norm of hydrostatic stress. Furthermore, the results reveal that PSH-VEM converges in most cases at a faster rate than the expected optimal rate, but it requires the selection of a suitably chosen penalty parameter.

42 ENGINEERING↗

The Role and Value of Interregional Transmission in a Decarbonized U.S. Electricity System

Decarbonizing the U.S. energy system entails a significant expansion of wind and solar power and electrification of end-use applications. Achieving both is more efficient and less costly when interregional transmission capacity is expanded, but the fractured nature of grid planning in the United States is often a barrier to such expansion. Here, we explore the role of interregional transmission under a variety of decarbonization scenarios, using a capacity-expansion model to generate co-optimized portfolios of generation, storage, and transmission that meet decarbonization targets and electrification-driven demand. We explore portfolio and cost differences across 92 scenarios, from scenarios with limited transmission expansion to those that include a meshed high-voltage direct current (HVDC) network. In the core decarbonization scenarios, wind capacity expands by ~10x and solar by ~20x compared to 2020, hundreds of gigawatts of battery storage are deployed, and interregional transmission expands by 3-6x. Transmission expansion occurs nationwide but is concentrated between the central "wind belt" and eastern load centers. The HVDC scenarios result in hundreds of billions of dollars of savings in total system cost, demonstrating the economic benefits of interregional transmission in support of rapid decarbonization.

capacity expansion↗

Criticality Accident Alarm System Modeling with SCALE

Criticality accident alarm systems (CAAS) can be difficult to analyze since they consist of both criticality calculations and deep-penetration radiation transport calculations. Radiation transport codes are typically optimized for one of those two aspects but not both. A three-dimensional CAAS modeling capability within SCALE 6 has been created by linking the KENO-VI criticality code to the MAVRIC shielding sequence. KENO-VI has been optimized for criticality calculations and used for over 20 years. MAVRIC is a new sequence in SCALE 6 designed for radiation transport in deep-penetration problems. MAVRIC contains features such as automated variance reduction and mesh tally capabilities, which are quite useful in CAAS modeling.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Reduced Navier Stokes Relaxation Procedures for Internal Flows

In spite of significant advancement in the field of high speed computing, flow calculations involving complex geometries and/or flow behavior still require large amounts of CPU time and memory. In order to predict such flows without sacrificing grid convergence and accuracy, adaptive gridding techniques that provide optimal resolution are highly desirable. The present work combines multigrid techniques and domain decomposition concepts to provide local, solution adaptive, grid refinement. Several viscous compressible and incompressible, two and three-dimensional, flows with strong inviscid interaction and/or axial flow reversal, are considered with a segmented multigrid domain decomposition (SMGDD) procedure for which uniform meshes result in each domain. A pressure-based form of flux-vector splitting is applied to the Navier-Stokes equations, which are represented by an implicit lowest-order reduced Navier-Stokes (RNS) system and a purely diffusive, higher-order, deferred-corrector. A trapezoidal or box-like form of discretization insures that all mass conservation properties are satisfied at interfacial and outflow boundaries, even for this primitive-variable non-staggered grid computation. The SMGDD technique presented herein has previously been applied for incompressible two dimensional flows. The present work offers improvement in the gridding strategy, by allowing for disjoint subdomains that provide optimal resolution of disparate flow features. It also extends the SMGDD technique to three dimensional compressible flows. Laminar and turbulent flow in a backward facing step channel is considered; although the procedure is applicable to more severe geometries. The standard K-epsilon model is applied for turbulence closure. For Re greater than 400, differences between two-dimensional theory and experiment are resolved through a three dimensional simulation, which confirms the experimentally observed three dimensionality of the recirculation patterns on the upper and lower surfaces.

Rubin, Stanley G.↗

A Testbed of Parallel Kernels for Computer Science Research

For several decades, computer scientists have sought guidance on how to evolve architectures, languages, and programming models for optimal performance, efficiency, and productivity. Unfortunately, this guidance is most often taken from the existing software/hardware ecosystem. Architects attempt to provide micro-architectural solutions to improve performance on fixed binaries. Researchers tweak compilers to improve code generation for existing architectures and implementations, and they may invent new programming models for fixed processor and memory architectures and computational algorithms. In today's rapidly evolving world of on-chip parallelism, these isolated and iterative improvements to performance may miss superior solutions in the same way gradient descent optimization techniques may get stuck in local minima. In an initial study, we have developed an alternate approach that, rather than starting with an existing hardware/software solution laced with hidden assumptions, defines the computational problems of interest and invites architects, researchers and programmers to implement novel hardware/ software co-designed solutions. Our work builds on the previous ideas of computational dwarfs, motifs, and parallel patterns by selecting a representative set of essential problems for which we provide: An algorithmic description; scalable problem definition; illustrative reference implementations; verification schemes. For simplicity, we focus initially on the computational problems of interest to the scientific computing community but proclaim the methodology (and perhaps a subset of the problems) as applicable to other communities. We intend to broaden the coverage of this problem space through stronger community involvement. Previous work has established a broad categorization of numerical methods of interest to the scientific computing, in the spirit of the NAS Benchmarks, which pioneered the basic idea of a 'pencil and paper benchmark' in the 1990s. The initial result of the more modern study was the seven dwarfs, which was subsequently extended to 13 motifs. These motifs have already been useful in defining classes of applications for architecture-software studies. However, these broad-brush problem statements often miss the nuance seen in individual kernels. For example, the computational requirements of particle methods vary greatly between the naive (but more accurate) direct calculations and the particle-mesh and particle-tree codes. Thus we commenced our study with an enumeration of problems, but then proceeded by providing not only reference implementations for each problem, but more importantly a mathematical definition that allows one to escape iterative approaches to software/hardware optimization. To ensure long term value, we have augmented each of our reference implementations with both a scalable problem generator and a verification scheme. In a paper we have prepared that documents our efforts, we describe in detail this process of problem definition, scalable input creation, verification, and implementation of reference codes for the scientific computing domain. Table 1 enumerates and describes the level of support we've developed for each kernel. We group these important kernels using the Berkeley dwarfs/motifs taxonomy using a red box in the appropriate column. As kernels become progressively complex, they build upon other, simpler computational methods. We note this dependency via orange boxes. After enumeration of the important numerical problems, we created a domain-appropriate high-level definition of each problem. To ensure future endeavors are not tainted by existing implementations, we specified the problem definition to be independent of both computer architecture and existing programming languages, models, and data types. Then, to provide context as to how such kernels productively map to existing architectures, languages and programming models, we produced reference implementations for most of the kernel (see table). These sample codes should be viewed as 'hints,' designed to show how other designers have mapped a problem's operands and operators to existing hardware and software. Since we wanted such implementations to be illustrative, we tried to ensure they were the most straightforward implementation in the easiest to understand languages using familiar architectures. To that end, most of the linear algebra-oriented computations are written in MATLAB using array indexing to process matrices, rather than one-line library calls to compute the same kernel. This ensures that the kernel's computation is explicit and readable in the implementation and not hidden behind a library. For other problems, such as the Barnes-Hut n-Body solver, the implementations were written in pure C, without any supporting library computations. Along this line, we have also created a scalable problem generator to accompany each computation.

97 MATHEMATICS AND COMPUTING↗

On the Derivation of Quasi-Newton Formulas for Optimization in Function Spaces

Newton’s method is usually preferred when solving optimization problems due to its superior convergence properties compared to gradient-based or derivative-free optimization algorithms. However, deriving and computing second-order derivatives needed by Newton’s method often is not trivial and, in some cases, not possible. In such cases quasi-Newton algorithms are a great alternative. In this paper, we provide a new derivation of well-known quasi-Newton formulas in an infinite-dimensional Hilbert space setting. Furthermore, it is known that quasi-Newton update formulas are solutions to certain variational problems over the space of symmetric matrices. In this paper, we formulate similar variational problems over the space of bounded symmetric operators in Hilbert spaces. By changing the constraints of the variational problem we obtain updates (for the Hessian and Hessian inverse) not only for the Broyden-Fletcher-Goldfarb-Shanno (BFGS) quasi-Newton method but also for Davidon–Fletcher–Powell (DFP), Symmetric Rank One (SR1), and Powell-Symmetric-Broyden (PSB). In addition, for an inverse problem governed by a partial differential equation (PDE), we derive DFP and BFGS “structured” secant formulas that explicitly use the derivative of the regularization and only approximates the second derivative of the misfit term. We show numerical results that demonstrate the desired mesh-independence property and superior performance of the resulting quasi-Newton methods.

97 MATHEMATICS AND COMPUTING↗

Improvements to MOOSE user workflow through polyhedral elements, automation, and concise physics syntax

The MOOSE framework is a foundational capability used by the NEAMS program to create over 15 different simulation tools for advanced nuclear reactors. Due to MOOSE's broad use, improvements to the framework in support of modeling and simulation goals are critical to the program. Such improvements can take many forms, including optimization, improved user experience, streamlined application programming interfaces (APIs), parallelism, and new capabilities. The work described in this report was conducted in direct support of NEAMS tools and includes: addition of support for polyhedral elements, incorporation of mesh smoothers for mesh repair, integration of the Physics and ActionComponents systems, expansion of the Convergence system, and exploration of automated input file generation. These five areas of development are fundamental capabilities that will be leveraged by many NEAMS applications.

97 - MATHEMATICS AND COMPUTING↗

High Performance Fortran for Aerospace Applications

This paper focuses on the use of High Performance Fortran (HPF) for important classes of algorithms employed in aerospace applications. HPF is a set of Fortran extensions designed to provide users with a high-level interface for programming data parallel scientific applications, while delegating to the compiler/runtime system the task of generating explicitly parallel message-passing programs. We begin by providing a short overview of the HPF language. This is followed by a detailed discussion of the efficient use of HPF for applications involving multiple structured grids such as multiblock and adaptive mesh refinement (AMR) codes as well as unstructured grid codes. We focus on the data structures and computational structures used in these codes and on the high-level strategies that can be expressed in HPF to optimally exploit the parallelism in these algorithms.

Mehrotra, Piyush↗

Advanced Computing and Simulation

Designing and developing a framework for nuclear energy simulation is challenging because of the technical complexity of the task and the wide range of desired capabilities and possible approaches. During the course of this project, the NEAMS CT team has systematically studied a range of framework requirements and capabilities as documented in several reports. This work focused primarily on the SHARP and Salome frameworks. We are now carrying out a more detailed survey of additional framework parts and requirements. Based on this work, we expect to make a specific framework plan by about the end of 2010 and then to expand our effort to develop and integrate the various parts of such a framework. In addition, EDF and IBM have worked to optimize Code_Saturne for Blue Gene/P. We have significantly improved the performance of the code, introduced OpenMP parallelization which will be important for future HPC architectures with more cores, and solved a problem with over 1 billion mesh cells.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Hexagonal Geometries in MPACT

The MPACT code is a high-fidelity light-water reactor analysis code using whole-core pin-resolved neutron transport calculations on modern parallel-computing hardware. MPACT uses the 2D/1D method to solve 3D neutron transport problems by decomposing the problem into a stack of 2D slices, each of which is solved independently using the method of characteristics (MOC). The slices are then coupled axially using the P3 nodal expansion method (NEM-P3) for the 1D axial calculations. MPACT also employs the coarse mesh finite difference (CMFD) method to accelerate calculations. This manuscript details work supporting advanced reactor designs using hexagonal pins and hexagonal assemblies such as the VVER-1000. If performed correctly, MOC is geometry agnostic. However, MPACT previously had optimizations in place for Cartesian geometries, specifically in the modularization and current calculations. Sections 2 and 3 detail the changes made to MPACT to support MOC and CMFD calculations on hexagonal geometries. Section 4 reports results demonstrating solution consistency for problems run with and without CMFD acceleration, results demonstrating solution consistency when run in serial and parallel, and pincell results using the Monte Carlo code, McCard’s benchmark results.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Optimization of Uranium Molecular Deposition for Alpha-Counting Sources

Method development for molecular deposition of uranium onto aluminum 1100 plates was conducted with custom plating cells at Lawrence Livermore National Laboratory. The method development focused primarily on variation of electrode type, which was expected to directly influence plated sample homogeneity. Solid disc platinum and mesh platinum anodes were compared and data revealed that solid disc platinum anodes produced more homogenous uranium oxide films. However, the activity distribution also depended on the orientation of the platinum electrode relative to the aluminum cathode, starting current, and material composition of the plating cell. Experiments demonstrated these variables were difficult to control under the conditions available. Variation of plating parameters among a series of ten deposited plates yielded variations up to 30% in deposition efficiency. Teflon particles were observed on samples plated in Teflon cells, which poses a problem for alpha activity measurements of the plates. Preliminary electropolishing and chemical polishing studies were also conducted on the aluminum 1100 cathode plates.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Optimizing the Resolution of Hydrodynamic Simulations for MCRaT Radiative Transfer Calculations

Despite their discovery about half a century ago, the Gamma-ray burst (GRB) prompt emission mechanism is still not well understood. Theoretical modeling of the prompt emission has advanced considerably due to new computational tools and techniques. One such tool is the PLUTO hydro dynamics code, which is used to numerically simulate GRB outflows. PLUTO uses Adaptive Mesh Refinement to focus computational efforts on the portion of the grid that contains the simulated jet. Another tool is the Monte Carlo Radiation Transfer (MCRaT) code, which predicts electromagnetic signatures of GRBs by conducting photon scatterings within a jet using PLUTO. The effects of the underlying resolution of a PLUTO simulation with respect to MCRaT post-processing radiative transfer results have not yet been quantified. We analyze an analytic spherical outflow and a hydrodynamically simulated GRB jet with MCRaT at varying spatial and temporal resolutions and quantify how decreasing both resolutions affect the resulting mock observations. We find that changing the spatial resolution changes the hydrodynamic properties of the jet, which directly affect the MCRaT mock observable peak energies. We also find that decreasing the temporal resolution artificially decreases the high energy slope of the mock observed spectrum, which increases both the spectral peak energy and the luminosity. We show that the effects are additive when both spatial and temporal resolutions are modified. Our results allow us to understand how decreased hydrodynamic temporal and spatial resolutions affect the results of post-processing radiative transfer calculations, allowing for the optimization of hydrodynamic simulations for radiative transfer codes.

Jose Arita-Escalante↗

Concurrent algorithms for transient nonlinear FE analysis

A two-parameter class of time-stepping algorithms for nonlinear structural dynamics is investigated. What sets the present method apart from other concurrent algorithms is the fact that it can be used to some advantage in sequential machines as well. Thus, substantial speed-ups are obtained on a single processor as the number of subdomains is increased. An additional O(p) speed-up is obtained when p processors are utilized. The test case discussed is being repeated for a mesh comprising four times as many elements, in an effort to understand how the large scale asymptotic speed-ups are attained. A three dimensional example involving finite deformations and free body motions is also being pursued. A code optimized for concurrency in the Alliant FX8 computer is being finalized. This will provide the means for testing the performance of the algorithm in a multiprocessor environment.

Ortiz, M.↗

Dynamically Evolving Sectors for Convective Weather Impact

A new strategy for altering existing sector boundaries in response to blocking convective weather is presented. This method seeks to improve the reduced capacity of sectors directly affected by weather by moving boundaries in a direction that offers the greatest capacity improvement. The boundary deformations are shared by neighboring sectors within the region in a manner that preserves their shapes and sizes as much as possible. This reduces the controller workload involved with learning new sector designs. The algorithm that produces the altered sectors is based on a force-deflection mesh model that needs only nominal traffic patterns and the shape of the blocking weather for input. It does not require weather-affected traffic patterns that would have to be predicted by simulation. When compared to an existing optimal sector design method, the sectors produced by the new algorithm are more similar to the original sector shapes, resulting in sectors that may be more suitable for operational use because the change is not as drastic. Also, preliminary results show that this method produces sectors that can equitably distribute the workload of rerouted weather-affected traffic throughout the region where inclement weather is present. This is demonstrated by sector aircraft count distributions of simulated traffic in weather-affected regions.

Drew, Michael C.↗

Optimized Auxiliary Functions for Robust Mitigation of Finite-Size Errors in Periodic Hybrid Density Functional Theory

When calculating properties of periodic systems at the thermodynamic limit (TDL), the dominant source of finite size error (FSE) arises from the long-range Coulomb interaction, and can manifest as a slowly converging quadrature error when approximating an integral in the reciprocal space by a finite sum. The singularity subtraction (SS) method offers a systematic approach for reducing this quadrature error and thus the FSE. Here, in this work, we first investigate the performance of the SS method in the simplest setting, aiming at reducing the FSE in exact exchange calculations by subtracting the Coulomb contribution with a single, adjustable Gaussian auxiliary function. We demonstrate that a simple fitting method can robustly estimate the optimal Gaussian width and leads to rapid convergence toward the TDL. Furthermore, we suggest new forms of the auxiliary function, whose optimal parameters could also be determined through least-squares fitting. For a range of semiconductors and insulators, the proposed auxiliary functions achieve robust, millihartree-level accuracy in hybrid density functional theory calculations, including cases with sparse k-meshes and large basis sets.

Quiton, Stephen Jon [University of California, Ber↗

The fully nonconforming virtual element method for biharmonic problems

Here in this paper, we address the numerical approximation of linear fourth-order elliptic problems on polygonal meshes. In particular, we present a novel nonconforming virtual element discretization of arbitrary order of accuracy for biharmonic problems. The approximation space is made of possibly discontinuous functions, thus giving rise to the fully nonconforming virtual element method. We derive optimal error estimates in a suitable (broken) energy norm and present numerical results to assess the validity of the theoretical estimates.

97 MATHEMATICS AND COMPUTING↗

Redundancy management for efficient fault recovery in NASA's distributed computing system

The management of redundancy in computer systems was studied and guidelines were provided for the development of NASA's fault-tolerant distributed systems. Fault recovery and reconfiguration mechanisms were examined. A theoretical foundation was laid for redundancy management by efficient reconfiguration methods and algorithmic diversity. Algorithms were developed to optimize the resources for embedding of computational graphs of tasks in the system architecture and reconfiguration of these tasks after a failure has occurred. The computational structure represented by a path and the complete binary tree was considered and the mesh and hypercube architectures were targeted for their embeddings. The innovative concept of Hybrid Algorithm Technique was introduced. This new technique provides a mechanism for obtaining fault tolerance while exhibiting improved performance.

Malek, Miroslaw↗