Search NASA⌕ Search

SEARCH · Search NASA

Results for “computationally expensive function”

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 343 records · Page 19
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

NRC Multiphysics Analysis Capability Deployment FY2020: Part 3

This report details progress and activities of Idaho National Laboratory (INL) on the Nuclear Regulatory Commission (NRC) project “Development and Modeling Sup- port for Advanced Non-Light Water Reactors.” The tasks completed for this report are: Task2c: Explicit modeling of pebble transient temperature response. In this simulation, the 400 MWth Pebble-Bed Modular Reactor (PBMR) design, PBMR- 400, experiences a 20-second power ramp from 100% to 150% power. This is followed by a similar reduction in the power back to 100%. Several multiscale pebble coupling approaches are tested with one pebble per mesh element in the active core region. The results show good conservation behavior and the stability of the coupling.; Extended scope part 1: An assessment of the computational efficiency of the Discontinuous Finite Element Method (DFEM) heat transfer solver shows good scalability. The DFEM solver is a factor of 4 more expensive in solution time than the Finite Element Method (FEM) solver for heat transfer problems due to the increased number of degrees of freedom. Nonetheless, the DFEM approach provides the user with the flexibility to model gap heat transfer problems.; Extended scope part 2: The GapHeatTransferInterfaceMaterial was improved to give the user increased flexibility with the modeling of heat transfer through gaps with the DFEM solver. A number of gap parameters can now be coupled both through functions and variables.; Extended scope part 3: Demonstration of how the gap width between hexagonal fuel cells can be calculated during a heat-up transient and used in the GapHeatTransferInterface model. A full-domain DFEM model with gap expansion is coupled to a SubApp that models the thermal expansion of the base plate. The results show the expected physical behavior, although have not been fully bench-marked at this point in time.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2017

Coalescence Prevention Algorithm for Level Set Method

An algorithm to prevent or delay bubble coalescence for the level set (LS) method is presented. This novel algorithm uses the LS method field to detect when bubbles are in close proximity, indicating a potential coalescence event, and applies a repellent force to simulate the unresolved liquid drainage force. The model is introduced by locally modifying the surface tension force near the liquid film drainage area. The algorithm can also simulate the liquid drainage time of the thin film by controlling the length of time the increased surface tension has been applied. Thus, a new method of modeling bubble coalescence has been developed. Several test cases were designed to demonstrate the capabilities of the algorithm. The simulations, including a mesh study, confirmed the abilities to identify and prevent coalescence as well as implement the time tracking portion, with an additional 10–25% computational cost. Ongoing tests aim to verify the algorithm's functionality for simulations with different flow conditions, a ranging number of bubbles, and both structured and unstructured computational mesh types. Specifically, a bubble rising toward a free surface provides a test of performance and demonstrates the ability to consistently prevent coalescence. In addition, a two bubble case and a seven bubble case provide a more complex demonstration of how the algorithm performs for larger simulations. These cases are compared to much more expensive simulations capable of resolving the liquid film drainage (through very high local mesh resolution) to investigate how the algorithm replicates the liquid film drainage process.

Engineering↗
DOE OSTI2016

Verifying quantitative reliability for programs that execute on unreliable hardware

Emerging high-performance architectures are expected to contain unreliable components that may exhibit soft errors, which silently corrupt the results of computations. Full detection and masking of soft errors is challenging, expensive, and, for some applications, unnecessary. For example, approximate computing applications (such as multimedia processing, machine learning, and big data analytics) can often naturally tolerate soft errors. We introduce Rely, a programming language that enables developers to reason about the quantitative reliability of an application—namely, the probability that it produces the correct result when executed on unreliable hardware. Rely allows developers to specify the reliability requirements for each value that a function produces. We perform a static quantitative reliability analysis that verifies quantitative requirements on the reliability of an application, enabling a developer to perform sound and verified reliability engineering. The analysis takes a Rely program with a reliability specification and a hardware specification that characterizes the reliability of the underlying hardware components and verifies that the program satisfies its reliability specification when executed on the underlying unreliable hardware platform. We demonstrate the application of quantitative reliability analysis on six computations implemented in Rely.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Automated Work Package: Initial Wireless Communication Platform Design, Development, and Evaluation

The Department of Energy’s Light Water Reactor Sustainability Program is developing the scientific basis to ensure long-term reliability, productivity, safety, and security of the nuclear power industry in the United States. The Instrumentation, Information, and Control (II&C) pathway of the program aims to increase the role of advanced II&C technologies to achieve this objective. One of the pathway efforts at Idaho National Laboratory (INL) is to improve the work packages execution process by replacing the expensive, inefficient, bulky, complex, and error-prone paper-based work orders with automated work packages (AWPs). An AWP is an automated and dynamic presentation of the work package designed to guide the user through the work process. It is loaded on a mobile device, such as a tablet, and is capable of communicating with plant equipment and systems to acquire plant and procedure states. The AWP replaces those functions where a computer is more efficient and reliable than a human. To enable the automatic acquisition of plant data, it is necessary to design and develop a prototype platform for data exchange between the field instruments and the AWP mobile devices. The development of the platform aims to reveal issues and solutions generalizable to large-scale implementation of a similar system. Topics such as bandwidth, robustness, response time, interference, and security are usually associated with wireless communication. These concerns, along with other requirements, are listed in an earlier INL report. Specifically, the targeted issues and performance aspects in this work are relevant to the communication infrastructure from the perspective of promptness, robustness, expandability, and interoperability with different technologies.

Automated Work Packages↗
DOE OSTI2016

Automated Work Package: Initial Wireless Communication Platform Design, Development, and Evaluation

The Department of Energy's Light Water Reactor Sustainability Program is developing the scientific basis to ensure long-term reliability, productivity, safety, and security of the nuclear power industry in the United States. The Instrumentation, Information, and Control (II and C) pathway of the program aims to increase the role of advanced II and C technologies to achieve this objective. One of the pathway efforts at Idaho National Laboratory (INL) is to improve the work packages execution process by replacing the expensive, inefficient, bulky, complex, and error-prone paper-based work orders with automated work packages (AWPs). An AWP is an automated and dynamic presentation of the work package designed to guide the user through the work process. It is loaded on a mobile device, such as a tablet, and is capable of communicating with plant equipment and systems to acquire plant and procedure states. The AWP replaces those functions where a computer is more efficient and reliable than a human. To enable the automatic acquisition of plant data, it is necessary to design and develop a prototype platform for data exchange between the field instruments and the AWP mobile devices. The development of the platform aims to reveal issues and solutions generalizable to large-scale implementation of a similar system. Topics such as bandwidth, robustness, response time, interference, and security are usually associated with wireless communication. These concerns, along with other requirements, are listed in an earlier INL report. Specifically, the targeted issues and performance aspects in this work are relevant to the communication infrastructure from the perspective of promptness, robustness, expandability, and interoperability with different technologies. The development of a prompt system entailed significant performance optimization, including the use of parallel processing, parallel communication, modularity, noise filtering, and frequency tuning. A robust system was achieved by enforcing a persistent continuous data exchange that automatically detects and conveys a failure of any link or component in any part of the system, and that automatically restores the communication once the link or component is restored. An expandable topology was enabled by modularity and load sharing. The number of servers, mobile devices, and field instruments is not limited from a system structure point of view. The system interoperability was achieved by enforcing the independence of the field communication application from the mobile device application. (authors)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2018

A computationally efficient approach for calculating galaxytwo-point correlations

We developed a modification to the calculation of the two-point correlation function commonly used in the analysis of large-scale structure in cosmology. An estimator of the two-point correlation function is constructed by contrasting the observed distribution of galaxies with that of a uniformly populated random catalogue. The assumption that the distribution of random galaxies in redshift is independent of angular position allows us to replace pair-wise combinatorics with fast integration over probability maps. The new method significantly reduces the computation time while simultaneously increasing the precision of the calculation. Also, it only requires cosmological parameters at the last and least computationally expensive stage, which allows for faster exploration of the parameter space.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2018

A high-order multiscale finite-element method for time-domain acoustic-wave modeling

Accurate and efficient wave equation modeling is vital for many applications in such as acoustics, electromagnetics, and seismology. However, solving the wave equation in large-scale and highly heterogeneous models is usually computationally expensive because the computational cost is directly proportional to the number of grids in the model. We develop a novel high-order multiscale finite-element method to reduce the computational cost of time-domain acoustic-wave equation numerical modeling by solving the wave equation on a coarse mesh based on the multiscale finite-element theory. In contrast to existing multiscale finite-element methods that use only first-order multiscale basis functions, our new method constructs high-order multiscale basis functions from local elliptic problems which are closely related to the Gauss–Lobatto–Legendre quadrature points in a coarse element. Essentially, these basis functions are not only determined by the order of Legendre polynomials, but also by local medium properties, and therefore can effectively convey the fine-scale information to the coarse-scale solution with high-order accuracy. Numerical tests show that our method can significantly reduce the computation time while maintain high accuracy for wave equation modeling in highly heterogeneous media by solving the corresponding discrete system only on the coarse mesh with the new high-order multiscale basis functions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

A Massively Parallel Implementation of the CCSD(T) Method Using the Resolution-of-the-Identity Approximation and a Hybrid Distributed/Shared Memory Parallelization Model

In this work, a parallel algorithm is described for the coupled-cluster singles and doubles method augmented with a perturbative correction for triple excitations [CCSD(T)] using the resolution-of-the-identity (RI) approximation for two-electron repulsion integrals (ERIs). The algorithm bypasses the storage of four-center ERIs by adopting an integral-direct strategy. The CCSD amplitude equations are given in a compact quasi-linear form by factorizing them in terms of amplitude-dressed three-center intermediates. A hybrid MPI/OpenMP parallelization scheme is employed, which uses the OpenMP-based shared memory model for intranode parallelization and the MPI-based distributed memory model for internode parallelization. Parallel efficiency has been optimized for all terms in the CCSD amplitude equations. Two different algorithms have been implemented for the rate-limiting terms in the CCSD amplitude equations that entail and -scaling computational costs, where N O and N V denote the number of correlated occupied and virtual orbitals, respectively. One of the algorithms assembles the four-center ERIs requiring N V 4 and N O 2 N V 2 -scaling memory costs in a distributed manner on a number of MPI ranks, while the other algorithm completely bypasses the assembling of quartic memory-scaling ERIs and thus largely reduces the memory demand. It is demonstrated that the former memory-expensive algorithm is faster on a few hundred cores, while the latter memory-economic algorithm shows a better strong scaling in the limit of a few thousand cores. The program is shown to exhibit a near-linear scaling, in particular for the compute-intensive triples correction step, on up to 8000 cores. The performance of the program is demonstrated via calculations involving molecules with 24–51 atoms and up to 1624 atomic basis functions. As the first application, the complete basis set (CBS) limit for the interaction energy of the π-stacked uracil dimer from the S66 data set has been investigated. This work reports the first calculation of the interaction energy at the CCSD(T)/aug-cc-pVQZ level without local orbital approximation. The CBS limit for the CCSD correlation contribution to the interaction energy was found to be -8.01 kcal/mol, which agrees very well with the value -7.99 kcal/mol reported by Schmitz, Hättig, and Tew [ Phys. Chem. Chem. Phys. 2014 , 16 , 22167-22178]. The CBS limit for the total interaction energy was estimated to be -9.64 kcal/mol.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

A deep learning framework for layer-wise porosity prediction in metal powder bed fusion using thermal signatures

Abstract Part quality manufactured by the laser powder bed fusion process is significantly affected by porosity. Existing works of process–property relationships for porosity prediction require many experiments or computationally expensive simulations without considering environmental variations. While efforts that adopt real-time monitoring sensors can only detect porosity after its occurrence rather than predicting it ahead of time. In this study, a novel porosity detection-prediction framework is proposed based on deep learning that predicts porosity in the next layer based on thermal signatures of the previous layers. The proposed framework is validated in terms of its ability to accurately predict lack of fusion porosity using computerized tomography (CT) scans, which achieves a F1-score of 0.75. The framework presented in this work can be effectively applied to quality control in additive manufacturing. As a function of the predicted porosity positions, laser process parameters in the next layer can be adjusted to avoid more part porosity in the future or the existing porosity could be filled. If the predicted part porosity is not acceptable regardless of laser parameters, the building process can be stopped to minimize the loss.

42 ENGINEERING↗
DOE OSTI2024

Multi-parametric analysis for mixed integer linear programming: An application to transmission upgrade and congestion management

Upgrading the capacity of existing transmission lines is essential for meeting the growing energy demands, facilitating the integration of renewable energy, and ensuring the security of the transmission system. This study focuses on the selection of lines whose capacities and by how much should be expanded from the perspective of the Independent System Operators (ISOs) to minimize the total system cost. We employ advanced multi-parametric programming and an enhanced branch-and-bound algorithm to address complex mixed-integer linear programming (MILP) problems, considering multi-period time constraints and physical limitations of generators and transmission lines. To characterize the various decisions in transmission expansion, we model the increased capacity of existing lines as parameters within a specified range. This study first relaxes the binary variables to continuous variables and applies the Lagrange method and Karush-Kuhn-Tucker (KKT) conditions to obtain optimal solutions and identify critical regions associated with active and inactive constraints. Moreover, we extend the traditional branch-and-bound (B&B) method by determining the problem’s upper and lower bounds at each node of the B&B decision tree, helping to manage computational challenges in large-scale MILP problems. Here, we compare the difference between the upper and lower bounds to obtain an approximate optimal solution within the decision-makers’ tolerable error range. In addition, the first derivative of the objective function on the parameters of each line is used to inform the selection of lines for easing congestion and maximizing social welfare. Finally, the capacity upgrades are selected by weighing the reductions in system costs against the expense of upgrading line capacities. The findings are supported by numerical simulations and provide transmission-line planners with decision-making guidance.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2016

FastPM: a new scheme for fast simulations of dark matter and haloes

We introduce FASTPM, a highly scalable approximated particle mesh (PM) N-body solver, which implements the PM scheme enforcing correct linear displacement (1LPT) evolution via modified kick and drift factors. Employing a two-dimensional domain decomposing scheme, FASTPM scales extremely well with a very large number of CPUs. In contrast to Comoving-Lagrangian (COLA) approach, we do not require to split the force or track separately the 2LPT solution, reducing the code complexity and memory requirements. We compare FASTPM with different number of steps (N s ) and force resolution factor (B) against three benchmarks: halo mass function from friends-of-friends halo finder; halo and dark matter power spectrum; and cross-correlation coefficient (or stochasticity), relative to a high-resolution TREEPM simulation. We show that the modified time stepping scheme reduces the halo stochasticity when compared to COLA with the same number of steps and force resolution. While increasing N s and B improves the transfer function and cross-correlation coefficient, for many applications FASTPM achieves sufficient accuracy at low N s and B. For example, N s = 10 and B = 2 simulation provides a substantial saving (a factor of 10) of computing time relative to N s = 40, B = 3 simulation, yet the halo benchmarks are very similar at z = 0. We find that for abundance matched haloes the stochasticity remains low even for N s = 5. FASTPM compares well against less expensive schemes, being only 7 (4) times more expensive than 2LPT initial condition generator for N s = 10 (N s = 5). Some of the applications where FASTPM can be useful are generating a large number of mocks, producing non-linear statistics where one varies a large number of nuisance or cosmological parameters, or serving as part of an initial conditions solver.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

Evaluating asynchronous Schwarz solvers on GPUs

With the commencement of the exascale computing era, we realize that the majority of the leadership supercomputers are heterogeneous and massively parallel. Even a single node can contain multiple co-processors such as GPUs and multiple CPU cores. For example, ORNL’s Summit accumulates six NVIDIA Tesla V100 GPUs and 42 IBM Power9 cores on each node. Synchronizing across compute resources of multiple nodes can be prohibitively expensive. Hence, it is necessary to develop and study asynchronous algorithms that circumvent this issue of bulk-synchronous computing. In this study, we examine the asynchronous version of the abstract Restricted Additive Schwarz method as a solver. We do not explicitly synchronize, but allow the communication between the sub-domains to be completely asynchronous, thereby removing the bulk synchronous nature of the algorithm. We accomplish this by using the one-sided Remote Memory Access (RMA) functions of the MPI standard. We study the benefits of using such an asynchronous solver over its synchronous counterpart. We also study the communication patterns governed by the partitioning and the overlap between the sub-domains on the global solver. Finally, we show that this concept can render attractive performance benefits over the synchronous counterparts even for a well-balanced problem.

Nayak, Pratik↗
DOE OSTI2020

PANNA: Properties from Artificial Neural Network Architectures

We report prediction of material properties from first principles is often a computationally expensive task. Recently, artificial neural networks and other machine learning approaches have been successfully employed to obtain accurate models at a low computational cost by leveraging existing example data. Here, we present a software package “Properties from Artificial Neural Network Architectures” (PANNA) that provides a comprehensive toolkit for creating neural network models for atomistic systems following the Behler–Parrinello topology. Besides the core routines for neural network training, it includes data parser, descriptor builder for Behler–Parrinello class of symmetry functions and force-field generator suitable for integration within molecular dynamics packages. PANNA offers a variety of activation and cost functions, regularization methods, as well as the possibility of using fully-connected networks with custom size for each atomic species. PANNA benefits from the optimization and hardware-flexibility of the underlying TensorFlow engine which allows it to be used on multiple CPU/GPU/TPU systems, making it possible to develop and optimize neural network models based on large datasets.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Precision redshift-space galaxy power spectra using Zel'dovich control variates

Numerical simulations in cosmology require trade-offs between volume, resolution and run-time that limit the volume of the Universe that can be simulated, leading to sample variance in predictions of ensemble-average quantities such as the power spectrum or correlation function(s). Sample variance is particularly acute at large scales, which is also where analytic techniques can be highly reliable. This provides an opportunity to combine analytic and numerical techniques in a principled way to improve the dynamic range and reliability of predictions for clustering statistics. In this paper we extend the technique of Zel'dovich control variates, previously demonstrated for 2-point functions in real space, to reduce the sample variance in measurements of 2-point statistics of biased tracers in redshift space. We demonstrate that with this technique, we can reduce the sample variance of these statistics down to their shot-noise limit out to k ~ 0.2 h Mpc -1 . This allows a better matching with perturbative models and improved predictions for the clustering of e.g. quasars, galaxies and neutral Hydrogen measured in spectroscopic redshift surveys at very modest computational expense. We discuss the implementation of ZCV, give some examples and provide forecasts for the efficacy of the method under various conditions.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2019

Approximate Scheduling of DERs with Discrete Complex Injections

Rapid penetration of renewable energy based Distributed Energy Resources (DER) has the potential to exacerbate the challenges inherent in grid frequency and voltage regulation. However, their real time controllability can be leveraged to not only mitigate such challenges, but improve the economics and quality of grid operations. A plethora of DER scheduling algorithms have been developed for fast and efficient scheduling of these resources. These algorithms schedule the complex - real and reactive power injected into (or drawn from) the grid by the DERs under various cost objective functions and grid constraints. However, a vast majority of such algorithms assume the feasible range of power injections to be continuous. In reality, the control options available for several DERs form a discrete space. This implies that the feasible range of power injections also forms a discrete space. This makes DER scheduling an NP-hard problem. Integer/Mixed Integer program based algorithms, which guarantee optimality in the objective value, have been developed. But these are prohibitively expensive in terms of computational time requirements. On the other hand, fast heuristic based solutions have also been developed. But as they do not provide any guarantee on the optimality of the objective, or on satisfying the constraints, they are unreliable for grid operations. Recent works have developed approximation algorithms which offer the best of both the approaches above: (near) optimality and low computational complexity, both of which are governed by a user defined accuracy parameter ϵ. In this work, we significantly improve upon such existing works by developing an approximation algorithm which schedules DERs with complex injections (as opposed to only real injection) and whose runtime is polynomial (as opposed to exponential) in 1/ϵ. We provide theoretical analysis and support them with experimental results to validate the guarantees provided by our approximation algorithm.

14 SOLAR ENERGY↗
DOE OSTI2019

Parameterizing hot electron energy distributions for tabular emissivities and opacities

Cold Kα and Kβ emission spectroscopy is a powerful diagnostic for plasma conditions and distributions of energetic electrons produced in short pulse laser experiments. SPECT3D post-processes hydrodynamics code output and simulates high-resolution spectra and images for plasmas containing arbitrary distributions of hot electrons, however these calculations can become prohibitively expensive for plasmas requiring complex atomic data and detailed computational grids. To significantly increase calculation speed, it is desirable to use pre-configured opacity tables that include information about hot electrons, rather than calculating emissivity and opacity for every grid point by solving collisional-radiative atomic kinetic rate equations. However, to tabulate such opacities, a general parameter-based description of hot electron energy distributions must be found. To be practical, hot electrons should be represented with an analytic function of just a few parameters which, in addition to temperature and density, can be used to define parameter space for opacity tables. In this paper, we present a method that allows for describing a set of arbitrary binned hot electron distributions with a simple analytic function, with only a modest impact on the accuracy of the simulations. Increased calculation speeds of 50–100x are demonstrated. In conclusion, we also discuss details of opacity calculations and present synthetic spectroscopy data based on post-processing of detailed particle-in-cell simulations relevant to the ongoing experimental campaign at the Omega EP laser facility.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2016

Predicting Band Gaps with Hybrid Density Functionals

We look at the ability of four popular hybrid density functionals (B3LYP, B3PW91, HSE, and PBE0) for predicting band gaps of semiconductors and insulators over a large benchmark set using a consistent methodology. We observe no significant statistical difference in their overall performance, although the screened hybrid HSE is more accurate for typical semiconductors. HSE can improve its accuracy for large band gap materials—without affecting that of semiconductors—by including a larger portion of Hartree–Fock exchange in its short-range. Given that screened hybrids are computationally much less expensive than their global counterparts, we conclude that they are a better option for the black box prediction of band gaps.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗