Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational efficiency”

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 361 records · Page 20

Operating efficiency of computers

A method is outlined which can be used to guarantee to users of computing systems a measure of operating efficiency. The monthly utilization coefficient should be equal to or exceed a value agreed on in advance. In addition, the repair time during a computer breakdown should not be longer than a period agreed on in advance.

Pac, J.↗

Accurate optimization of amino acid form factors for computing small-angle X-ray scattering intensity of atomistic protein structures

Structure modelling via small-angle X-ray scattering (SAXS) data generally requires intensive computations of scattering intensity from any given biomolecular structure, where the accurate evaluation of SAXS profiles using coarse-grained (CG) methods is vital to improve computational efficiency. To date, most CG SAXS computing methods have been based on a single-bead-per-residue approximation but have neglected structural correlations between amino acids. To improve the accuracy of scattering calculations, accurate CG form factors of amino acids are now derived using a rigorous optimization strategy, termed electron-density matching (EDM), to best fit electron-density distributions of protein structures. This EDM method is compared with and tested against other CG SAXS computing methods, and the resulting CG SAXS profiles from EDM agree better with all-atom theoretical SAXS data. By including the protein hydration shell represented by explicit CG water molecules and the correction of protein excluded volume, the developed CG form factors also reproduce the selected experimental SAXS profiles with very small deviations. Taken together, these EDM-derived CG form factors present an accurate and efficient computational approach for SAXS computing, especially when higher molecular details (represented by the q range of the SAXS data) become necessary for effective structure modelling.

Tong, Dudu↗

SU-E-T-379: Concave Approximations of Target Volume Dose Metrics for Intensity- Modulated Radiotherapy Treatment Planning

Purpose: The widely used treatment plan metric Dx (mimimum dose to the hottest x% by volume of the target volume) is simple to interpret and use, but is computationally poorly behaved (non-convex), this impedes its use in computationally efficient intensity-modulated radiotherapy (IMRT) treatment planning algorithms. We therefore searched for surrogate metrics that are concave, computationally efficient, and accurately correlated to Dx values in IMRT treatment plans. Methods: To find concave surrogates of D95—and more generally, Dx values with variable x values—we tested equations containing one or two generalized equivalent uniform dose (gEUD) functions. Fits were obtained by varying gEUD ‘a’ parameter values, as well as the linear equation coefficients. Fitting was performed using a dataset of dose-volume histograms from 498 de-identified head and neck IMRT treatment plans. Fit characteristics were tested using a crossvalidation process. Reported root-mean-square error values were averaged over the cross-validation shuffles. Results: As expected, the two-gEUD formula provided a superior fit, compared to the single-gEUD formula. The best approximation uses two gEUD terms: 16.25 x gEUD[a=0.45] – 15.30 x gEUD[a=1.75] – 0.69. The average root-mean-square error on repeated (70/30) cross validation was 0.94 Gy. In addition, a formula was found that reasonably approximates Dx for x between 80% and 96%. Conclusion: A simple concave function using two gEUD terms was found that correlates well with PTV D95s for these head and neck treatment plans. More generally, a formula was found that represents well the Dx for x values from 80% to 96%, thus providing a computationally efficient formula for use in treatment planning optimization. The formula may need to be adjusted for other institutions with different treatment planning protocols. We conclude that the strategy of replacing Dx values with gEUD-based formulas is promising.

60 APPLIED LIFE SCIENCES↗

Efficient diagrammatic computation method for higher order correlation functions of local type primordial curvature perturbations

We present a new efficient method for computing the non-linearity parameters of the higher order correlation functions of local type curvature perturbations in inflation models having a N-component scalar field, focusing on the non-Gaussianity generated during the evolution on super-horizon scales. In contrast to the naive expectation that the number of operations necessary to compute the n-point functions is proportional to N{sup n}, it grows only linearly in N in our formalism. Hence, our formalism is particularly powerful for the inflation models composed of a multi-component scalar field, including the models in which the slow-roll conditions are violated after the horizon crossing time. Explicit formulas obtained by applying our method are provided for n = 2, 3, 4 and 5, which correspond to power-, bi-, tri- and quad-spectra, respectively. We also discuss how many parameters we need to parameterize the amplitude and the shape of the higher order correlation functions of local type.

79 ASTRONOMY AND ASTROPHYSICS↗

Subspace recursive Fermi-operator expansion strategies for large-scale DFT eigenvalue problems on HPC architectures

Quantum mechanical calculations for material modeling using Kohn–Sham density functional theory (DFT) involve the solution of a nonlinear eigenvalue problem for N smallest eigenvector-eigenvalue pairs, with N proportional to the number of electrons in the material system. Here, these calculations are computationally demanding and have asymptotic cubic scaling complexity with the number of electrons. Large-scale matrix eigenvalue problems arising from the discretization of the Kohn–Sham DFT equations employing a systematically convergent basis traditionally rely on iterative orthogonal projection methods, which are shown to be computationally efficient and scalable on massively parallel computing architectures. However, as the size of the material system increases, these methods are known to incur dominant computational costs through the Rayleigh–Ritz projection step of the discretized Kohn–Sham Hamiltonian matrix and the subsequent subspace diagonalization of the projected matrix. This work explores the potential of polynomial expansion approaches based on recursive Fermi-operator expansion as an alternative to the subspace diagonalization of the projected Hamiltonian matrix to reduce the computational cost. Subsequently, we perform a detailed comparison of various recursive polynomial expansion approaches to the traditional approach of explicit diagonalization on both multi-node central processing unit and graphics processing unit architectures and assess their relative performance in terms of accuracy, computational efficiency, scaling behavior, and energy efficiency.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

An Initial Multi-Domain Modeling of an Actively Cooled Structure

A methodology for the simulation of turbine cooling flows is being developed. The methodology seeks to combine numerical techniques that optimize both accuracy and computational efficiency. Key components of the methodology include the use of multiblock grid systems for modeling complex geometries, and multigrid convergence acceleration for enhancing computational efficiency in highly resolved fluid flow simulations. The use of the methodology has been demonstrated in several turbo machinery flow and heat transfer studies. Ongoing and future work involves implementing additional turbulence models, improving computational efficiency, adding AMR.

Steinthorsson, Erlendur↗

Designing Energy-Efficient Quantum Computers Through Prediction and Reduction of Cooling Requirements for Cryogenic Electronics

Quantum computing has been identified as a “wild card” by the International Energy Agency in predicting future global data center energy usage. This is primarily because both uncertainty in the extent to which quantum computing will be adopted, and uncertainty in the power consumption of individual quantum data centers. Unlike the classical counterparts, quantum computers need to be maintained at near absolute zero, requiring energy-intensive cryogenic cooling systems. Therefore, as quantum computers scale up from existing 50 qubit technology demonstrations to the 10,000 to 100,000 qubit systems that will be able to solve complex problems, the energy consumption of both the electronics and the required cooling systems will also increase. To predict this scaling, this work analyzes the energy requirements for both computation and cooling of quantum hardware. We show that the energy requirements for cooling of quantum computers is determined by several computing system parameters, including the number and type of physical qubits, the operating temperature, the packaging efficiency of the system, and the split between circuits operating at cryogenic temperatures and those operating at room temperature. The energy requirements can then be found based on thermal system parameters such as cooling efficiency and cryostat heat transfer. Analysis of these parameters shows that the energy required for cooling is significantly larger than that required for computation, a reversal from energy usage patterns seen in conventional computing. The results and discussions provide a road-map for creating energy efficient quantum computers through the selection of computer architectures and cryogenic system configurations that minimize cooling requirements.

energy efficiency↗

Radiation dose rate distributions of spent fuel dry casks estimated with MAVRIC based on detailed geometry and continuous-energy models

This study presents a detailed comparison of the dose rate distributions of a dry TN–32 fuel cask with two geometry models and two cross-sectional datasets. The accuracies of radiation dose rate estimation and computational efficiencies of each geometry model with two cross-sectional data-sets are compared. The use of automated variance reduction techniques can significantly improve the computational efficiency of such a realistic, deep penetration problem that involves radiation transport from different volumetric sources, thereby eliciting only a small statistical error. Monaco with Automated Variance Reduction using Importance Calculations (MAVRIC) is a computational sequence within the SCALE 6.2 code package based on consistent adjoint driven importance sampling (CADIS), a type of automated variance reduction technique. Homogenous and full fuel assembly models are built herein, and two nuclear cross-section libraries (V7–200N47G and continuous energy) are applied in this work. Based on the detailed comparisons, we found that neutron dose rate estimation is more dependent on geometry modeling than on cross-section data. For neutron-induced gamma rays, the dose rate distribution depends on both the spatial self-shielding effect and the cross-section library. The primary gamma rays respectively contribute to the total dose rate by ~91% and ~ 99% on side and top surfaces, and the dose rate accuracy is more dependent on the cross-section library than on geometry modeling. In terms of the computation efficiency and efforts spent on geometry modeling, the homogenous fuel assembly model with the MG library can produce an acceptable dose rate distribution, but the detailed fuel assembly model with the continuous-energy library is required for more precise dose rate estimation.

61 RADIATION PROTECTION AND DOSIMETRY↗

EFFICIENT PARALLEL COMPUTATION OF ALL-PAIRS N-BODY ACCELERATION BY DO-LOOP FOLDING

The computational load inside a do loop is equalized by folding the loop appropriately if the amount of load is a linear function of the loop index. Using this idea, we develop an efficient parallel computation scheme of Newtonian all-pairs N-body acceleration vectors with help from OpenMP architecture. Using a consumer PC with a quad-core eight-thread processor, the new parallel scheme runs 4.2-4.9 times faster than a serial computation when the number of particles exceeds a few hundred.

79 ASTRONOMY AND ASTROPHYSICS↗

Global System Reduction Order Modeling for Localized Feature Inclusion

The development of reduced-order models remains an active research area, despite advances in computational resources. Here we develop a novel order-reduction approach that is designed to incorporate isolated regions that contain, for example, nonlinearitites or accumulating damage. The approach is designed to use global modes of the overall system response, which are then naturally coupled to the response in the isolated region of interest. Two examples are provided to demonstrate both the accuracy and the computational efficiency of the proposed approach. The performance of this approach is compared to the exact response corresponding to a finite element simulation for the chosen problems. In addition, the accuracy and computational efficiency are shown relative to a standard Galerkin reduction based on the linear normal modes. It is found that the proposed reduction offer computational efficiency comparable to a Galerkin reduction, but more accurately represents the response of the system when both are compared to the finite element simulation.

42 ENGINEERING↗

Methods for local gravity field approximation

The most widely known modern method for estimating gravity field values from observed data is least-squares collocation. Its advantages are that it can make estimates at arbitrary locations based on irregularly spaced observations, and that it makes use of statistical information about errors in the input data while providing corresponding information about the quality of the output estimates. Disadvantages of collocation include the necessity of inverting square matrices of dimension equal to the number of data values and the need to assume covariance models for the gravity field and the data errors. Fourier methods are an important alternative to collocation; having the advantage of greater computational efficiency, but requiring data estimates to be on a regular grid and not using or providing statistical accuracy information. The GEOFAST algorithm is an implementation of collocation that achieves high computational efficiency by transforming the estimation equations into the frequency domain where an accurate approximation may be made to reduce the workload. The forward and inverse Fast Fourier Transforms (FFTs) are utilized. The accuracy and computational efficiency of the GEOFAST algorithm is demonstrated using two sets of synthetic gravity data: marine gravity for an ocean trench region including wavelengths longer than 200 km; and local land gravity containing wavelengths as short as 5 km. These results are discussed along with issues such as the advantages of first removing reference field models before carrying out the estimation algorithm.

Sailor, R. V.↗

Plate-specific gain map correction for the improvement of detective quantum efficiency in computed radiography

Purpose: The purpose of this work is to improve the noise power spectrum (NPS), and thus the detective quantum efficiency (DQE), of computed radiography (CR) images by correcting for spatial gain variations specific to individual imaging plates. CR devices have not traditionally employed gain-map corrections, unlike the case with flat-panel detectors, because of the multiplicity of plates used with each reader. The lack of gain-map correction has limited the DQE(f) at higher exposures with CR. This current work describes a feasible solution to generating plate-specific gain maps. Methods: Ten high-exposure open field images were taken with an RQA5 spectrum, using a sixth generation CR plate suspended in air without a cassette. Image values were converted to exposure, the plates registered using fiducial dots on the plate, the ten images averaged, and then high-pass filtered to remove low frequency contributions from field inhomogeneity. A gain-map was then produced by converting all pixel values in the average into fractions with mean of one. The resultant gain-map of the plate was used to normalize subsequent single images to correct for spatial gain fluctuation. To validate performance, the normalized NPS (NNPS) for all images was calculated both with and without the gain-map correction. Variations in the quality of correction due to exposure levels, beam voltage/spectrum, CR reader used, and registration were investigated. Results: The NNPS with plate-specific gain-map correction showed improvement over the noncorrected case over the range of frequencies from 0.15 to 2.5 mm{sup -1}. At high exposure (40 mR), NNPS was 50%-90% better with gain-map correction than without. A small further improvement in NNPS was seen from carefully registering the gain-map with subsequent images using small fiducial dots, because of slight misregistration during scanning. Further improvement was seen in the NNPS from scaling the gain map about the mean to account for different beam spectra. Conclusions: This study demonstrates that a simple gain-map can be used to correct for the fixed-pattern noise in a given plate and thus improve the DQE of CR imaging. Such a method could easily be implemented by manufacturers because each plate has a unique bar code and the gain-map for all plates associated with a reader could be stored for future retrieval. These experiments indicated that an improvement in NPS (and hence, DQE) is possible, depending on exposure level, over a wide range of frequencies with this technique.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

The Extended Embedded Self-Shielding Method in SCALE 6.3/Polaris

The SCALE transport lattice code, Polaris, has been previously developed to generate few-group homogenized cross sections for whole-core nodal diffusion simulators in which the embedded self-shielding method (ESSM) is used for resonance self-shielding calculations to process cross sections. Although the ESSM capability has been very successful in light-water reactor analysis, it may require enhancements in computational efficiency; treatment of spatially dependent resonance self-shielding effects; and handling of interrelated resonance effects among fuel, cladding, and control rod materials. Therefore, this study focuses on improving computational efficiency by using a Dancoff-based Wigner–Seitz approximation combined with a material-based resonance categorization, through which a spatially dependent ESSM capability is developed to accurately estimate self-shielded cross sections inside the fuel. Benchmark results show that the new capability significantly enhances computational efficiency and accuracy for spatially dependent local zones within the fuel and through depletion.

ESSM↗

Investigation of Best-Practices and Computationally Inexpensive Radiative Exchange Models for Discrete Element Method Modeling of Aluminosilicate Particles in Concentrating Solar Power Environments

Chemically inert, aluminosilicate based particles have been investigated as both a thermal transport and sensible energy storage medium for concentrating solar power facilities. These particles will experience a wide range of operating temperatures (300-1000 K) and handling conditions (dense to dilute falling particle curtains, dense granular flows, or dense structures), requiring specially-designed and optimized infrastructures. The relative influence of collisional and frictional interactions between particles varies based on temperature-dependent particulate properties and greatly impacts the bulk, granular flow behavior. These underlying physics are captured using discrete element method modeling tools. However, this modeling method is computationally expensive as each particle position and interaction is tracked during the simulation. These modeling methods are further complicated by introducing temperature-dependent particle properties, high-temperature radiative exchange, and directional irradiation sources experienced by granular flows in concentrating solar power environments. In this study, coupled experimental and numerical slump testing of aluminosilicate particles was performed and computationally efficient radiative exchange models were evaluated to establish best-practices for discrete element method models for concentrating solar power environments. The three particle types investigated included Carbobead HSP 30 /60, Carbobead CP 30/60, and Granusil 4030. Existing modeling limitations and computationally-efficient multi-modal heat transfer models were evaluated using Aspherix®, a commercial discrete element method software. High-temperature (< 1073 K) slump testing of aluminosilicate particles was performed to investigate the deviation between experimentally-observed and numerically-predicted angles of repose introduced by computation-time reduction practices including the relaxation of the particle elastic modulus and coarse-graining. Coarse-graining is used to use a single modeled particle that is representative of a collection of smaller particles, decreasing the computational cost at the expense of geometric accuracy. Additionally, relaxation of the elastic modulus is used to reduce computational time at the expense of an increased, modeled particle overlap. Prior studies have determined that aluminosilicate particles retain a high elastic modulus at high temperatures (< 1073 K), requiring small simulation timesteps to ensure resolved contact forces resemble appropriate solid mechanics. A parametric study was performed to evaluate the influence of computation time improvements on the deviation between experimental and modeled angle of repose across high temperatures < 1073 K. Additionally, numerical case studies were performed on candidate particle systems at varying porosities and temperatures. These studies were performed to investigate the influence of computationally-efficient radiative-exchange modeling methods coupled to Aspherix® on modeled accuracy and computation time. The recently-developed distance-based approximation was evaluated in estimating radiative exchange between particles and participating surfaces located in close proximity. The distance based approximation was developed to use tabulated estimates of the radiative distribution factor between individual particles and surfaces in close proximity (< 40 particle radii). These methods were expanded to the aluminosilicate particles of interest, including the influence of particle size distributions. To capture radiative exchange between particles and surfaces not in close proximity (> 40 particle radii) and to capture the absorption of directional irradiation from concentrating solar resources, a volumetrically-averaged radiative distribution factor was calculated between the modeled granular flow and surfaces using Monte Carlo ray-tracing for participating media. Volume-averaged absorption and scattering coefficients were predicted using a volumetric discretization of the modeled domain with monodisperse approximations based on geometric optics and experimentally-determined scattering phase functions for aluminosilicate particles.

14 SOLAR ENERGY↗

Higher-order adaptive finite-element methods for Kohn–Sham density functional theory

We present an efficient computational approach to perform real-space electronic structure calculations using an adaptive higher-order finite-element discretization of Kohn–Sham density-functional theory (DFT). To this end, we develop an a priori mesh-adaption technique to construct a close to optimal finite-element discretization of the problem. We further propose an efficient solution strategy for solving the discrete eigenvalue problem by using spectral finite-elements in conjunction with Gauss–Lobatto quadrature, and a Chebyshev acceleration technique for computing the occupied eigenspace. The proposed approach has been observed to provide a staggering 100–200-fold computational advantage over the solution of a generalized eigenvalue problem. Using the proposed solution procedure, we investigate the computational efficiency afforded by higher-order finite-element discretizations of the Kohn–Sham DFT problem. Our studies suggest that staggering computational savings—of the order of 1000-fold—relative to linear finite-elements can be realized, for both all-electron and local pseudopotential calculations, by using higher-order finite-element discretizations. On all the benchmark systems studied, we observe diminishing returns in computational savings beyond the sixth-order for accuracies commensurate with chemical accuracy, suggesting that the hexic spectral-element may be an optimal choice for the finite-element discretization of the Kohn–Sham DFT problem. A comparative study of the computational efficiency of the proposed higher-order finite-element discretizations suggests that the performance of finite-element basis is competing with the plane-wave discretization for non-periodic local pseudopotential calculations, and compares to the Gaussian basis for all-electron calculations to within an order of magnitude. Further, we demonstrate the capability of the proposed approach to compute the electronic structure of a metallic system containing 1688 atoms using modest computational resources, and good scalability of the present implementation up to 192 processors.

97 MATHEMATICS AND COMPUTING↗

REVEAL: An Extensible Reduced Order Model Builder for Simulation and Modeling

Many science domains need to build computationally efficient and accurate representations of high fidelity, computationally expensive simulations. These computationally efficient versions are known as reduced-order models. This paper presents the design and implementation of a novel reduced-order model (ROM) builder, the REVEAL toolset. This toolset generates ROMs based on science- and engineering-domain specific simulations executed on high performance computing (HPC) platforms. The toolset encompasses a range of sampling and regression methods that can be used to generate a ROM, automatically quantifies the ROM accuracy, and provides support for an iterative approach to improve ROM accuracy. REVEAL is designed to be extensible in order to utilize the core functionality with any simulator that has published input and output formats. It also defines programmatic interfaces to include new sampling and regression techniques so that users can ‘mix and match’ mathematical techniques to best suit the characteristics of their model. In this paper, we describe the architecture of REVEAL and demonstrate its usage with a computational fluid dynamics model used in carbon capture.

Surrogate model, reduced order model, sensitivity ↗

Applicability of available Li-ion battery degradation models for system and control algorithm design

Within electrified vehicle powertrains, lithium-ion battery performance degrades with aging and usage, resulting in a loss in both energy and power capacity. As a result, models used for system design and control algorithm development would ideally capture the impact of those efforts on battery capacity degradation, be computationally efficient, and simple enough to be used for algorithm development. This paper provides an assessment of the state-of-the-art in lithium-ion battery degradation models, including accuracy, computational complexity, and amenability to control algorithm development. Various aging and degradation models have been studied in the literature, including physics-based electrochemical models, semi-empirical models, and empirical models. Some of these models have been validated with experimental data; however, comparisons of pre-existing degradation models across multiple experimental data sets have not been previously published. Three representative models, a 1-d electrochemical model (a combination of performance model and degradation model), a semi-empirical degradation model (the performance is predicted by an equivalent circuit model) and an empirical degradation model (the performance is predicted by an equivalent circuit model), are compared against four published experimental data sets for a 2.3-Ah commercial graphite/LiFePO 4 cell. Based on simulation results and comparisons to experimental data, the key differences in the aging factors captured by each of the models are summarized. Here the results show that the physics-based model is best able to capture results across all four representative data sets with an error less than 10%, but is 20x slower than the empirical model, and 134x slower than the semi-empirical model, making it unsuitable for powertrain system design and model-based algorithm development. Despite being computationally efficient, the semi-empirical and empirical models, when used under conditions that lie outside the calibration data set, exhibit up to 71% error in capacity loss prediction. Such models require expensive experimental data collection to recalibrate for every new application. Thus, in the author’s opinion, there exists a need for a physically-based model that generalizes well across operating conditions, is computationally efficient for model-based design, and simple enough for control algorithm development.

25 ENERGY STORAGE↗

Extending the subspace hybrid method for eigenvalue problems in reactor physics calculation

This paper presents an innovative hybrid Monte-Carlo-Deterministic method denoted by the SUBSPACE method designed for improving the efficiency of hybrid methods for reactor analysis applications. The SUBSPACE method achieves its high computational efficiency by taking advantage of the existing correlations between desired responses. Recently, significant gains in computational efficiency have been demonstrated using this method for source driven problems. Within this work the mathematical theory behind the SUBSPACE method is introduced and extended to address core wide level k-eigenvalue problems. The method's efficiency is demonstrated based on a three-dimensional quarter-core problem, where responses are sought on the pin cell level. The SUBSPACE method is compared to the FW-CADIS method and is found to be more efficient for the utilized test problem because of the reason that the FW-CADIS method solves a forward eigenvalue problem and an adjoint fixed-source problem while the SUBSPACE method only solves an adjoint fixed-source problem. Based on the favorable results obtained here, we are confident that the applicability of Monte Carlo for large scale reactor analysis could be realized in the near future. (authors)

97 MATHEMATICS AND COMPUTING↗