Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computing methodologies”

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 415 records · Page 23

The Eastern Renewable Generation Integration Study: Insights on System Stress: Preprint

The Eastern Renewable Generation Integration Study (ERGIS) explores the operational impacts of the wide spread adoption of wind and solar photovoltaics (PV) resources in North America's Eastern and Quebec Interconnections. We explore the impact of large scale adoption of wind and solar generation on the unit commitment and economic dispatch of the largest coordinated power system in the world by simulating hourly and five-minute operations. Using NREL's high-performance computing capabilities and new methodologies to model operations, we found that the modeled system, as simulated with evolutionary change in 2026, could balance the variability and uncertainty of wind and solar PV at a five-minute level under a variety of conditions. Our simulations achieve instantaneous penetrations that exceed 50% of load while meeting an annual penetration of 30% on an energy basis. The system meets balanced load and supply in all intervals, with modest curtailment, using technologies and practices that are widely available today. However, a variety of the conditions present in these simulations deviate substantially from historical practice. In this work, we analyze potentially stressful system conditions that occur in the simulations and identify opportunities for innovation, regulatory reform, and changes in operating practices that require further analysis to enable the transition to a system with more wind and solar PV.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Nonlocal-Gradient Descent Method for Inverse Design in Nanophotonics

Local-gradient-based optimization approaches lack nonlocal exploration abilityrequired for escaping from local minima when searching non-convex landscapes.A directional Gaussian smoothing (DGS) approach was recently proposed in [29]and used to define a truly nonlocal gradient, referred to as the DGS gradient, inorder to enable nonlocal exploration in high-dimensional black-box optimization.Promising results show that replacing the traditional local gradient with the nonlocalDGS gradient can significantly improve the performance of gradient-based methodsin optimizing highly multi-modal loss functions. However, the current DGS methodis designed for unbounded and uncontrained optimization problems, making itinapplicable to real-world engineering optimization problems where the tuningparameters are often bounded and the loss function is usually constrained byphysical processes. In this work, we propose to extend to the DGS approachto the constrained inverse design framework in order to find better optima ofmulti-modal loss functions. A series of adaptive strategies for smoothing radiusand learning rate updating are developed to improve the computational efficiencyand robustness. Our methodology is demonstrated by an example of designing ananoscale wavelength demultiplexer, and shows superior performance compared tothe state-of-the-art approaches. By incorporating volume constraints, the optimizeddesign achieves an equivalently high performance but significantly reduces theamount of material usage.

Bi, Sirui↗

Optimal Transport for Super Resolution Applied to Astronomy Imaging

Super resolution is an essential tool in optics, especially on interstellar scales, due to physical laws restricting possible imaging resolution. We propose using optimal transport and entropy for super resolution applications. We prove that the reconstruction is accurate when sparsity is known and noise or distortion is small enough. We prove that the optimizer is stable and robust to noise and perturbations. We compare this method to a state of the art convolutional neural network and get similar results for much less computational cost and greater methodological flexibility.

Rawson, Michael G.↗

PARTICLE RESOLVED DNS STUDY OF TURBULENCE EFFECTS ON HYPORHEIC MIXING IN RANDOMLY PACKED SEDIMENT BEDS

Pore-resolved direct numerical simulations (DNS) are used to investigate the interactions between stream-water flow turbulence and groundwater flow through a porous sediment bed in the hyporheic zone. Two permeability Reynolds numbers (2.56 and 5.17), representative of aquatic systems and representing ratio of permeability to viscous length scales, were simulated to understand its influence on the momentum exchange at the sediment-water interface (SWI). A doubleaveraging methodology is used to compute the Reynolds stresses, form-induced stresses, and pressure fluctuations. It is observed that both shear layer and turbulent shear stress penetration increases with ReK. Reynolds and form-induced bed-normal stresses increase with ReK. The peak values of the form-induced stresses for the lower (2.56) and higher (5.17) ReK happen within the top layer of the sediment bed. The sum of turbulent and form-induced pressure fluctuations, analyzed at their respective zero-displacement planes, are statistically similar and can be well approximated by a t location-scale distribution fit providing with a model that could potentially be used to impose boundary conditions at the SWI in reach scale simulations.

Karra, Shashank↗

Force Matching Approaches to Extend Density Functional Theory to Large Time and Length Scales

We present methods for the creation of semi-empirical quantum approaches and reactive force fields through force matching to quantum simulation data for materials under reactive conditions. Our methodologies overcome the extreme computational cost of standard Kohn-Sham Density Functional Theory (DFT) by mapping DFT computed simulation data onto functional forms with linear dependence on their parameters. This allows for quick parameterization of our models by avoiding the non-linear fitting bottlenecks associated with most molecular dynamics model development. We illustrate our approach with two different systems: (i) determination of density functional tight binding models for aqueous glycine dimerization, and (ii) determination of the Chebyshev Interactional Model for Efficient Simulation (ChIMES) reactive force field for metallic liquid carbon. In each case, we observe that our approach is easy to parametrize and yields a model that is orders of magnitude faster than DFT while largely retaining its accuracy. Overall, our methods have potential use for studying complex long time and length scale chemical reactivity at extreme conditions, where there is a significant need for computationally efficient atomistic simulations methods to aid in the interpretation and design of experiments.

Lindsey, R.↗

Accelerating Science Driven System Design With RAMP

Researchers from UC Berkeley, in collaboration with the Lawrence Berkeley National Lab, are engaged in developing an Infrastructure for Synthesis with Integrated Simulation (ISIS). The ISIS Project was a cooperative effort for “application-driven hardware design” that engages application scientists in the early parts of the hardware design process for future generation supercomputing systems. This project served to foster development of computing systems that are better tuned to the application requirements of demanding scientific applications and result in more cost-effective and efficient HPC system designs. In order to overcome long conventional design-cycle times, we leveraged reconfigurable devices to aid in the design of high-efficiency systems, including conventional multi- and many-core systems. The resulting system emulation/prototyping environment, in conjunction with the appropriate intermediate abstractions, provided both a convenient user programming experience and retained flexibility, and thus efficiency, of a reconfigurable platform. We initially targeted the Berkeley RAMP system (Research Accelerator for Multiple Processors) as that hardware emulation environment to facilitate and ultimately accelerate the iterative process of science-driven system design. Our goal was to develop and demonstrate a design methodology for domain-optimized computer system architectures. The tangible outcome is a methodology and tools for rapid prototyping and design-space exploration, leading to highly optimized and efficient HPC systems.

97 MATHEMATICS AND COMPUTING↗

Hierarchical ensemble Kalman methods with sparsity-promoting generalized gamma hyperpriors

This paper introduces a computational framework to incorporate flexible regularization techniques in ensemble Kalman methods, generalizing the iterative alternating scheme to nonlinear inverse problems. The proposed methodology approximates the maximum a posteriori (MAP) estimate of a hierarchical Bayesian model characterized by a conditionally Gaussian prior and generalized gamma hyperpriors. Suitable choices of hyperparameters yield sparsity-promoting regularization. We propose an iterative algorithm for MAP estimation, which alternates between updating the unknown with an ensemble Kalman method and updating the hyperparameters in the regularization to promote sparsity. Here, the effectiveness of our methodology is demonstrated in several computed examples, including compressed sensing and subsurface flow inverse problems.

Ensemble Kalman methods↗

Bayesian probability of predictive agreement for comparing the outcome of two separate regressions

The concept of a Bayesian probability of agreement was recently introduced to give the posterior probabilities that the response surfaces for two different groups are within δ of one another. For example, a difference of less than δ in the mean response at fixed levels of the predictor variables might be thought to be practically unimportant. In such a case, we would say that the mean responses are in agreement. The posterior probability of this is called the Bayesian probability of agreement. In this article, we quantify the probability that new response observations from two groups will be within δ for a continuous response, and the probability that the two responses agree completely for categorical cases such as logistic regression and Poisson regression. We call these Bayesian comparative predictive probabilities, with the former being the predictive probability of agreement. We use Markov chain Monte Carlo simulation to estimate the posterior distribution of the model parameters and then the predictive probability of agreement. Here, we illustrate the use of this methodology with three examples and provide a freely available R Shiny app that automates the computation and estimation associated with the methodology.

97 MATHEMATICS AND COMPUTING↗

PROTEUS-SN User Manual

PROTEUS-SN is a three-dimensional, highly scalable, high-fidelity neutron transport code developed at Argonne National Laboratory. The code is applicable to all spectrum reactor transport calculations, particularly those in which a high degree of fidelity is needed either to represent spatial detail or to resolve solution gradients. PROTEUS-SN solves the second order formulation of the transport equation using the continuous Galerkin finite element method in space, the discrete ordinates approximation in angle, and the multigroup approximation in energy. PROTEUS-SN’s parallel methodology permits the efficient decomposition of the problem by both space and angle, permitting large problems to run efficiently on hundreds of thousands of cores. PROTEUS-SN can also be used in serial or on smaller compute clusters (10’s to 100’s of cores) for smaller homogenized problems, although it is generally more computationally expensive than traditional homogenized methodology codes. PROTEUS-SN has been used to model partially homogenized systems, where regions of interest are represented explicitly and other regions are homogenized to reduce the problem size and required computational resources. PROTEUS-SN solves forward and adjoint eigenvalue problems and permits both neutron upscattering and downscattering. An adiabatic kinetics option has recently been included for performing simple time-dependent calculations in addition to standard steady state calculations. PROTEUS-SN handles void and reflective boundary conditions. Multigroup cross sections can be generated externally using the MC2-3 fast reactor multigroup cross section generation code or internally using the cross section application programming interface (API) which can treat the subgroup or resonance table libraries. PROTEUS-SN is written in Fortran 90 and also includes C preprocessor definitions. The code links against the PETSc, METIS, HDF5, and MPICH libraries. It optionally links against the MOAB library and is a part of the SHARP multi-physics suite for coupled multi-physics analysis of nuclear reactors. This user manual describes how to set up a neutron transport simulation with the PROTEUS-SN code. A companion methodology manual describes the theory and algorithms within PROTEUS-SN.

97 MATHEMATICS AND COMPUTING↗

Computational Analysis and Optimized Modeling of Geomagnetically Induced Currents in Power Transformers

In this project we aim to better understand the effect of geomagnetically induced currents (GIC) on power transformers. Expanding upon our previous work focused on producing a methodology for accuracy-enhanced computation of GIC signatures (i.e., time-domain current magnitude variation for the event duration) from a combination of physics-based and data-driven computational tools, we propose the use of these GIC signatures as inputs for a physically-detailed and optimized model of the power transformer to investigate how GIC determination and transformer modeling influence the evaluation of GIC effects on the transformer operation, as well as in its interaction with the power grid.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Validation of blade-resolved computational fluid dynamics for a MW-scale turbine rotor in atmospheric flow

In this study, simulation results of two different computational fluid dynamics codes, Nalu-Wind and EllipSys3D, are presented for a wind turbine rotor in complex yawed and sheared inflow. The results are compared to measurements from the DanAero experiments, to validate computed pressures and azimuthal trends. Despite different code methodologies and grid setups, the codes agree well in computed pressures and integrated forces along the blade for all blade azimuthal positions, however with some discrepancy in the very yawed case. Additionally, both codes capture well the azimuthal trends and force levels seen in measurements. Investigation into discrepancies shows that expanding grids before the rotor, lead to smearing of the wind profiles, which is likely the main cause of the differences in the results between the codes. Additionally, omission of the ground constraint cause discrepancies in relative velocity seen by the passing blade, due to an over speeding beneath the rotor.

17 WIND ENERGY↗

Efficient sensitivity analysis of the thermal profile in powder bed fusion of metals using hypercomplex automatic differentiation finite element method

Rapid cyclic temperature fluctuation occurring in powder bed fusion of metals using a laser beam (PBF-LB/M) influences the formation of flaws in printed parts. Consequently, there is a pressing need to enhance the quality of printed parts by developing innovative methodologies that can predict thermal histories and help uncover the intricate relationships between process parameters and thermal profiles. Sensitivity Analysis (SA) emerges as an essential tool for this, offering the potential for process optimization and enhanced quality control. Nonetheless, conventional SA methodologies often incur in excessive computational costs and potential numerical approximation errors. Here, to address this technical challenge, we present a novel method for SA that integrates the HYPercomplex-based Automatic Differentiation (HYPAD) technique with transient thermal simulations conducted via the finite element method (FEM). Leveraging this methodology, we efficiently and accurately perform SA for PBF-LB/M processes in a post-processing step. Compared to traditional methods like Finite Differences (FD), HYPAD-FEM required 96 % less computational time for obtaining sensitivities for 22 process parameters, under a comparative study conducted within the context of the 2018–02 AM benchmark of the National Institute of Standards and Technology. In summary, HYPAD-FEM offers superior efficiency and accuracy in SA over conventional methods, delivering the best sensitivity of a model without the need for step-size selection and problem or parameter-based implementations.

36 MATERIALS SCIENCE↗

Latent heat thermal energy storage performance maps enabling fast & accurate building energy simulations

Thermal energy storage (TES) using phase change materials (PCMs) has gained attention as an effective approach to manage energy demand fluctuations and shift peak building loads. PCM embedded heat exchangers (PCM-HXs) offer high energy storage density and low temperature variation during phase change, being suitable for load-shifting applications. However, this component is typically evaluated using computationally expensive methods, which present significant challenges when the ultimate goal is to assess the performance of PCM-HX integrated thermal energy storage systems in the full building context. In this paper, we present a methodology to generate highly accurate and computationally efficient PCM-HX performance maps which can be easily integrated into building energy simulation tools to analyze the feasibility of space conditioning systems with latent heat PCM-based TES. The performance maps are generated using a computationally efficient PCM-HX simulation tool based on a Generalized Resistance-Capacitance Model (GRCM) which can simulate arbitrary PCM-HXs with high accuracy and significantly less computational effort compared to full CFD simulations. The methodology was verified for a case study considering a 5-ton (~17.5 kW) air-to-water heat pump-thermal energy storage system (HP-TES), which was co-simulated in Modelica for a DOE prototype small-office building in Vienna, Austria, using Spawn of EnergyPlus™. The TES performance maps provided accurate predictions of PCM-HX behavior when used as Modelica component, with deviations within 2-4% while also achieving at least 103 computational time reduction. Leveraging this faster prediction capability, four PCMs with different melting temperatures for cooling (12°C, 16°C) and heating (31°C, 36°C) were assessed to investigate their impact on system performance. This work highlights the importance of robust PCM-HX models for efficient and high-fidelity building-level simulations, presenting new opportunities for advanced control strategy development and parametric analysis of TES configurations in a computationally efficient manner

Modelica Building Simulations↗

FAST: A Fast Full System Cycle Accurate Computer Simulator (Early Career Principal Investigator Award Final Report)

This project is researching FAST, a methodology to build very fast, cycle-accurate full system computer simulators and building the first set of such simulators and the first set of tools to help construct those simulators. The methodology relies on a functional model that is a fast, full-system but not cycle-accurate simulator coupled with a timing model that is models the micro-architectural structure and arbitration of a computer system, but not its functionality. The way FAST simulators differ from other simulators partitioned in the same way is that the interface between the functional and timing model is optimized to minimize the need for round-trip communication. The optimized communication enables FAST timing models to be implemented in an FPGA and the functional model in software while still achieving extremely high performance. Our general strategy is to design a methodology and then prototype an example using that methodology to ensure the methodology is sound before committing to it. This strategy ensures that the selected methodology has been tested and provides an early example of the output of that methodology.

97 MATHEMATICS AND COMPUTING↗

A tool and a methodology to use macros for abstracting variations in code for different computational demands

Scientific software used on high-performance computing platforms is in a phase of transformation because of the combined increase in the heterogeneity and complexity of models and hardware platforms. Having separate implementations for different platforms can easily lead to combinatorial explosions; therefore, the computational science community has been looking for mechanisms to express code through abstractions that can be specialized for different platforms. Most existing approaches use template meta-programming in C++, and are, therefore language specific. Here, we have developed a tool that uses customized expansion of macros to mimic some of C++ behavior in other languages. It enables unification of any code variants that may be necessary to run efficiently on different target architectures and different computational environments through use of macros with multiple alternative definitions and ability to arbitrate on definition selection for expansion. Combined with two other tools, a custom runtime, and a user specified recipe translator, our custom macroprocessor becomes a part of an overall performance portability solution that does not depend on any specific programming language. We also use macros as code-shorthand that lets code snippets become building blocks that allow variations in control flow to explore performance options. We demonstrate use of macros in Flash-X, a multiphysics multicomponent code with many Fortran legacy components derived from an earlier community code FLASH.

Heterogenous computing↗

Methodology of Materials Discovery in Complex Metal Hydrides Using Experimental and Computational Tools

We present a review of the experimental and theoretical methods used in the discovery of new metal-hydrogen materials systems for hydrogen storage applications. Rather than a comprehensive review of all new materials and methods used in the metal hydride community, we focus on a specific subset of successful methods utilizing theoretical crystal structure prediction methods, computational approaches for screening large numbers of compound classes, and medium-throughput experimental methods for the preparation of such materials. Monte Carlo techniques paired with a simplified empirical Hamiltonian provide crystal structure candidates that are refined using Density Functional Theory. First-principle methods using high-quality structural candidates are further screened for an estimate of reaction energetics, decomposition enthalpies, and determination of reaction pathways. Experimental synthesis utilizes a compacted-pellet sintering technique under high-pressure hydrogen at elevated temperatures. Crystal structure determination follows from a combination of Rietveld refinements of diffraction patterns and first-principles computation of total energies and dynamical stability of competing structures. The methods presented within are general and applicable to a wide class of materials for energy storage.

08 HYDROGEN↗

Thermal-striping analysis methodology for sodium-cooled reactor design

Computational fluid dynamics simulations have been performed to study the applicability of engineering CFD methods for thermals striping analysis. Thermal striping is the fluctuating temperature profile in a solid caused by fluctuating fluid temperature, and the resulting fluctuating thermal stresses cause high cycle fatigue and eventual material failure. Here this study presents the methodology for thermal striping analysis that including a transient conjugate heat transfer RANS model and benchmark the results against a sodium triple jet experiment. The multiphysics calculations are implemented to analyze the thermal stresses in the solid domain caused by the coupled heat transfer between the fluid and solid domains. Validation data from a liquid sodium triple jet experiment include time-averaged temperature measurements and power spectra of the temperature signal. The numerical results agree well with these experimental measures, demonstrating key features such as the dominant frequency of temperature fluctuations. The applicability of a low-cost wall treatment method is demonstrated, enabling key computational savings. Finally, the performance of two finite element stress analysis software packages is compared, and the validity of the lower-cost method is confirmed. These results demonstrate the applicability of engineering methods for computational thermal striping calculations, enabling thermal striping estimations in large fluid systems such as the core of a Sodium-cooled nuclear reactor.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

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↗