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 811 records · Page 45
All sourcesNASA NTRSDOE OSTI
NASA NTRS2001

A Shell/3D Modeling Technique for the Analyses of Delaminated Composite Laminates

A shell/3D modeling technique was developed for which a local three-dimensional solid finite element model is used only in the immediate vicinity of the delamination front. The goal was to combine the accuracy of the full three-dimensional solution with the computational efficiency of a plate or shell finite element model. Multi-point constraints provided a kinematically compatible interface between the local three-dimensional model and the global structural model which has been meshed with plate or shell finite elements. Double Cantilever Beam (DCB), End Notched Flexure (ENF), and Single Leg Bending (SLB) specimens were modeled using the shell/3D technique to study the feasibility for pure mode I (DCB), mode II (ENF) and mixed mode I/II (SLB) cases. Mixed mode strain energy release rate distributions were computed across the width of the specimens using the virtual crack closure technique. Specimens with a unidirectional layup and with a multidirectional layup where the delamination is located between two non-zero degree plies were simulated. For a local three-dimensional model, extending to a minimum of about three specimen thicknesses on either side of the delamination front, the results were in good agreement with mixed mode strain energy release rates obtained from computations where the entire specimen had been modeled with solid elements. For large built-up composite structures modeled with plate elements, the shell/3D modeling technique offers a great potential for reducing the model size, since only a relatively small section in the vicinity of the delamination front needs to be modeled with solid elements.

Krueger, Ronald↗
NASA NTRS1997

BFS Method for Alloys Optimized and Verified for the Study of Ordered Intermetallic Material

The aerospace industry has a need for new metallic alloys that are lightweight and have high strength at elevated temperatures. The BFS (Bozzolo, Ferrante, and Smith) method is a new, computationally efficient and physically sound quantum semi-perturbative approach for describing metals and their defects. Based on a simple interpretation of the alloy formation process that identifies strain and chemical contributions to the energy of the alloy, the method provides an atom-by-atom description of an alloy. Its implementation requires little more than algebra and the solution of transcendental equations. At the NASA Lewis Research Center, we have demonstrated that BFS can investigate the properties of a large number of alloys with a minimum computational effort on low-level computers. This screening allows the selection of the best alloy candidates for a particular application and, therefore, promises large cost savings over current approaches.

Source record↗
NASA NTRS2011

Contact Graph Routing

Contact Graph Routing (CGR) is a dynamic routing system that computes routes through a time-varying topology of scheduled communication contacts in a network based on the DTN (Delay-Tolerant Networking) architecture. It is designed to enable dynamic selection of data transmission routes in a space network based on DTN. This dynamic responsiveness in route computation should be significantly more effective and less expensive than static routing, increasing total data return while at the same time reducing mission operations cost and risk. The basic strategy of CGR is to take advantage of the fact that, since flight mission communication operations are planned in detail, the communication routes between any pair of bundle agents in a population of nodes that have all been informed of one another's plans can be inferred from those plans rather than discovered via dialogue (which is impractical over long one-way-light-time space links). Messages that convey this planning information are used to construct contact graphs (time-varying models of network connectivity) from which CGR automatically computes efficient routes for bundles. Automatic route selection increases the flexibility and resilience of the space network, simplifying cross-support and reducing mission management costs. Note that there are no routing tables in Contact Graph Routing. The best route for a bundle destined for a given node may routinely be different from the best route for a different bundle destined for the same node, depending on bundle priority, bundle expiration time, and changes in the current lengths of transmission queues for neighboring nodes; routes must be computed individually for each bundle, from the Bundle Protocol agent's current network connectivity model for the bundle s destination node (the contact graph). Clearly this places a premium on optimizing the implementation of the route computation algorithm. The scalability of CGR to very large networks remains a research topic. The information carried by CGR contact plan messages is useful not only for dynamic route computation, but also for the implementation of rate control, congestion forecasting, transmission episode initiation and termination, timeout interval computation, and retransmission timer suspension and resumption.

Burleigh, Scott C.↗
DOE OSTI2026

Computing the Critical Temperature of the Affine-Transformed $D=3$ Ising Model Using Masked Autoregressive Flow

The simple Ising model provides a rich environment to build and study lattice field theories. As part of an ongoing project to construct a conformal field theory (CFT) on an arbitrarily curved manifold, in this work we develop methods to measure the critical temperature $β_c$ of the affine-transformed Ising model on the face-centered cubic (FCC) lattice. The main challenge in this endeavor is finding a computationally efficient and accurate method of interpolating and extrapolating Monte Carlo observables with respect to coupling coefficients and temperature. Herein, we compare two such methods. A traditional statistical approach uses the multiple histogram (MH) method, while a newer machine learning approach uses a masked autoregressive flow (MAF) to estimate the underlying probability density function of a set of observables. While the MH method is specifically designed to interpolate and extrapolate Monte Carlo observables, we find that MAF is a viable alternative for measuring $β_c$ with a computational cost that scales more favorably. Furthermore, we comment on additional advantages of MAF relevant to our work, such as extrapolating in system volume.

Svenson, Kai [Texas U.]↗
DOE OSTI2026

Accelerating LHC event generation with simplified pilot runs and fast PDFs

High-precision calculations are an indispensable ingredient for the success of the LHC physics programme, yet their poor computing efficiency has been a growing cause for concern, threatening to become a paralysing bottleneck in the coming years. We present solutions to eliminate the apprehension by focussing on two major components of generalpurpose Monte Carlo event generators: the evaluation of parton distribution functions, and the generation of perturbative matrix elements. We show that for the cost-driving event samples employed by the ATLAS experiment to model omnipresent, irreducible Standard Model backgrounds, such as weak boson or top-quark pair production in association with jets, these computational components dominate the overall run time by up to 80 %. We demonstrate that a reduction of the computing footprint of LHAPDF and SHERPA by factors of around 40 can be achieved for multi-leg NLO event generation.

Bothmann, Enrico [Gottingen U.]↗
NASA NTRS1993

Structural design utilizing updated, approximate sensitivity derivatives

A method to improve the computational efficiency of structural optimization algorithms is investigated. In this method, the calculations of 'exact' sensitivity derivatives of constraint functions are performed only at selected iterations during the optimization process. The sensitivity derivatives utilized within other iterations are approximate derivatives which are calculated using an inexpensive derivative update formula. Optimization results are presented for an analytic optimization problem (i.e., one having simple polynomial expressions for the objective and constraint functions) and for two structural optimization problems. The structural optimization results indicate that up to a factor of three improvement in computation time is possible when using the updated sensitivity derivatives.

Scotti, Stephen J.↗
DOE OSTI2024

Neuromorphic intermediate representation: A unified instruction set for interoperable brain-inspired computing

Abstract Spiking neural networks and neuromorphic hardware platforms that simulate neuronal dynamics are getting wide attention and are being applied to many relevant problems using Machine Learning. Despite a well-established mathematical foundation for neural dynamics, there exists numerous software and hardware solutions and stacks whose variability makes it difficult to reproduce findings. Here, we establish a common reference frame for computations in digital neuromorphic systems, titled Neuromorphic Intermediate Representation (NIR). NIR defines a set of computational and composable model primitives as hybrid systems combining continuous-time dynamics and discrete events. By abstracting away assumptions around discretization and hardware constraints, NIR faithfully captures the computational model, while bridging differences between the evaluated implementation and the underlying mathematical formalism. NIR supports an unprecedented number of neuromorphic systems, which we demonstrate by reproducing three spiking neural network models of different complexity across 7 neuromorphic simulators and 4 digital hardware platforms. NIR decouples the development of neuromorphic hardware and software, enabling interoperability between platforms and improving accessibility to multiple neuromorphic technologies. We believe that NIR is a key next step in brain-inspired hardware-software co-evolution, enabling research towards the implementation of energy efficient computational principles of nervous systems. NIR is available atneuroir.org

Science & Technology - Other Topics↗
DOE OSTI2024

LHC EFT WG note: SMEFT predictions, event reweighting, and simulation

This note provides a comprehensive overview of tools for predicting observables in the Standard Model effective field theory (SMEFT) at both tree level and one loop using event generators. We evaluate three primary methodologies–event reweighting, separate simulation of squared matrix elements, and full SMEFT process simulation–focusing on their statistical performance, computational efficiency, and potential biases. Each approach is assessed in terms of its accuracy, highlighting trade-offs between precision and resource demands. Practical insights into their applicability for high-energy physics analyses are offered, with particular attention to processes where SMEFT effects are significant. Additionally, we discuss the role of helicity in reweighting strategies and its impact on the quality of predictions. By comparing the methods across various LHC processes, this note provides guidance for selecting the most effective strategy for various SMEFT studies, ensuring robust predictions while optimizing computational resources.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS2004

Adaptive DIT-Based Fringe Tracking and Prediction at IOTA

An automatic fringe tracking system has been developed and implemented at the Infrared Optical Telescope Array (IOTA). In testing during May 2002, the system successfully minimized the optical path differences (OPDs) for all three baselines at IOTA. Based on sliding window discrete Fourier transform (DFT) calculations that were optimized for computational efficiency and robustness to atmospheric disturbances, the algorithm has also been tested extensively on off-line data. Implemented in ANSI C on the 266 MHZ PowerPC processor running the VxWorks real-time operating system, the algorithm runs in approximately 2.0 milliseconds per scan (including all three interferograms), using the science camera and piezo scanners to measure and correct the OPDs. Preliminary analysis on an extension of this algorithm indicates a potential for predictive tracking, although at present, real-time implementation of this extension would require significantly more computational capacity.

Wilson, Edward↗
NASA NTRS1990

Flow field analysis for a class of waverider configurations

A package of computer codes for analysis of flow fields for waverider configurations is described. The package consists of a surface/volume grid generator and a finite-volume flow solver. The grid generator defines body geometries and computational grids by an algebraic homotopy procedure. The algebraic procedure is versatile in its application and can readily generate configurations in the class of blended wing-body geometries. This code has the ability to produce a wide variety of geometries in the given class with varying geometrical attributes. The flow solver employs a finite-volume formation and solves the explicit, Runge-Kutta integration technique. The method or flow simulation incorporates several techniques for acceleration of the convergence of the interaction process and an entropy corrected enthalpy damping procedure for efficient computation of high Mach number flows.

Moitra, Anutosh↗
NASA NTRS1991

A fast implicit upwind solution algorithm for three-dimensional unstructured dynamic meshes

A fast implicit upwind algorithm for the solution of the time-dependent Euler equations is presented for aerodynamic analysis involving unstructured dynamic meshes. The spatial discretization of the scheme is based on the upwind approach of Roe, referred to as flux-difference splitting (FDS). The FDS approach is naturally dissipative and captures shock waves and contact discontinuities sharply. The temporal discretization of the scheme involves an implicit time-integration using a two-sweep Gauss-Seidel relaxation procedure. The procedure is computationally efficient for either steady or unsteady flow problems. A detailed description is given of the implicit upwind solution algorithm along with results which assess the capability. The results are presented for the NACA 0012 airfoil and for the Boeing 747 aircraft. The 747 geometry includes the fuselage, wing, horizontal and vertical tails, under-wing pylons, and flow-through engine nacelles. Euler solutions for the 747 aircraft on an unstructured tetrahedral mesh containing approximately 100,000 cells were obtained to engineering accuracy in less than one hour CPU time on a Cray-2 computer.

Batina, John T.↗
NASA NTRS1992

A fast implicit upwind solution algorithm for three-dimensional unstructured dynamic meshes

A fast implicit upwind algorithm for the solution of the time-dependent Euler equations is presented for aerodynamic analysis involving unstructured dynamic meshes. The spatial discretization of the scheme is based on the upwind approach of Roe, referred to as flux-difference splitting (FDS). The FDS approach is naturally dissipative and captures shock waves and contact discontinuities sharply. The temporal discretization of the scheme involves an implicit time-integration using a two-sweep Gauss-Seidel relaxation procedure. The procedure is computationally efficient for either steady or unsteady flow problems. A detailed description is given of the implicit upwind solution algorithm along with results which assess the capability. The results are presented for the NACA 0012 airfoil and for the Boeing 747 aircraft. The 747 geometry includes the fuselage, wing, horizontal and vertical tails, under-wing pylons, and flow-through engine nacelles. Euler solutions for the 747 aircraft on an unstructured tetrahedral mesh containing approximately 100,000 cells were obtained to engineering accuracy in less than one hour CPU time on a Cray-2 computer.

Batina, John T.↗
NASA NTRS2010

Alternative Modal Basis Selection Procedures for Nonlinear Random Response Simulation

Three procedures to guide selection of an efficient modal basis in a nonlinear random response analysis are examined. One method is based only on proper orthogonal decomposition, while the other two additionally involve smooth orthogonal decomposition. Acoustic random response problems are employed to assess the performance of the three modal basis selection approaches. A thermally post-buckled beam exhibiting snap-through behavior, a shallowly curved arch in the auto-parametric response regime and a plate structure are used as numerical test articles. The results of the three reduced-order analyses are compared with the results of the computationally taxing simulation in the physical degrees of freedom. For the cases considered, all three methods are shown to produce modal bases resulting in accurate and computationally efficient reduced-order nonlinear simulations.

Przekop, Adam↗
DOE OSTI2024

Hutchinson Trace Estimation for high-dimensional and high-order Physics-Informed Neural Networks

Physics-Informed Neural Networks (PINNs) have proven effective in solving partial differential equations (PDEs), especially when some data are available by seamlessly blending data and physics. However, extending PINNs to high-dimensional and even high-order PDEs encounters significant challenges due to the computational cost associated with automatic differentiation in the residual loss function calculation. Herein, we address the limitations of PINNs in handling high-dimensional and high-order PDEs by introducing the Hutchinson Trace Estimation (HTE) method. Starting with the second-order high-dimensional PDEs, which are ubiquitous in scientific computing, HTE is applied to transform the calculation of the entire Hessian matrix into a Hessian vector product (HVP). This approach not only alleviates the computational bottleneck via Taylor-mode automatic differentiation but also significantly reduces memory consumption from the Hessian matrix to an HVP’s scalar output. We further showcase HTE’s convergence to the original PINN loss and its unbiased behavior under specific conditions. Comparisons with the Stochastic Dimension Gradient Descent (SDGD) highlight the distinct advantages of HTE, particularly in scenarios with significant variability and variance among dimensions. We further extend the application of HTE to higher-order and higher-dimensional PDEs, specifically addressing the biharmonic equation. By employing tensor-vector products (TVP), HTE efficiently computes the colossal tensor associated with the fourth-order high-dimensional biharmonic equation, saving memory and enabling rapid computation. The effectiveness of HTE is illustrated through experimental setups, demonstrating comparable convergence rates with SDGD under memory and speed constraints. Additionally, HTE proves valuable in accelerating the Gradient-Enhanced PINN (gPINN) version as well as the Biharmonic equation. Overall, HTE opens up a new capability in scientific machine learning for tackling high-order and high-dimensional PDEs.

Curse of dimensionality↗
NASA NTRS1991

Algorithm and code development for unsteady three-dimensional Navier-Stokes equations

A streamwise upwind algorithm for solving the unsteady 3-D Navier-Stokes equations was extended to handle the moving grid system. It is noted that the finite volume concept is essential to extend the algorithm. The resulting algorithm is conservative for any motion of the coordinate system. Two extensions to an implicit method were considered and the implicit extension that makes the algorithm computationally efficient is implemented into Ames's aeroelasticity code, ENSAERO. The new flow solver has been validated through the solution of test problems. Test cases include three-dimensional problems with fixed and moving grids. The first test case shown is an unsteady viscous flow over an F-5 wing, while the second test considers the motion of the leading edge vortex as well as the motion of the shock wave for a clipped delta wing. The resulting algorithm has been implemented into ENSAERO. The upwind version leads to higher accuracy in both steady and unsteady computations than the previously used central-difference method does, while the increase in the computational time is small.

Obayashi, Shigeru↗
DOE OSTI2025

Efficient sampling of free energy landscapes with functions in Sobolev spaces

Molecular simulations of biological and physical phenomena generally involve sampling complicated, rough energy landscapes characterized by multiple local minima. In this work, we introduce a new family of methods for advanced sampling that draw inspiration from functional representations used in machine learning and approximation theory. As shown here, such representations are particularly well suited for learning free energies using artificial neural networks. As a system evolves through phase space, the proposed methods gradually build a model for the free energy as a function of one or more collective variables, from both the frequency of visits to distinct states and generalized force estimates corresponding to such states. Implementation of the methods is relatively simple and, more importantly, for the representative examples considered in this work, they provide computational efficiency gains of up to several orders of magnitude over other widely used simulation techniques.

Approximation theory↗
NASA NTRS1985

Theoretical and software considerations for general dynamic analysis using multilevel substructured models

The dynamic analysis of complex structural systems using the finite element method and multilevel substructured models is presented. The fixed-interface method is selected for substructure reduction because of its efficiency, accuracy, and adaptability to restart and reanalysis. This method is extended to reduction of substructures which are themselves composed of reduced substructures. The implementation and performance of the method in a general purpose software system is emphasized. Solution algorithms consistent with the chosen data structures are presented. It is demonstrated that successful finite element software requires the use of software executives to supplement the algorithmic language. The complexity of the implementation of restart and reanalysis porcedures illustrates the need for executive systems to support the noncomputational aspects of the software. It is shown that significant computational efficiencies can be achieved through proper use of substructuring and reduction technbiques without sacrificing solution accuracy. The restart and reanalysis capabilities and the flexible procedures for multilevel substructured modeling gives economical yet accurate analyses of complex structural systems.

Schmidt, R. J.↗
DOE OSTI2025

Evaluating the Impact of Tritium Permeation Membrane Performance and Direct Internal Recycling on Fusion Fuel Cycle Efficiency Using TMAP8

An efficient fuel cycle is vital to sustainable and cost-effective energy generation in fusion systems. Since tritium is not widely available, fusion systems must breed their own tritium for sustainable fusion deuterium-tritium reactions. An inefficient fuel cycle increases the tritium inventory needed for operations, which increases costs, constraints on tritium management systems, and safety concerns. A fuel cycle model is a powerful tool for understanding tritium inventories and flow rates across all systems in the fuel cycle. By simplifying the technical details into time-dependent tritium flow rates and inventories, the model can simulate the entire fuel cycle with high computational efficiency, even for technologies that are still under development. It can therefore quantify the impact of new tritium management technologies on fuel cycle efficiency. To evaluate the impact of key components on reducing tritium inventory, we are using and expanding an existing fuel cycle models based on latest advancements in fuel cycle research. The new model integrates Tritium Permeation Membrane (TPM) and Direct Internal Recycling (DIR) to enhance tritium transport from blanket breeders and plasma exhaust. These fuel cycle models are implemented in TMAP8 (Tritium Migration Analysis Program, version 8), a MOOSE-based open-source application designed to provide cutting-edge capabilities for tritium transport and fuel cycle modeling. The study aims to demonstrate the extensibility of existing fuel cycle modeling capability in TMAP8 and to offer a proof-of-principle design for future fusion plant systems. The presentation will cover the performance of fuel cycle modeling capabilities available in TMAP8, highlight advancements in fuel cycle research, and present a sensitivity analysis of these models. The results underline potential approaches and technology solutions to lower tritium inventory requirements, highlighting their role in shaping the future of fusion energy.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗