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 487 records · Page 27

A Hierarchical OPF Algorithm with Improved Gradient Evaluation in Three-Phase Networks

Linear approximation commonly used in solving alternating-current optimal power flow (AC-OPF) simplifies the system models but incurs accumulated voltage errors in large power networks. Such errors will make the primal-dual type gradient algorithms converge to solutions with voltage violation. In this paper, we improve a recent hierarchical OPF algorithm that rested on primal-dual gradients evaluated with a linearized distribution power flow model. Specifically, we propose a more accurate gradient evaluation method based on an unbalanced three-phase nonlinear distribution power flow model to mitigate the errors arising from linearization. The resultant gradients feature a blocked structure that enables our development of an improved hierarchical primal-dual algorithm to solve the OPF problem. Numerical results on the IEEE 123-bus test feeder and a 4,518-node test feeder show that the proposed method can enhance voltage safety at comparable computational efficiency with the linearized algorithm.

approximation algorithms↗

Computing material volume fractions on a superimposed mesh as applied to Monte Carlo particle transport simulations

Here, we present a newly implemented ray tracing algorithm in OpenMC for efficiently computing material volume fractions on superimposed meshes in complex geometries. By firing rays along each coordinate direction through the geometry, the approach accumulates track-length data in each mesh element, thereby determining the fractional composition of each material. Scaling studies on three different models—a random tetrahedra configuration, the Frascati Neutron Generator ITER dose rate benchmark, and a stellarator design—show excellent parallel performance, with nearly linear speedup on modern multi-threaded and distributed-memory systems. An analysis of the residual error relative to high-resolution reference solutions demonstrated that under optimal conditions it decreases as 1/R, where R is the number of rays fired, making it straightforward to achieve user-prescribed accuracy. This new functionality enables practical, mesh-based approaches for detailed nuclear analyses in production Monte Carlo workflows without resorting to expensive, fully conformal or unstructured meshing.

Monte Carlo↗

Neurobiological computational models in structural analysis and design

The present paper examines the role of neural computing strategies in structural analysis and design. A principal focus of the work resides in the use of neural networks to represent the force-displacement relationship in static structural analysis. Such models provide computationally efficient capabilities for reanalysis, and appear to be well suited for application in numerical optimum design. The paper presents an overview of the neural computing approach, with special emphasis on supervised learning techniques adopted in the present work. Special features of such learning strategies which have a direct bearing on numerical accuracy and efficiency, are examined in the context of representative structural optimization problems.

Hajela, P.↗

Neurobiological computational models in structural analysis and design

This paper examines the role of neural computing strategies in structural analysis and design. A principal focus of the work resides in the use of neural networks to represent the force-displacement relationship in static structural analysis. Such models provide computationally efficient capabilities for reanalysis, and appear to be well suited for application in numerical optimum design. The paper presents an overview of the neutral computing approach, with special emphasis on supervised learning techniques adopted in the present work. Special features of such learning strategies which have a direct bearing on numerically accuracy and efficiency, are examined in the context of representative structural optimization problems.

Hajela, P.↗

Object detection with deep learning for rare event search in the GADGET II TPC

In the pursuit of identifying rare two-particle events within the GADGET II Time Projection Chamber (TPC), this paper presents a comprehensive approach for leveraging Convolutional Neural Networks (CNNs) and various data processing methods. To address the inherent complexities of 3D TPC track reconstructions, the data is expressed in 2D projections and 1D quantities. This approach capitalizes on the diverse data modalities of the TPC, allowing for the efficient representation of the distinct features of the 3D events, with no loss in topology uniqueness. Additionally, it leverages the computational efficiency of 2D CNNs and benefits from the extensive availability of pre-trained models. Given the scarcity of real training data for the rare events of interest, simulated events are used to train the models to detect real events. To account for potential distribution shifts when predominantly depending on simulations, significant perturbations are embedded within the simulations. This produces a broad parameter space that works to account for potential physics parameter and detector response variations and uncertainties. These parameter-varied simulations are used to train sensitive 2D CNN object detectors. When combined with 1D histogram peak detection algorithms, this multi-modal detection framework is highly adept at identifying rare, two-particle events in data taken during experiment 21072 at the Facility for Rare Isotope Beams (FRIB), demonstrating a 100% recall for events of interest. Here, we present the methods and outcomes of our investigation and discuss the potential future applications of these techniques.

Convolutional neural network↗

Comparative study of the convergence rates of two numerical techniques

The paper examines the applicability of the three-step Stetter (1968) method to the problem of hypersonic viscous flow over a blunt axisymmetric body used for planetary entry probes at zero angle of attack. The flow-field results using the two-step finite-difference MacCormack (1969) method are reported by Kumar and Graves (1977). Only the computational efficiency of Stetter's method is compared with that of MacCormack's in terms of the iterative time steps and computing time required for the steady-state solution. Advantages of Stetter's method over MacCormack's are established.

Kumar, A.↗

Computation of wing-vortex interaction in transonic flow using implicit finite difference algorithm

An implicit delta form finite difference algorithm for Euler equations in conservation law form was used in preliminary calculations of three dimensional wing vortex interaction. Both steady and unsteady transonic flow wing vortex interactions are computed. The computations themselves are meant to guide upcoming wind tunnel experiments of the same flow field. Various modifications to the numerical method that are intended to improve computational efficiency are also described and tested in both two and three dimensions. Combination of these methods can reduce the overall computational time by a factor of 4.

Srinivasan, G.↗

Comparison of methods for developing the dynamics of rigid-body systems

Several approaches for developing the equations of motion for a three-degree-of-freedom PUMA robot were compared on the basis of computational efficiency (i.e., the number of additions, subtractions, multiplications, and divisions). Of particular interest was the investigation of the use of computer algebra as a tool for developing the equations of motion. Three approaches were implemented algebraically: Lagrange's method, Kane's method, and Wittenburg's method. Each formulation was developed in absolute and relative coordinates. These six cases were compared to each other and to a recursive numerical formulation. The results showed that all of the formulations implemented algebraically required fewer calculations than the recursive numerical algorithm. The algebraic formulations required fewer calculations in absolute coordinates than in relative coordinates. Each of the algebraic formulations could be simplified, using patterns from Kane's method, to yield the same number of calculations in a given coordinate system.

Ju, M. S.↗

A viscous-inviscid interaction method for 2-D unsteady, compressible flows

A Navier-Stokes/potentia/flow interactive solution method suitable for the solution of steady-state and unsteady flowfields around airfoils has been developed. The Navier-Stokes equations are solved in the close proximity of an airfoil and in its wake. The inviscid flowfield surrounding the viscous flow regions is assumed to be irrotational and isentropic. In the inviscid flow region, the potential flow equations, which are based on distributed sources and vortices, are solved. The two solutions are strongly coupled through the application of their boundary conditions. The strongly coupled Navier-Stokes/potential flow interactive solution method confines computations to a small domain in the proximity of an airfoil. For steady flow solutions, the computational domain may be confined to a region which extends less than one-fifth of a chord length distance away from the airfoil surface. Computed solutions have the same accuracy as the full domain NavierStokes solutions. Yet, as a result of the significantly reduced computational domain and increased convergence rates, the Navier-Stokes/potential flow interactive solution method is about 40 percent more efficient computationally.

Tuncer, Ismail H.↗

Comparison of Coupled Radiative Flow Solutions with Project Fire 2 Flight Data

A nonequilibrium, axisymmetric, Navier-Stokes flow solver with coupled radiation has been developed for use in the design or thermal protection systems for vehicles where radiation effects are important. The present method has been compared with an existing now and radiation solver and with the Project Fire 2 experimental data. Good agreement has been obtained over the entire Fire 2 trajectory with the experimentally determined values of the stagnation radiation intensity in the 0.2-6.2 eV range and with the total stagnation heating. The effects of a number of flow models are examined to determine which combination of physical models produces the best agreement with the experimental data. These models include radiation coupling, multitemperature thermal models, and finite rate chemistry. Finally, the computational efficiency of the present model is evaluated. The radiation properties model developed for this study is shown to offer significant computational savings compared to existing codes.

Olynick, David R.↗

Comparison of Coupled Radiative Navier-Stokes Flow Solutions with the Project Fire II Flight Data

A nonequilibrium, axisymmetric, Navier-Stokes flow solver with coupled radiation has been developed to use in the design of thermal protection systems for vehicles where radiation effects are important. The present method has been compared with an existing flow and radiation solver and with the Project Fire II experimental data. Very good agreement has been obtained over the entire Fire II trajectory with the experimentally determined values of the stagnation radiation intensity in the .2 to 6.2 eV range and with the total stagnation heating. The agreement was significantly better than previous numerical predictions. The effects of a number of flow models are examined to determine which combination of physical models produces the best agreement with the experimental data. These models include radiation coupling, multi-temperature thermal models, finite-rate chemistry, and a quasi-steady-state or Boltzmann assumption for the calculation of the excited electronic states. Finally, the computational efficiency of the present model is evaluated. The radiation properties model developed for this study is shown to offer significant computational savings compared to existing codes.

Olynick, David R.↗

An Exact Dual Adjoint Solution Method for Turbulent Flows on Unstructured Grids

An algorithm for solving the discrete adjoint system based on an unstructured-grid discretization of the Navier-Stokes equations is presented. The method is constructed such that an adjoint solution exactly dual to a direct differentiation approach is recovered at each time step, yielding a convergence rate which is asymptotically equivalent to that of the primal system. The new approach is implemented within a three-dimensional unstructured-grid framework and results are presented for inviscid, laminar, and turbulent flows. Improvements to the baseline solution algorithm, such as line-implicit relaxation and a tight coupling of the turbulence model, are also presented. By storing nearest-neighbor terms in the residual computation, the dual scheme is computationally efficient, while requiring twice the memory of the flow solution. The scheme is expected to have a broad impact on computational problems related to design optimization as well as error estimation and grid adaptation efforts.

Nielsen, Eric J.↗

Dynamic Programming for Structured Continuous Markov Decision Problems

We describe an approach for exploiting structure in Markov Decision Processes with continuous state variables. At each step of the dynamic programming, the state space is dynamically partitioned into regions where the value function is the same throughout the region. We first describe the algorithm for piecewise constant representations. We then extend it to piecewise linear representations, using techniques from POMDPs to represent and reason about linear surfaces efficiently. We show that for complex, structured problems, our approach exploits the natural structure so that optimal solutions can be computed efficiently.

Dearden, Richard↗

Strong Lensing Cosmology with Population-level Calibrated Neural Ratio Estimation

Strong gravitational lensing contains key information about cosmic acceleration. Modern and next-generation galaxy imaging surveys are expected to provide high-quality data on $\mathcal{O}(10^5)$ galaxy-galaxy lensing systems. The plethora and complexity of the data are likely to present computational challenges for parameter inference methods for fitting high-dimensional likelihoods, which are often analytically intractable. Neural Ratio Estimation (NRE) efficiently computes individual likelihood ratios that can be combined into population-level posteriors. We use simulations to study the capacity of NRE to jointly predict the dark energy equation-of-state parameter $w$ and the total matter density $Ω_{m}$ from lensing images and companion spectroscopic information. We also introduce a post hoc posterior coverage calibration procedure that mitigates the model overconfidence that is typically found in neural density estimation applications. Our experiments show that the errors on both parameters decrease with increasing inference population sizes. In particular, for 100 lenses in a standard $Λ$CDM Universe, our calibrated NRE model achieves median fractional uncertainty of $22.8\%$ in $w$ and $2.9\%$ in $Ω_{m}$. This proof of concept demonstrates a potentially scalable approach for efficient cosmological parameter inference with large populations of galaxy-scale lenses observed in future surveys.

Jarugula, Sreevani [Fermilab] (ORCID:0000000253867↗

Implicit approximate-factorization schemes for the efficient solution of steady transonic flow problems

Implicit approximate-factorization algorithms (AF) are developed for the solution of steady-state transonic flow problems. The performance of the AF solution method is evaluated relative to that of the standard solution method for transonic flow problems, successive line over-relaxation (SLOR). Both methods are applied to the solution of the nonlinear, two-dimensional transonic small-disturbance equation. Results indicate that the AF method requires substantially less computer time than SLOR to solve the nonlinear finite-difference matrix equation for a transonic flow field. This increase in computational efficiency is achieved with no appreciable increase in computer storage or coding complexity.

Ballhaus, W. F.↗

Numerical studies of dilute and dense spray characteristics

Several issues involving the improvement of physical submodels and the computational efficiency in modeling dilute and dense spray combustion are discussed. First, the implementations of a dispersion width approach accounting for turbulent dispersion within each computational parcel is discussed. This is essentially a statistical transport model and the testings of this model confirm the capability of accurately representing dispersion in nearly-homogeneous and inhomogeneous turbulent flows with improved efficiency over the delta function stochastic separated flow model. To account for the dense spray effects, an existing drop collision and coalescence model and a Taylor analogy breakup (TAB) model were employed. These models were incorporated into a state-of-the-art multiphase all-speed transient flow solution procedure. Several examples including nonevaporating, evaporating, and burning dense spray cases were studied. The numerical results show reasonably good comparisons with available experimental data in terms of spray penetration, drop sizes, and overall configuration of a spray flame.

Kim, Y. M.↗

Approximate boundary condition procedure for the two-dimensional numerical solution of vortex wakes

Research on efficient computational methods for general vorticity fields has been conducted in connection with a need for basic research on vortex-dominated flows. The present investigation is concerned with the evolution of vortex wakes behind aircraft wings. An efficient procedure is presented for the calculation of the boundary values used in the numerical solution of the unsteady, incompressible, two-dimensional Navier-Stokes equations for an unbounded flow field. The extent of the computational grid can be reduced compared to methods utilizing standard boundary conditions, without loss of accuracy. The efficiencies realized make it feasible to calculate the vortex wake development for realistic wing configurations, including the merging of multiple vortices, for Reynolds numbers of about 10,000 based on wing chord.

Weston, R. P.↗

Enhanced accuracy through ensembling of randomly initialized auto-regressive models for dynamical systems

Computational mechanics simulations using traditional finite element methods (FEM) require prohibitively expensive computational resources for real-time engineering applications, design optimization, and digital twin implementations. While machine learning (ML) surrogate models offer significant computational speedups, autoregressive ML models for time-dependent mechanical systems suffer from error accumulation that compromises long-term prediction reliability - a critical concern for engineering applications where accuracy over extended time horizons is essential for safety and performance assessments. Here, we propose a deep ensemble framework specifically designed to address this challenge in computational mechanics applications, where multiple ML surrogate models with random weight initializations are trained in parallel and their predictions aggregated during inference. This approach leverages statistical diversity to maximize information gain from a fixed set of training data and to mitigate error propagation, while maintaining the computational efficiency that makes ML surrogates attractive for engineering practice. We validate the framework on three representative problems spanning critical areas of computational mechanics: stress field evolution in heterogeneous microstructures under complex loading (relevant to advanced materials design and composite analysis), planetary-scale shallow water dynamics (applicable to environmental and geotechnical engineering), and Gray-Scott reaction-diffusion systems (relevant to mass transport and chemical process engineering). Across all test cases, the ensemble approach demonstrates consistent error reduction of 15-33% compared to individual models. The codes for this work are available on GitHub (https://github.com/Graham-Brady-Research-Group/AutoregressiveEnsemble_SpatioTemporal_Evolution).

autoregressive prediction↗