Search NASA⌕ Search

SEARCH · Search NASA

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

Computing Gravitational Bumps From Repeating-Orbit Data

Iterative, least-squares algorithm efficiently computes estimates of both position errors indicative of irregularities in gravitational field of Earth and trajectory of satellite in orbit repeating along same ground track. Exploits sparse-matrix techniques. Useful in surveying, navigation, and geophysical research. Particularly useful for processing data on trajectory of satellite in low orbit tracked via Global Positioning System (GPS).

Wu, Jiun-Tsong↗

Efficient High Pressure MixtureState Equations

A method is presented for an accurate noniterative, computationally efficient calculation of high pressure fluid mixture equations of state, especially targeted to gas turbines and rocket engines. Pressures above 1 bar and temperatures above 100 K are addressed. The method is based on curve fitting an effective reference state relative to departure funcitons formed using the Peng-Robinson cubic state equation. Fit parameters for H(sub 2), O(sub 2), N(sub 2), propane, n-heptane and methanol are given.

thermodynamics state equations noniterative mixtur↗

Efficient Algorithm for Rectangular Spiral Search

An algorithm generates grid coordinates for a computationally efficient spiral search pattern covering an uncertain rectangular area spanned by a coordinate grid. The algorithm does not require that the grid be fixed; the algorithm can search indefinitely, expanding the grid and spiral, as needed, until the target of the search is found. The algorithm also does not require memory of coordinates of previous points on the spiral to generate the current point on the spiral.

Brugarolas, Paul↗

Efficient modeling of interconnects and capacitive discontinuities in high-speed digital circuits

Modeling of interconnects and associated discontinuities with the recent advances high-speed digital circuits has gained a considerable interest over the last decade although the theoretical bases for analyzing these structures were well-established as early as the 1960s. Ongoing research at the present time is focused on devising methods which can be applied to more general geometries than the ones considered in earlier days and, at the same time, improving the computational efficiency and accuracy of these methods. In this thesis, numerically efficient methods to compute the transmission line parameters of a multiconductor system and the equivalent capacitances of various strip discontinuities are presented based on the quasi-static approximation. The presented techniques are applicable to conductors embedded in an arbitrary number of dielectric layers with two possible locations of ground planes at the top and bottom of the dielectric layers. The cross-sections of conductors can be arbitrary as long as they can be described with polygons. An integral equation approach in conjunction with the collocation method is used in the presented methods. A closed-form Green's function is derived based on weighted real images thus avoiding nested infinite summations in the exact Green's function; therefore, this closed-form Green's function is numerically more efficient than the exact Green's function. All elements associated with the moment matrix are computed using the closed-form formulas. Various numerical examples are considered to verify the presented methods, and a comparison of the computed results with other published results showed good agreement.

Oh, K. S.↗

Computation of two-phase shear-layer flow using an Eulerian-Lagrangian analysis

A combined Eulerian-Lagrangian analysis which combines a linearized block implicit Navier-Stokes analysis for the continuous phase with a Lagrangian analysis for the discrete phase has been utilized to simulate a two-phase shear-layer flow in a two-dimensional channel flow configuration. The motion of the particles is tracked in computational coordinate space, resulting in improved computational efficiency, and interphase coupling terms for the Eulerian analysis are computed from the instantaneous distribution of the particles rather than the trajectory information. The use of the implicit Navier-Stokes analysis for the continuous phase has made it possible to efficiently use a highly stretched mesh. A low Reynolds number form of the k-epsilon turbulence model was used with near-wall resolution, thus eliminating the need to use the 'wall-function' approach. The streamwise velocity profiles for the continuous and the discrete phases have been compared with experimental data for two test cases.

Sabnis, Jayant S.↗

Fast methods for multisite charge transfer processes. I. Constrained, state averaged CASSCF(1,n) and CASSCF(2n − 1,n) simulations

We design a dynamically weighted state-averaged constrained complete active space self-consistent field (DW-SA-cCASSCF) algorithm to treat electrons or holes moving between n molecular fragments (where n can be larger than 2). Within such a so-called eDSCn/hDSCn approach, we consider configurations that are mutually single excitations of each other, and we apply a generalized set of constraints to tailor the method for studying charge transfer problems. The constrained optimization problem is efficiently solved using a DIIS-SQP algorithm, thus maintaining computational efficiency. We demonstrate the method for a finite Su–Schrieffer–Heeger chain, successfully reproducing the expected exponential decay of diabatic couplings with distance. When combined with a gradient, the current extension immediately enables efficient nonadiabatic dynamics simulations of complex multi-state charge transfer processes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Automated Development of Accurate Algorithms and Efficient Codes for Computational Aeroacoustics

The simulation of sound generation and propagation in three space dimensions with realistic aircraft components is a very large time dependent computation with fine details. Simulations in open domains with embedded objects require accurate and robust algorithms for propagation, for artificial inflow and outflow boundaries, and for the definition of geometrically complex objects. The development, implementation, and validation of methods for solving these demanding problems is being done to support the NASA pillar goals for reducing aircraft noise levels. Our goal is to provide algorithms which are sufficiently accurate and efficient to produce usable results rapidly enough to allow design engineers to study the effects on sound levels of design changes in propulsion systems, and in the integration of propulsion systems with airframes. There is a lack of design tools for these purposes at this time. Our technical approach to this problem combines the development of new, algorithms with the use of Mathematica and Unix utilities to automate the algorithm development, code implementation, and validation. We use explicit methods to ensure effective implementation by domain decomposition for SPMD parallel computing. There are several orders of magnitude difference in the computational efficiencies of the algorithms which we have considered. We currently have new artificial inflow and outflow boundary conditions that are stable, accurate, and unobtrusive, with implementations that match the accuracy and efficiency of the propagation methods. The artificial numerical boundary treatments have been proven to have solutions which converge to the full open domain problems, so that the error from the boundary treatments can be driven as low as is required. The purpose of this paper is to briefly present a method for developing highly accurate algorithms for computational aeroacoustics, the use of computer automation in this process, and a brief survey of the algorithms that have resulted from this work. A review of computational aeroacoustics has recently been given by Lele.

Goodrich, John W.↗

Shaping Diffraction-Grating Grooves to Optimize Efficiency

A method of shaping diffraction-grating grooves to optimize the spectral efficiency, spectral range, and image quality of a spectral imaging instrument is under development. The method is based on the use of an advanced design algorithm to determine the possibly complex shape of grooves needed to obtain a desired efficiency-versus-wavelength response (see figure). Then electron- beam fabrication techniques are used to realize the required groove shape. The method could be used, for example, to make the spectral efficiency of the grating in a given wavelength range proportional to the inverse of the spectral efficiency of a photodetector array so that the overall spectral efficiency of the combination of the grating and the photodetector array would be flat. The method has thus far been applied to one-dimensional gratings only, but in principle, it is also applicable to two-dimensional gratings. The algorithm involves calculations in the spatial-frequency domain. The spatial-frequency spectrum of a grating is represented as a diffraction-order spectral-peak-width function multiplied by an efficiency function for a single grating groove. This representation affords computational efficiency and accuracy by making it possible to consider only the response from one grating groove (one period of the grating), instead of from the whole grating area, in determining the response from the entire grating. This combination of efficiency and accuracy is crucial for future extensions of the algorithm to two-dimensional designs and to designs in which polarization must also be taken into account. The algorithm begins with the definition of target values of relative efficiency that represent the desired spectral response of the grating in certain spectral frequencies calculated from the diffraction order and wavelength. The grating period is divided into a number of cells - typically, 100. The phase contribution from each cell is determined from the phase of the incident electromagnetic wave and the height of the grating surface in the cell. The total contribution from all cells to each target value is then calculated. Then a method known to specialists as the optimum-rotation-angle method is used to adjust the height of each cell so that the total response from all cells is optimized. The computation is iterative and continues until the desired response is obtained. In the event that the desired response is unphysical, the algorithm nevertheless strives to generate a grating-grove profile for which the response approximates the desired one as closely as possible.

Backlund, John↗

A Computer Program for the Calculation of Three-Dimensional Transonic Nacelle/Inlet Flowfields

A highly efficient computer analysis was developed for predicting transonic nacelle/inlet flowfields. This algorithm can compute the three dimensional transonic flowfield about axisymmetric (or asymmetric) nacelle/inlet configurations at zero or nonzero incidence. The flowfield is determined by solving the full-potential equation in conservative form on a body-fitted curvilinear computational mesh. The difference equations are solved using the AF2 approximate factorization scheme. This report presents a discussion of the computational methods used to both generate the body-fitted curvilinear mesh and to obtain the inviscid flow solution. Computed results and correlations with existing methods and experiment are presented. Also presented are discussions on the organization of the grid generation (NGRIDA) computer program and the flow solution (NACELLE) computer program, descriptions of the respective subroutines, definitions of the required input parameters for both algorithms, a brief discussion on interpretation of the output, and sample cases to illustrate application of the analysis.

Vadyak, J.↗

Computational analysis of a stability robustness margin for structured real-parameter perturbations

An efficient computational method is presented for stability robustness analysis with structured real-parameter perturbations. A generic model of a class of uncertain dynamical systems is used as an example. The parameter uncertainty is characterized by a real scalar, epsilon. Multilinearity of the closed-loop characteristic polynomial is exploited to permit application of the mapping theorem to calculate the stability robustness margin. It is found that sensitive geometry of the stability boundary in the epsilon, omega-plane renders problematic the calculation of the minimum epsilon as a function of omega. This difficulty is avoided by calculating the minimum distance to the image of the uncertainty domain over omega as a function of epsilon. It is also shown that a certain class of uncertain dynamical systems has the required multilinearity property and are thus amenable to the proposed technique.

Wedell, Evan↗

Track reconstruction as a service for collider physics

Optimizing charged-particle track reconstruction algorithms is crucial for efficient event reconstruction in Large Hadron Collider (LHC) experiments due to their significant computational demands. Existing track reconstruction algorithms have been adapted to run on massively parallel coprocessors, such as graphics processing units (GPUs), to reduce processing time. Nevertheless, challenges remain in fully harnessing the computational capacity of coprocessors in a scalable and non-disruptive manner. This paper proposes an inference-as-a-service approach for particle tracking in high energy physics experiments. To evaluate the efficacy of this approach, two distinct tracking algorithms are tested: Patatrack, a rule-based algorithm, and Exa.TrkX, a machine learning-based algorithm. The as-a-service implementations show enhanced GPU utilization and can process requests from multiple CPU cores concurrently without increasing per-request latency. The impact of data transfer is minimal and insignificant compared to running on local coprocessors. This approach greatly improves the computational efficiency of charged particle tracking, providing a solution to the computing challenges anticipated in the High-Luminosity LHC era.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Efficiency and discrepancy in the direct simulation methods

The paper reviews the factors that affect the versatility, computational efficiency, and accuracy of the various direct simulation methods that are being applied to problems in rarefied gas dynamics. The influence of computer hardware developments on the cost-effectiveness is discussed, as are the software factors that influence the speed with which simulation programs can be applied to new problems. Particular attention is given to a novel method that improves the efficiency of the simulation for complex 3D problems. The topical issues of reduced resolution procedures, stored lists, and variance reduction schemes are discussed in some detail.

Bird, G. A.↗

Efficiently predicting pressure-composition-temperature diagrams to discover low-stability metal hydrides

Quantitatively accurate computational predictions of metal hydride thermodynamics are challenging but critical for alloy performance optimization across a multitude of technological domains, including hydrogen storage, compression, purification, and getters. Recent machine learning approaches have demonstrated great success in this area, but can potentially suffer from several shortcomings since they rely on imbalanced experimental training data and can have poor out-of-distribution (ood) test performance. Here, in this study, we circumvent such pitfalls by developing a computationally efficient, first principles-based workflow for direct prediction of metal hydride phase equilibrium, i.e., the pressure-composition-temperature (PCT) diagram. We then demonstrate its utility on predicting low stability hydrides derived from compositionally complex C14 Laves phase AB2 alloys. Specifically, we computationally predict and then experimentally validate an AB 2 alloy series (z < 0.6 for Ti 2−z Zr z CrMnFeNi) with ideal hydriding thermodynamics for a two-stage metal hydride-based compressor for pressurizing boil off from liquefied hydrogen. Importantly, this study lays the groundwork for accurate and efficient discovery/optimization of ood, low-stability hydrides for which purely data-driven approaches lack sufficient accuracy.

08 HYDROGEN↗

A Parametric, Data-Driven, Non-Intrusive Reduced-Order Model Framework for Crystal Plasticity Simulations of Voids

The influence of the internal structure at micrometer length scales on the deformation of polycrystalline materials can be effectively captured using crystal plasticity finite element methods (CPFEM). However, the complexity and nonlinearity of the deformation equations CPFEM solves demand significant computational power and resources to achieve accurate predictions, limiting its broader application. To address this challenge, we have identified a reduced-order representation of the complex data in order to establish a computationally efficient reduced-order models (ROM) and drastically reduce the computational expense of CPFEM. Specifically, in this work, we developed a parametric, data-driven, and non-intrusive ROM framework for CPFEM using proper orthogonal decomposition (POD) and sparse variational Gaussian process (SVGP) regression for single-crystal microstructures under tensile loading conditions. The developed protocol enables one to compress field into a latent/low-dimensional space described by principal component analysis (PCA) via the singular value decomposition (SVD) algorithm. As a result, the high-dimensional data are reduced to a significantly smaller amount of dimensions with POD bases and POD coefficients. Furthermore, we deployed an ensemble of SVGPs—extended from the classical Gaussian process (GP) regression for scalability and handling big data—in a massively parallel manner to train and predict latent POD coefficients using known POD bases from a set of previously obtained simulations results. Lastly, using the predicted POD coefficients, we reconstructed the full-field results and showed reasonable agreement compared with the true values obtained from running CPFEM. The developed framework is validated with a set of CPFEM simulations of a single embedded void in single-crystal aluminum alloy. While the framework is broadly applicable, this work specifically focuses on single-crystal microstructures, a single load case (e.g., tensile), and a specific void geometry (spherical).

Anisotropy↗

LuGo: An enhanced quantum phase estimation implementation

Quantum Phase Estimation (QPE) is a cardinal algorithm in quantum computing that plays a crucial role in various applications, including cryptography, molecular simulation, and solving systems of linear equations. However, the standard implementation of QPE faces challenges related to time complexity and circuit depth, which limit its practicality for large-scale computations. We introduce LuGo, a novel framework designed to enhance the performance of QPE by reducing circuit duplication, as well as using parallelization techniques to achieve faster generation of the QPE circuit and gate reduction. We validate the effectiveness of our framework by generating quantum linear solver circuits, which require both QPE and inverse QPE, to solve linear systems of equations. LuGo achieves significant improvements in both computational efficiency and hardware requirements without compromising on accuracy. Compared to a standard QPE implementation, LuGo reduces time consumption to generate a circuit that solves a 2 6 × 2 6 system matrix by a factor of 50.68 and over 31× reduction of quantum gates and circuit depth, with no fidelity loss on an ideal quantum simulator. Furthermore, we demonstrated the versatility and scalability of LuGo enabled HHL algorithm by simulating a canonical Hele-Shaw fluid problem using a quantum simulator. With these advantages, LuGo paves the way for more efficient implementations of QPE, enabling broader applications across several quantum computing domains.

Quantum algorithm↗

Hybrid Quantum Mechanical, Molecular Mechanical, and Machine Learning Potential for Computing Aqueous-Phase Adsorption Free Energies on Metal Surfaces

Performing reliable computer simulations of elementary processes occurring at metal–water interfaces is pivotal for novel catalyst design in sustainable energy applications. Computational catalyst design hinges on the ability to reliably and efficiently compute the potential energy surface (PES) of the system. Here, due to the large system sizes needed for studying processes at liquid water–metal interfaces, these systems can currently not be described using density functional theory (DFT). In this work, we used a hybrid quantum mechanical, molecular mechanical, and machine learning potential for studying the adsorption behavior of phenol, atomic hydrogen, 2-butanol, and 2-butanone on the (0001) facet of Ru under reducing conditions when Ru is not oxidized. Specifically, we describe the adsorbate and the surrounding metal atoms at the DFT level of theory. Here, we also considered the electrostatic field effect of the water molecules on adsorbate–metal interactions. Next, for the water–water and water–adsorbate interactions, we used established classical force fields. Finally, for the water–Ru surface interaction, for which no reliable force fields have been published, we used Behler–Parrinello high-dimensional neural network potentials (HDNNPs). Employing this setup, we used our explicit solvation for metal surface (eSMS) approach to compute the aqueous-phase effect on the low-coverage adsorption of selected molecules and atoms on the (0001) facet of Ru. In agreement with previous experimental and computational studies of oxygenated molecules over transition metal facets, we found that liquid water destabilizes the tested adsorbates on Ru(0001). Interestingly, our findings indicate that adsorbates on Ru are less affected by the presence of an aqueous phase than on other transition metals (e.g., Pt), highlighting the necessity of experimental investigations of Ru-based catalytic systems in liquid water.

Adsorption↗

Computational methods for aerodynamic design using numerical optimization

Five methods to increase the computational efficiency of aerodynamic design using numerical optimization, by reducing the computer time required to perform gradient calculations, are examined. The most promising method consists of drastically reducing the size of the computational domain on which aerodynamic calculations are made during gradient calculations. Since a gradient calculation requires the solution of the flow about an airfoil whose geometry was slightly perturbed from a base airfoil, the flow about the base airfoil is used to determine boundary conditions on the reduced computational domain. This method worked well in subcritical flow.

Peeters, M. F.↗

Convergence rate enhancement of navier-stokes codes on clustered grids

Our Sensitivity-Based Minimal Residual (SBMR) method which is based on our earlier Distributed Minimal Residual (DMR) method allows each component of the solution vector in a system of equations to have its own convergence speed. Our global SBMR method was found to consistently outperform the DMR method while requiring considerably less computer memory. Recently, we have developed and tested a new Line SBMR or LSBMR method and a Time-Step-Scaling (TSS) method that are even more robust and computationally efficient than our global SBMR method, especially on highly clustered computational grids in laminar and turbulent flow computations.

Choi, Kwang-Yoon↗