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 433 records · Page 24

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↗

A methodology for the synthesis of robust feedback systems

A new methodology is developed for the synthesis of linear, time-variant (LTI) controllers for multivariable LTI systems. The resulting closed-loop system is nominally stable and exhibits a known level of performance. In addition, robustness of the feedback system is guaranteed, i.e., stability and performance are retained in the presence of multiple unstructured uncertainty blocks located at various points in the feedback loop. The design technique is referred to as the Causality Recovery Methodology (CRM). The CRM relies on the Youla parameterization of all stabilizing compensators to ensure nominal stability of the feedback system. A frequency-domain inequality in terms of the structured singular value mu defines the robustness specification. The optimal compensator, with respect to the mu condition, is shown to be noncausal in general. The aim of the CRM is to find a stable, causal transfer function matrix that approximates the robustness characteristics of the optimal solution. The CRM, via a series of infinite-dimensional convex programs, produces a closed-loop system whose performance robustness is at least as good as that of any initial design. The algorithm is approximated by a finite dimensional process for the purposes of implementation. Two numerical examples confirm the potential viability of the CRM concept; however, the robustness improvement comes at the expense of increased computational burden and compensator complexity.

Milich, David Albert↗

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↗

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↗

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↗

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↗

Nodding feed antenna for communications with satellites in synchronous orbit

The design, fabrication, and performance of a parabolic, ground receiving antenna system with a feed that nods in one axis producing a maximum beam deviation 1.1 deg from boresight is described. The antenna design was: (1)to lower the weight (and the subsequent cost) of the supporting structure and the actuator motors for a tracking antenna by moving just the feed; (2) to use a manual tracking system eliminating the need for expensive electronic controls or computers; (3) to provide for several hours of unattended operation; and (4)to permit operation of the antenna by unskilled personnel. Also described are some physical and orbital phenomenon that effect the operation or design of the antenna. One is the motion of a nearly geostationary satellite due to gravitational forces from the sun, the moon, and other stellar bodies. Others are the rotation of the nodding axis and the feed polarization as a function of the location of the station on the earth. A comparison of per unit cost was made for one unit and a quantity of 100.

Smetana, J.↗

Biology Inspired Approach for Communal Behavior in Sensor Networks

Research in wireless sensor network technology has exploded in the last decade. Promises of complex and ubiquitous control of the physical environment by these networks open avenues for new kinds of science and business. Due to the small size and low cost of sensor devices, visionaries promise systems enabled by deployment of massive numbers of sensors working in concert. Although the reduction in size has been phenomenal it results in severe limitations on the computing, communicating, and power capabilities of these devices. Under these constraints, research efforts have concentrated on developing techniques for performing relatively simple tasks with minimal energy expense assuming some form of centralized control. Unfortunately, centralized control does not scale to massive size networks and execution of simple tasks in sparsely populated networks will not lead to the sophisticated applications predicted. These must be enabled by new techniques dependent on local and autonomous cooperation between sensors to effect global functions. As a step in that direction, in this work we detail a technique whereby a large population of sensors can attain a global goal using only local information and by making only local decisions without any form of centralized control.

Jones, Kennie H.↗

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↗

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↗

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↗

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↗

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↗

Climate Sensitivity and the Direct Effect of Carbon Dioxide in a Limited-Area Cloud-Resolving Model

Even in a small domain, it can be prohibitively expensive to run cloud-resolving greenhouse gas warming experiments due to the long equilibration time. Here, a technique is introduced that reduces the computational cost of these experiments by an order of magnitude: instead of fixing the carbon dioxide concentration and equilibrating the sea surface temperature (SST), this technique fixes the SST and equilibrates the carbon dioxide concentration. Using this approach in a cloud-resolving model of radiative–convective equilibrium (RCE), the equilibrated SST is obtained as a continuous function of carbon dioxide concentrations spanning 1 ppmv to nearly 10 000 ppmv, revealing a dramatic increase in equilibrium climate sensitivity (ECS) at higher temperatures. This increase in ECS is due to both an increase in forcing and a decrease in the feedback parameter. In addition, the technique is used to obtain the direct effects of carbon dioxide (i.e., the rapid adjustments) over a wide range of SSTs. Overall, the direct effect of carbon dioxide offsets a quarter of the increase in precipitation from warming, reduces the shallow cloud fraction by a small amount, and has no impact on convective available potential energy (CAPE).

Romps, David M.↗

Recent Trends in the Analysis of Quasioptical Systems

The recent trend in microwave instruments is the use of multiple millimeter and submillimeter wavelength bands. These systems are typically analyzed by using physical optics, Gaussian beams or ray tracing techniques. Physical optics offers high accuracy at the expense of computation time. This trade-off becomes particularly apparent in the analysis of multiple reflector antennas, such as beam waveguide antennas, where physical optics is used to compute the current on each reflector from the current on the previous reflector. At the other end of the spectrum is ray tracing approaches that ignore diffraction effects entirely. These methods are fast but sacrifice the ability to predict some effects accurately. An intermediate approach is to use an appropriate set of expansion functions to model the field between the reflectors. If the set is chosen wisely only a few coefficients need to be determined from each reflector current. The field is then computed at the next reflector through the use of the expansion functions and their coefficients rather than by using the previous reflector current. For a beam waveguide system with no enclosing tubes an excellent set of expansion functions is the Gaussian beam mode set. In many cases a preliminary design which includes the effects on diffraction may be obtained by considering only the fundamental mode and a thin lens model for the reflectors. Higher-order modes are included to model the effects of the curved reflector, which include asymmetric distortion of the beam, cross polarization, and beam truncation. This paper describes a computer code implementing higher-order Gaussian beam scattering by multiple reflector systems. There are four essential steps in the algorithm. (1) Compute the current on the first reflector using physical optics using either a feed model or by an incident set of Gaussian beam modes. (2) Find the direction of propagation for the reflected Gaussian beam-set using ray tracing. (3) Determine the waist size and location for the output beam set by examining the amplitude and phase distribution of the current on the reflector. (4) Compute the amplitudes of the individual modes in the output mode set. These steps are then repeated for each addition reflector in the chain. In each of these cases the previous Gaussian beam set provides the input field for the current calculation. Details of the four steps discussed above will be discussed. Examples will compare results from the Gaussian beam approach to pure physical optics, illustrating both its merits and limitations. Hybrid approaches capable of eliminating some of the limitations will also be discussed.

Hoppe, D. J.↗

An Ensemble of Bayesian Neural Networks for Exoplanetary Atmospheric Retrieval

Machine learning (ML) is now used in many areas of astrophysics, from detecting exoplanets in Kepler transit signals to removing telescope systematics. Recent work demonstrated the potential of using ML algorithms for atmospheric retrieval by implementing a random forest (RF) to perform retrievals in seconds that are consistent with the traditional, computationally expensive nested-sampling retrieval method. We expand upon their approach by presenting a new ML model, plan-net, based on an ensemble of Bayesian neural networks (BNNs) that yields more accurate inferences than the RF for the same data set of synthetic transmission spectra. We demonstrate that an ensemble provides greater accuracy and more robust uncertainties than a single model. In addition to being the first to use BNNs for atmospheric retrieval, we also introduce a new loss function for BNNs that learns correlations between the model outputs. Importantly, we show that designing ML models to explicitly incorporate domain-specific knowledge both improves performance and provides additional insight by inferring the covariance of the retrieved atmospheric parameters. We apply plan-net to the Hubble Space Telescope Wide Field Camera 3 transmission spectrum for WASP-12b and retrieve an isothermal temperature and water abundance consistent with the literature. We highlight that our method is flexible and can be expanded to higher resolution spectra and a larger number of atmospheric parameters.

Adam D. Cobb↗

Reliability‐based layout optimization in offshore wind energy systems

Abstract Existing methods for optimizing wind array layouts typically use power or cost objectives and rarely consider reliability‐based objectives. Component and system failure rates, however, are dependent on location‐specific wind conditions, are influenced by array layout and wake interactions, and have a direct and significant impact on capital costs, operational costs, and power production. Although wind power plant models exist that calculate wind loads with sufficient resolution to capture component loading dynamics from wind conditions, they are computationally expensive and thus not suitable for research applications requiring many evaluations, particularly optimization. This study describes the development of computationally efficient, reliability‐based layout optimization methods, enabling us to explore the relationship between component reliability and layout optimization. These methods include the surrogate modeling of the planet bearing life based on varying wind conditions simulated in FAST.Farm and the formulation of reliability‐based objectives based on failure cost and power production models. Through demonstration of this method, we explore how wind conditions, objective functions, and capacity density influence reliability‐based layout optimization. Results indicate that considering reliability alongside power production can reduce failure costs associated with replacement costs and downtime while maintaining or improving power production. Our conclusions highlight the opportunity for wind power plant developers to integrate reliability and operational expenditures alongside performance and capital expenditure objectives in plant design and development to improve plant performance and costs.

17 WIND ENERGY↗