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 1,099 records · Page 61

Computer Aided Battery Engineering Consortium

A multi-national lab collaborative team was assembled that includes experts from academia and industry to enhance recently developed Computer-Aided Battery Engineering for Electric Drive Vehicles (CAEBAT)-II battery crush modeling tools and to develop microstructure models for electrode design - both computationally efficient. Task 1. The new Multi-Scale Multi-Domain model framework (GH-MSMD) provides 100x to 1,000x computation speed-up in battery electrochemical/thermal simulation while retaining modularity of particles and electrode-, cell-, and pack-level domains. The increased speed enables direct use of the full model in parameter identification. Task 2. Mechanical-electrochemical-thermal (MECT) models for mechanical abuse simulation were simultaneously coupled, enabling simultaneous modeling of electrochemical reactions during the short circuit, when necessary. The interactions between mechanical failure and battery cell performance were studied, and the flexibility of the model for various batteries structures and loading conditions was improved. Model validation is ongoing to compare with test data from Sandia National Laboratories. The ABDT tool was established in ANSYS. Task 3. Microstructural modeling was conducted to enhance next-generation electrode designs. This 3- year project will validate models for a variety of electrodes, complementing Advanced Battery Research programs. Prototype tools have been developed for electrochemical simulation and geometric reconstruction.

25 ENERGY STORAGE↗

A parallel-vector Lanczos eigen-solver for structural vibration problems

The Lanczos algorithm for the solution of generalized eigen-problem has been receiving a lot of attention in recent years due to its computational efficiency. The focus of this paper is to develop a Lanczos algorithm which can exploit both the parallel and vector capabilities provided by modern high-performance computers. A partial restoring orthogonality scheme is also developed and incorporated into the basic Lanczos algorithm. The numerical performance in terms of accuracy and efficiency of the proposed parallel-vector Lanczos algorithm is demonstrated by solving for the frequencies and mode shapes of structural problems on multiprocessor supercomputers.

Qin, Jiangning↗

Linear Solver for Electromagnetic Simulation of General Distribution Feeders

High-fidelity electromagnetic transient (EMT) modeling is required for accurate simulation and analysis of power system dynamics in modern distribution feeders. However, the high-fidelity of EMT models often leads to significant computational challenges, particularly in terms of computational resources and simulation time. This paper investigates the development and application of a detailed EMT model for general distribution feeders, with a focus on improving computational efficiency. A direct linear solver is proposed for a bordered block diagonal (BBD) matrix structure commonly encountered in a EMT model of distribution feeders. The solver integrates the Schur complement method with the block tridiagonal matrix algorithm to enhance the computational performance. The proposed solver is validated using the primary feeder of the IEEE 342-node test system, demonstrating its accuracy and efficiency in EMT simulations. Furthermore, the solver’s performance is benchmarked against MATLAB’s built-in linear solvers, showing significant improvements in computation time while maintaining high fidelity and accuracy in simulation results.

Choi, Jongchan [ORNL] (ORCID:000000025952455X)↗

Further Investigation of Employing Binomial Small-Sample Estimator in M-LROM

Reduced Order Modeling (ROM) is essential to enable the identification of the so-called active parameter subspace for high-fidelity models that are employed in computationally intensive analyses such as uncertainty characterization and data assimilation. Given the complexity of models for real-world application, brute force methods to identify the active subspace may not be computationally efficient to realize the value of reduction, since in realistic problems, the full scale model must be executed few hundred times, which may be computationally taxing. Earlier work has introduced a new approach, which represents a further development of our previous work on ROM, referred to as multi-level ROM (M-LROM). In M-LROM, approximate models are employed to identify the active subspace instead of the full scale model. In this summary, we present our recent results on M-LROM, specifically in regard to the construction of reliable error metrics that can bound the errors resulting from the reduction. The idea is to employ a lower fidelity model, i.e., an approximation of the full scale or high fidelity model, to build the active subspace, and via the proposed error bound, the quality of the active subspace can be determined by calculating an upper bound on the errors resulting from the reduction. For this approach to be practical, the error bound must be realistic, implying that it should be close to the actual errors expected, and not much higher. Therefore, an important goal of this summary is to compare different error bounds in terms of the relation between their estimated bounds to the actual errors. In particular, we compare the proposed error bound which numerically construct an estimator using binomial distribution to the widely used small-sample norm estimators. Unlike most probabilistic error estimation methods, the proposed bound employs a binomial distribution to construct the estimator whereas in other conventional methods, the distribution employed is typically the standard Gaussian, normalized over a unit hypersphere as initially proposed by the seminal paper of J. Dixon on random matrix theory. Previous publications provided evidence that the binomial distribution calculates more realistic bounds as compared to the Gaussian distribution, which tends to be conservative, implying that the bound is much bigger than the actual errors, which diminishes the value of the reduction, as now must increase the size of the active subspace to reach the desired upper bound on the reduction errors. This work has provided a rigorous approach by which error bounds on the reduction errors can be established without having to execute the high fidelity model during the construction of the active subspace. The high fidelity model is only need to test the error bound using small number of executions. This methodology paves the way for a more efficient application of ROM to complex engineering models, where standard ROM techniques may be too taxing to optimally realize their value in practical situations. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A High-Fidelity Modeling Tool to Support the Design of Oxy-Combustors for Direct-Fired Supercritical CO2 Cycles

The challenge in the design of oxy-combustors for direct-fired supercritical CO 2 (sCO 2 ) cycles is in addressing disparate performance metrics and objectives. Key design parameters to consider include, among others, injector design for mixing and flame stability, split of recycled CO 2 diluent between injectors and cooling films, target flame temperatures to control noncondensable products, and strategies to inject the diluent CO 2 for film cooling and thermal control. In order to support novel oxy-combustor designs, a high-fidelity yet numerically efficient modeling framework based on the CRUNCH CFD® flow solver is presented, featuring key physics-based submodels relevant in this regime. For computational efficiency in modeling large kinetic sets, a flamelet/progress variable (FPV) based tabulated-chemistry approach is utilized featuring a three-stream extension to allow for the simulation of the CO 2 film cooling stream in addition to the fuel and oxidizer streams. Finite rate chemistry effects are modeled in terms of multiple progress variables for the primary flame as well as for slower-evolving chemical species such as NO x and SO x contaminants. Real fluid effects are modeled using advanced equations of states. The predictive capabilities of this computationally tractable design support tool are demonstrated on a conceptual injector design for an oxy-combustor operating near 30 MPa. Simulations results provide quantitative feedback on the effectiveness of the film cooling as well as the level of contaminants (CO, NO, and N) in the exhaust due to impurities entering from the injectors. These results indicate that this framework would be a useful tool for refining and optimizing the oxy-combustor designs as well as risk mitigation analyses.

Engineering↗

A diagonal implicit multigrid algorithm for the Euler equations

A multigrid implementation of the Alternating Direction Implicit algorithm has been developed to solve the Euler equations of inviscid, compressible flow. The equations are approximated using a finite-volume spatial approximation with added dissipation provided by an adaptive blend of second and fourth differences. For computational efficiency, the equations are diagonalized by a local similariity transformation so that only a decoupled system of scalar pentadiagonal systems need be solved along each line. Results are computed for transonic flows past airfoils and include pressure distributions to verify the accuracy of the basic scheme and convergence histories to demonstrate the efficiency of the method.

Caughey, David A.↗

Generating relevant kinetic Monte Carlo catalogs using temperature accelerated dynamics with control over the accuracy

We develop a variation of the temperature accelerated dynamics (TAD) method, called the p-TAD method, that efficiently generates an on-the-fly kinetic Monte Carlo (KMC) process catalog with control over the accuracy of the catalog. It is assumed that transition state theory is valid. The p-TAD method guarantees that processes relevant at the timescales of interest to the simulation are present in the catalog with a chosen confidence. A confidence measure associated with the process catalog is derived. The dynamics is then studied using the process catalog with the KMC method. Effective accuracy of a p-TAD calculation is derived when a KMC catalog is reused for conditions different from those the catalog was originally generated for. Different KMC catalog generation strategies that exploit the features of the p-TAD method and ensure higher accuracy and/or computational efficiency are presented. The accuracy and the computational requirements of the p-TAD method are assessed. Comparisons to the original TAD method are made. As an example, we study dynamics in sub-monolayer Ag/Cu(110) at the time scale of seconds using the p-TAD method. It is demonstrated that the p-TAD method overcomes several challenges plaguing the conventional KMC method.

74 ATOMIC AND MOLECULAR PHYSICS↗

Machine learning predictions of diffusion in bulk and confined ionic liquids using simple descriptors

Ionic liquids have many intriguing properties and widespread applications such as separations and energy storage. However, ionic liquids are complex fluids and predicting their behavior is difficult, particularly in confined environments. We introduce fast and computationally efficient machine learning (ML) models that can predict diffusion coefficients and ionic conductivity of bulk and nanoconfined ionic liquids over a wide temperature range (350–500 K). The ML models are trained on molecular dynamics simulation data for 29 unique ionic liquids as bulk fluids and confined in graphite slit pores. This model is based on simple physical descriptors of the cations and anions such as molecular weight and surface area. Here, we also demonstrate that accurate results can be obtained using only descriptors derived from SMILES (simplified molecular-input line-entry system) codes for the ions with minimal computational effort. This offers a fast and efficient method for estimating diffusion and conductivity of nanoconfined ionic liquids at various temperatures without the need for expensive molecular dynamics simulations.

74 ATOMIC AND MOLECULAR PHYSICS↗

Screening and Discovery of Metal Compound Active Sites for Strong and Selective Adsorption of N 2 in Air

Photocatalytic nitrogen fixation has the potential to provide a greener route for producing nitrogen-based fertilizers under ambient conditions. Computational screening is a promising route to discover new materials for the nitrogen fixation process, but requires identifying “descriptors” that can be efficiently computed. In this work, we argue that selectivity toward the adsorption of molecular nitrogen and oxygen can act as a key descriptor. A catalyst that can selectively adsorb nitrogen and resist poisoning of oxygen and other molecules present in air has the potential to facilitate the nitrogen fixation process under ambient conditions. Here we provide a framework for active site screening based on multifidelity density functional theory (DFT) calculations for a range of metal oxides, oxyborides, and oxyphosphides. The screening methodology consists of initial low-fidelity fixed geometry calculations and a second screening in which more expensive geometry optimizations were performed. The approach identifies promising active sites on several TiO 2 polymorph surfaces and a VBO 4 surface, and the full nitrogen reduction pathway is studied with the BEEF-vdW and HSE06 functionals on two active sites. The findings suggest that metastable TiO 2 polymorphs may play a role in photocatalytic nitrogen fixation, and that VBO 4 may be an interesting material for further studies.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Large scale Brownian dynamics of confined suspensions of rigid particles

We introduce methods for large-scale Brownian Dynamics (BD) simulation of many rigid particles of arbitrary shape suspended in a fluctuating fluid. Our method adds Brownian motion to the rigid multiblob method [F. Balboa Usabiaga et al., Commun. Appl. Math. Comput. Sci. 11(2), 217–296 (2016)] at a cost comparable to the cost of deterministic simulations. We demonstrate that we can efficiently generate deterministic and random displacements for many particles using preconditioned Krylov iterative methods, if kernel methods to efficiently compute the action of the Rotne-Prager-Yamakawa (RPY) mobility matrix and its “square” root are available for the given boundary conditions. These kernel operations can be computed with near linear scaling for periodic domains using the positively split Ewald method. Here we study particles partially confined by gravity above a no-slip bottom wall using a graphical processing unit implementation of the mobility matrix-vector product, combined with a preconditioned Lanczos iteration for generating Brownian displacements. We address a major challenge in large-scale BD simulations, capturing the stochastic drift term that arises because of the configuration-dependent mobility. Unlike the widely used Fixman midpoint scheme, our methods utilize random finite differences and do not require the solution of resistance problems or the computation of the action of the inverse square root of the RPY mobility matrix. We construct two temporal schemes which are viable for large-scale simulations, an Euler-Maruyama traction scheme and a trapezoidal slip scheme, which minimize the number of mobility problems to be solved per time step while capturing the required stochastic drift terms. We validate and compare these schemes numerically by modeling suspensions of boomerang-shaped particles sedimented near a bottom wall. Using the trapezoidal scheme, we investigate the steady-state active motion in dense suspensions of confined microrollers, whose height above the wall is set by a combination of thermal noise and active flows. We find the existence of two populations of active particles, slower ones closer to the bottom and faster ones above them, and demonstrate that our method provides quantitative accuracy even with relatively coarse resolutions of the particle geometry.

97 MATHEMATICS AND COMPUTING↗

Deterministic absorbed dose estimation in computed tomography using a discrete ordinates method

Purpose: Organ dose estimation for a patient undergoing computed tomography (CT) scanning is very important. Although Monte Carlo methods are considered gold-standard in patient dose estimation, the computation time required is formidable for routine clinical calculations. Here, the authors instigate a deterministic method for estimating an absorbed dose more efficiently. Methods: Compared with current Monte Carlo methods, a more efficient approach to estimating the absorbed dose is to solve the linear Boltzmann equation numerically. In this study, an axial CT scan was modeled with a software package, Denovo, which solved the linear Boltzmann equation using the discrete ordinates method. The CT scanning configuration included 16 x-ray source positions, beam collimators, flat filters, and bowtie filters. The phantom was the standard 32 cm CT dose index (CTDI) phantom. Four different Denovo simulations were performed with different simulation parameters, including the number of quadrature sets and the order of Legendre polynomial expansions. A Monte Carlo simulation was also performed for benchmarking the Denovo simulations. A quantitative comparison was made of the simulation results obtained by the Denovo and the Monte Carlo methods. Results: The difference in the simulation results of the discrete ordinates method and those of the Monte Carlo methods was found to be small, with a root-mean-square difference of around 2.4%. It was found that the discrete ordinates method, with a higher order of Legendre polynomial expansions, underestimated the absorbed dose near the center of the phantom (i.e., low dose region). Simulations of the quadrature set 8 and the first order of the Legendre polynomial expansions proved to be the most efficient computation method in the authors’ study. The single-thread computation time of the deterministic simulation of the quadrature set 8 and the first order of the Legendre polynomial expansions was 21 min on a personal computer. Conclusions: The simulation results showed that the deterministic method can be effectively used to estimate the absorbed dose in a CTDI phantom. The accuracy of the discrete ordinates method was close to that of a Monte Carlo simulation, and the primary benefit of the discrete ordinates method lies in its rapid computation speed. It is expected that further optimization of this method in routine clinical CT dose estimation will improve its accuracy and speed.

07 ISOTOPE AND RADIATION SOURCES↗

Performance Impact and Trade-Offs for Tuning Key Architectural Parameters on CPU+GPU Systems

In this work, we performed an initial design space exploration of an accelerated processing unit (APU)—a hybrid CPU+GPU architecture that integrates both compute units (CUs) and memory into a unified system. This integration aims to reduce data movement, enhance memory locality, and improve energy efficiency by enabling the CPU and GPU to share memory directly. This effort focused on the interplay of key design components—cache line size, the number of CUs, and main memory technology—and the trade-offs of each configuration were analyzed. This paper highlights the various configurations’ impact on memory accesses, data reuse, and power utilization. The results provide valuable insights that can be leveraged to optimize APU architectures for high-performance and energy-efficient computing and thus create a balanced architecture. This optimization can be achieved by adopting dynamic cache management, runtime CU scaling, and advanced memory integration, highlighting the potential of APUs to address critical challenges in compute, data movement, and memory power consumption.

Asifuzzaman, Kazi [ORNL] (ORCID:0000000240044791)↗

Development and Demonstration of an Ada Test Generation System

In this project we have built a prototype system that performs Feasible Path Analysis on Ada programs: given a description of a set of control flow paths through a procedure, and a predicate at a program point feasible path analysis determines if there is input data which causes execution to flow down some path in the collection reaching the point so that tile predicate is true. Feasible path analysis can be applied to program testing, program slicing, array bounds checking, and other forms of anomaly checking. FPA is central to most applications of program analysis. But, because this problem is formally unsolvable, syntactic-based approximations are used in its place. For example, in dead-code analysis the problem is to determine if there are any input values which cause execution to reach a specified program point. Instead an approximation to this problem is computed: determine whether there is a control flow path from the start of the program to the point. This syntactic approximation is efficiently computable and conservative: if there is no such path the program point is clearly unreachable, but if there is such a path, the analysis is inconclusive, and the code is assumed to be live. Such conservative analysis too often yields unsatisfactory results because the approximation is too weak. As another example, consider data flow analysis. A du-pair is a pair of program points such that the first point is a definition of a variable and the second point a use and for which there exists a definition-free path from the definition to the use. The sharper, semantic definition of a du-pair requires that there be a feasible definition-free path from the definition to the use. A compiler using du-pairs for detecting dead variables may miss optimizations by not considering feasibility. Similarly, a program analyzer computing program slices to merge parallel versions may report conflicts where none exist. In the context of software testing, feasibility analysis plays an important role in identifying testing requirements which are infeasible. This is especially true for data flow testing and modified condition/decision coverage. Our system uses in an essential way symbolic analysis and theorem proving technology, and we believe this work represents one of the few successful uses of a theorem prover working in a completely automatic fashion to solve a problem of practical interest. We believe this work anticipates an important trend away from purely syntactic-based methods for program analysis to semantic methods based on symbolic processing and inference technology. Other results demonstrating the practical use of automatic inference is being reported in hardware verification, although there are significant differences between the hardware work and ours. However, what is common and important is that general purpose theorem provers are being integrated with more special-purpose decision procedures to solve problems in analysis and verification. We are pursuina commercial opportunities for this work, and will use and extend the work in other projects we are engaged in. Ultimately we would like to rework the system to analyze C, C++, or Java as a key step toward commercialization.

Source record↗

Invariant Imbedded T-Matrix Method for Axial Symmetric Hydrometeors with Extreme Aspect Ratios

The single-scattering properties (SSPs) of hydrometeors are the fundamental quantities for physics-based precipitation retrievals. Thus, efficient computation of their electromagnetic scattering is of great value. Whereas the semi-analytical T-Matrix methods are likely the most efficient for nonspherical hydrometeors with axial symmetry, they are not suitable for arbitrarily shaped hydrometeors absent of any significant symmetry, for which volume integral methods such as those based on Discrete Dipole Approximation (DDA) are required. Currently the two leading T-matrix methods are the Extended Boundary Condition Method (EBCM) and the Invariant Imbedding T-matrix Method incorporating Lorentz-Mie Separation of Variables (IITM+SOV). EBCM is known to outperform IITM+SOV for hydrometeors with modest aspect ratios. However, in cases when aspect ratios become extreme, such as needle-like particles with large height to diameter values, EBCM fails to converge. Such hydrometeors with extreme aspect ratios are known to be present in solid precipitation and their SSPs are required to model the radiative responses accurately. In these cases, IITM+SOV is shown to converge. An efficient, parallelized C++ implementation for both EBCM and IITM+SOV has been developed to conduct a performance comparison between EBCM, IITM+SOV, and DDSCAT (a popular implementation of DDA). We present the comparison results and discuss details. Our intent is to release the combined ECBM IITM+SOV software to the community under an open source license.

Pelissier, Craig↗

An Improved Ionospheric Correction Method for Wide-Area Augmentation Systems

A powerful approach for generating ionospheric corrections in wide area differential GPS applications has been developed, that can be applied to the Federal Aviation Administration's Wide Area Augmentation System (WAAS). This approach has been used to support ionospheric calibration for NASA's Deep Space Network and will be supporting real-time operations for global ionospheric specification and, possibly, single-frequency satellite altimeter calibration. It is a real-time, grid-based technique relying on a computationally efficient Kalman-type filter to produce accurate, smoothly varying ionospheric correction maps over the coverage area. Formal error maps are also computed, providing vertical delay errors over the WAAS grid, which are useful in integrity monitoring. This solution to the ionospheric correction problem is self-calibrating, since GPS transmitter inter-frequency biases are obtained as a by-product of the mapping procedure. This contrasts with other techniques in which bias values must be provided from some additional source.

Wide-Area↗

SPECT imaging with resolution recovery

Single-photon emission computed tomography (SPECT) is a method of choice for imaging spatial distributions of radioisotopes. Many applications of this method are found in nuclear industry, medicine, and biomedical research. We study mathematical modeling of a micro-SPECT system by using a point-spread function (PSF) and implement an OSEM-based iterative algorithm for image reconstruction with resolution recovery. Unlike other known implementations of the OSEM algorithm, we apply en efficient computation scheme based on a useful approximation of the PSF, which ensures relatively fast computations. The proposed approach can be applied with the data acquired with any type of collimators, including parallel-beam fan-beam, cone-beam and pinhole collimators. Experimental results obtained with a micro SPECT system demonstrate high efficiency of resolution recovery. (authors)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Convergence Study of LR-NDA Using Fourier Analysis

Numerical solution of neutron transport equations is challenging. It often requires acceleration techniques to improve computational efficiency. In the last two decades, various acceleration methods have been developed. Among those methods, the coarse-mesh nonlinear diffusion acceleration (CM-NDA) technique, or commonly known as coarse-mesh finite difference (CMFD), becomes one of the most popular methods due to its effectiveness and simplicity in recent years. However, CM-NDA will lose its effectiveness and could become unstable when the mesh optical thickness becomes large. There exists a number of stabilization techniques to improve the stability of CM-NDA, such as pCMFD and most recent odCMFD. Wang et al., proposed a new CM-NDA scheme, LR-NDA, which employs local refinement on the coarse mesh. The new scheme can significantly improve the effectiveness and stability of CM-NDA. In this paper, we perform a convergence study of LR-NDA using Fourier analysis. The spectral radius calculated from Fourier analysis is consistent with the numerical results for a 1-D fixed source model problem.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Qutrit circuits and algebraic relations: A pathway to efficient spin-1 Hamiltonian simulation

Quantum information processing has witnessed significant advancements through the application of qubit-based techniques within universal gate sets. Recently, exploration beyond the qubit paradigm to d -dimensional quantum units or qudits has opened new avenues for improving computational efficiency. This paper delves into the qudit-based approach, particularly addressing the challenges presented in the high-fidelity implementation of qudit-based circuits due to increased complexity. As an innovative approach towards enhancing qudit circuit fidelity, we explore algebraic relations, such as the Yang-Baxter-like turnover equation, which may enable circuit compression and optimization. The paper introduces the turnover relation for the three-qutrit time propagator and its potential use in reducing circuit depth. We further investigate whether this relation can be generalized for higher-dimensional quantum circuits, including a focused study on the one-dimensional spin-1 Heisenberg model. Our paper outlines both rigorous and numerically efficient approaches to potentially achieve this generalization, providing a foundation for further explorations in the field of qudit-based quantum computing.

97 MATHEMATICS AND COMPUTING↗