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 685 records · Page 38

Efficient Construction of Discrete Adjoint Operators on Unstructured Grids by Using Complex Variables

A methodology is developed and implemented to mitigate the lengthy software development cycle typically associated with constructing a discrete adjoint solver for aerodynamic simulations. The approach is based on a complex-variable formulation that enables straightforward differentiation of complicated real-valued functions. An automated scripting process is used to create the complex-variable form of the set of discrete equations. An efficient method for assembling the residual and cost function linearizations is developed. The accuracy of the implementation is verified through comparisons with a discrete direct method as well as a previously developed handcoded discrete adjoint approach. Comparisons are also shown for a large-scale configuration to establish the computational efficiency of the present scheme. To ultimately demonstrate the power of the approach, the implementation is extended to high temperature gas flows in chemical nonequilibrium. Finally, several fruitful research and development avenues enabled by the current work are suggested.

Nielsen, Eric J.↗

A High-Performance Computing GNSS-aware Path Planning Algorithm for Safe Urban Flight Operations

The emergence and development of advanced technologies and vehicle types have created a growing demand for new forms of flight operations. These new and increasingly complex operational paradigms, such as Advanced and Urban Air Mobility (AAM/UAM), present regulatory authorities and the aviation community with several design-and-implementation challenges – particularly for highly autonomous vehicles. An overarching and daunting task is to develop protocols that can integrate these operations without compromising safety or disrupting traditional airspace operations. A shift toward a more predictive, autonomous, risk mitigation capability becomes critical to meet this challenge. This paper proposes and evaluates a computationally-efficient path planning approach to perform pre-flight planning and autonomous in-flight re-routing to minimize exposures to selected hazards. In our evaluation, hazards associated with degraded and missing critical GPS navigation data are considered. In this paper, we first present a high-performance computing path planning approach based on an adapted Bellman-Ford algorithm, developed in the CUDA programming language. Using the adapted path planning algorithm, we test this algorithm when encountering issues with GPS quality, and deliver an implementation that can produce flight paths that minimize exposure to risks, while maintaining a low computational burden. In our evaluation, the computation of periodic and aperiodic path updates are evaluated, prioritizing specific events as triggers for updates, based on changes to satellite availability. These critical events can lead to significant exposure to navigational hazards if not dealt with correctly.

GNSS↗

A High-Performance Computing GNSS-aware Path Planning Algorithm for Safe Urban Flight Operations

The emergence and development of advanced technologies and vehicle types have created a growing demand for new forms of flight operations. These new and increasingly complex operational paradigms, such as Advanced and Urban Air Mobility (AAM/UAM), present regulatory authorities and the aviation community with several design-and-implementation challenges – particularly for highly autonomous vehicles. An overarching and daunting task is to develop protocols that can integrate these operations without compromising safety or disrupting traditional airspace operations. A shift toward a more predictive, autonomous, risk mitigation capability becomes critical to meet this challenge. This paper proposes and evaluates a computationally-efficient path planning approach to perform pre-flight planning and autonomous in-flight re-routing to minimize exposures to selected hazards. In our evaluation, hazards associated with degraded and missing critical GPS navigation data are considered. In this paper, we first present a high-performance computing path planning approach based on an adapted Bellman-Ford algorithm, developed in the CUDA programming language. Using the adapted path planning algorithm, we test this algorithm when encountering issues with GPS quality, and deliver an implementation that can produce flight paths that minimize exposure to risks, while maintaining a low computational burden. In our evaluation, the computation of periodic and aperiodic path updates are evaluated, prioritizing specific events as triggers for updates, based on changes to satellite availability. These critical events can lead to significant exposure to navigational hazards if not dealt with correctly.

GNSS↗

A splice method for local-to–nonlocal coupling of weak forms

Here, we propose a method to couple local and nonlocal diffusion models. By inheriting desirable properties such as patch tests, asymptotic compatibility and unintrusiveness from related splice and optimization-based coupling schemes, it enables the use of weak (or variational) formulations, is computationally efficient and straightforward to implement. We prove well-posedness of the coupling scheme and demonstrate its properties and effectiveness in a variety of numerical examples.

97 MATHEMATICS AND COMPUTING↗

Spectral methods for modeling supersonic chemically reacting flow fields

A partial implicit numerical algorithm has been developed for solving the equations describing chemically reacting supersonic flows. The algorithm employs a two-stage Runge-Kutta method for integrating the equations in time and a Chebyshev spectral method for integrating the equations in space. The accuracy and efficiency of the new technique have been assessed by comparison with an existing implicit finite-difference procedure for modeling chemically reacting flows. The comparison showed that the new procedure yielded equivalent accuracy on much coarser grids as compared to the finite-difference procedure with resultant significant gains in computational efficiency.

Drummond, J. P.↗

Validation of an Accurate Three-Dimensional Helical Slow-Wave Circuit Model

The helical slow-wave circuit embodies a helical coil of rectangular tape supported in a metal barrel by dielectric support rods. Although the helix slow-wave circuit remains the mainstay of the traveling-wave tube (TWT) industry because of its exceptionally wide bandwidth, a full helical circuit, without significant dimensional approximations, has not been successfully modeled until now. Numerous attempts have been made to analyze the helical slow-wave circuit so that the performance could be accurately predicted without actually building it, but because of its complex geometry, many geometrical approximations became necessary rendering the previous models inaccurate. In the course of this research it has been demonstrated that using the simulation code, MAFIA, the helical structure can be modeled with actual tape width and thickness, dielectric support rod geometry and materials. To demonstrate the accuracy of the MAFIA model, the cold-test parameters including dispersion, on-axis interaction impedance and attenuation have been calculated for several helical TWT slow-wave circuits with a variety of support rod geometries including rectangular and T-shaped rods, as well as various support rod materials including isotropic, anisotropic and partially metal coated dielectrics. Compared with experimentally measured results, the agreement is excellent. With the accuracy of the MAFIA helical model validated, the code was used to investigate several conventional geometric approximations in an attempt to obtain the most computationally efficient model. Several simplifications were made to a standard model including replacing the helical tape with filaments, and replacing rectangular support rods with shapes conforming to the cylindrical coordinate system with effective permittivity. The approximate models are compared with the standard model in terms of cold-test characteristics and computational time. The model was also used to determine the sensitivity of various circuit parameters including typical manufacturing dimensional tolerances and support rod permittivity. By varying the circuit parameters of an accurate model using MAFIA, these sensitivities can be computed for manufacturing concerns, and design optimization previous to fabrication, thus eliminating the need for costly experimental iterations. Several variations were made to a standard helical circuit using MAFIA to investigate the effect that variations on helical tape and support rod width, metallized loading height and support rod permittivity, have on TWT cold-test characteristics.

Kory, Carol L.↗

Phonon screening and dissociation of excitons at finite temperatures from first principles

The properties of excitons, or correlated electron–hole pairs, are of paramount importance to optoelectronic applications of materials. A central component of exciton physics is the electron–hole interaction, which is commonly treated as screened solely by electrons within a material. However, nuclear motion can screen this Coulomb interaction as well, with several recent studies developing model approaches for approximating the phonon screening of excitonic properties. While these model approaches tend to improve agreement with experiment, they rely on several approximations that restrict their applicability to a wide range of materials, and thus far they have neglected the effect of finite temperatures. Here, we develop a fully first-principles, parameter-free approach to compute the temperature-dependent effects of phonon screening within the ab initio GW -Bethe–Salpeter equation framework. We recover previously proposed models of phonon screening as well-defined limits of our general framework, and discuss their validity by comparing them against our first-principles results. We develop an efficient computational workflow and apply it to a diverse set of semiconductors, specifically AlN, CdS, GaN, MgO, and SrTiO 3 . We demonstrate under different physical scenarios how excitons may be screened by multiple polar optical or acoustic phonons, how their binding energies can exhibit strong temperature dependence, and the ultrafast timescales on which they dissociate into free electron–hole pairs.

Science & Technology - Other Topics↗

A comparison of the Method of Lines to finite difference techniques in solving time-dependent partial differential equations

Steady state solutions to two time dependent partial differential systems have been obtained by the Method of Lines (MOL) and compared to those obtained by efficient standard finite difference methods: (1) Burger's equation over a finite space domain by a forward time central space explicit method, and (2) the stream function - vorticity form of viscous incompressible fluid flow in a square cavity by an alternating direction implicit (ADI) method. The standard techniques were far more computationally efficient when applicable. In the second example, converged solutions at very high Reynolds numbers were obtained by MOL, whereas solution by ADI was either unattainable or impractical. With regard to 'set up' time, solution by MOL is an attractive alternative to techniques with complicated algorithms, as much of the programming difficulty is eliminated.

Kurtz, L. A.↗

A shared position/force control methodology for teleoperation

A flexible and computationally efficient shared position/force control concept and its implementation in the Robot Control C Library (RCCL) are presented form the point of teleoperation. This methodology enables certain degrees of freedom to be position-controlled through real time manual inputs and the remaining degrees of freedom to be force-controlled by computer. Functionally, it is a hybrid control scheme in that certain degrees of freedom are designated to be under position control, and the remaining degrees of freedom to be under force control. However, the methodology is also a shared control scheme because some degrees of freedom can be put under manual control and the other degrees of freedom put under computer control. Unlike other hybrid control schemes, which process position and force commands independently, this scheme provides a force control loop built on top of a position control inner loop. This feature minimizes the computational burden and increases disturbance rejection. A simple implementation is achieved partly because the joint control servos that are part of most robots can be used to provide the position control inner loop. Along with this control scheme, several menus were implemented for the convenience of the user. The implemented control scheme was successfully demonstrated for the tasks of hinged-panel opening and peg-in-hole insertion.

Lee, Jin S.↗

Convergence Acceleration of Runge-Kutta Schemes for Solving the Navier-Stokes Equations

The convergence of a Runge-Kutta (RK) scheme with multigrid is accelerated by preconditioning with a fully implicit operator. With the extended stability of the Runge-Kutta scheme, CFL numbers as high as 1000 can be used. The implicit preconditioner addresses the stiffness in the discrete equations associated with stretched meshes. This RK/implicit scheme is used as a smoother for multigrid. Fourier analysis is applied to determine damping properties. Numerical dissipation operators based on the Roe scheme, a matrix dissipation, and the CUSP scheme are considered in evaluating the RK/implicit scheme. In addition, the effect of the number of RK stages is examined. Both the numerical and computational efficiency of the scheme with the different dissipation operators are discussed. The RK/implicit scheme is used to solve the two-dimensional (2-D) and three-dimensional (3-D) compressible, Reynolds-averaged Navier-Stokes equations. Turbulent flows over an airfoil and wing at subsonic and transonic conditions are computed. The effects of the cell aspect ratio on convergence are investigated for Reynolds numbers between 5:7 x 10(exp 6) and 100 x 10(exp 6). It is demonstrated that the implicit preconditioner can reduce the computational time of a well-tuned standard RK scheme by a factor between four and ten.

Swanson, Roy C., Jr.↗

Efficient mapping between void shapes and stress fields using Deep Convolutional Neural Networks with sparse data

Establishing fast and accurate structure-to-property relationships is an important component in the design and discovery of advanced materials. Physics-based simulation models like the finite element method (FEM) are often used to predict deformation, stress, and strain fields as a function of material microstructure in material and structural systems. Such models may be computationally expensive and time intensive if the underlying physics of the system is complex. This limits their application to solve inverse design problems and identify structures that maximize performance. In such scenarios, surrogate models are employed to make the forward mapping computationally efficient to evaluate. However, the high dimensionality of the input microstructure and the output field of interest often renders such surrogate models inefficient, especially when dealing with sparse data. Deep convolutional neural network (CNN) based surrogate models have shown great promise in handling such high-dimensional problems. In this paper, a single ellipsoidal void structure under a uniaxial tensile load represented by a linear elastic, high-dimensional and expensive-to-query, FEM model. We consider two deep CNN architectures, a modified convolutional autoencoder framework with a fully connected bottleneck and a UNet CNN, and compare their accuracy in predicting the von Mises stress field for any given input void shape in the FEM model. Additionally, a sensitivity analysis study is performed using the two approaches, where the variation in the prediction accuracy on unseen test data is studied through numerical experiments by varying the number of training samples from 20 to 100.

surrogate modeling; convolutional neural networks;↗

Convergence Acceleration for Multistage Time-Stepping Schemes

The convergence of a Runge-Kutta (RK) scheme with multigrid is accelerated by preconditioning with a fully implicit operator. With the extended stability of the Runge-Kutta scheme, CFL numbers as high as 1000 could be used. The implicit preconditioner addresses the stiffness in the discrete equations associated with stretched meshes. Numerical dissipation operators (based on the Roe scheme, a matrix formulation, and the CUSP scheme) as well as the number of RK stages are considered in evaluating the RK/implicit scheme. Both the numerical and computational efficiency of the scheme with the different dissipation operators are discussed. The RK/implicit scheme is used to solve the two-dimensional (2-D) and three-dimensional (3-D) compressible, Reynolds-averaged Navier-Stokes equations. In two dimensions, turbulent flows over an airfoil at subsonic and transonic conditions are computed. The effects of mesh cell aspect ratio on convergence are investigated for Reynolds numbers between 5.7 x 10(exp 6) and 100.0 x 10(exp 6). Results are also obtained for a transonic wing flow. For both 2-D and 3-D problems, the computational time of a well-tuned standard RK scheme is reduced at least a factor of four.

Swanson, R. C.↗

NASA's Integrated Instrument Simulator Suite for Atmospheric Remote Sensing from Spaceborne Platforms (ISSARS) and Its Role for the ACE and GPM Missions

Forward simulation is an indispensable tool for evaluation of precipitation retrieval algorithms as well as for studying snow/ice microphysics and their radiative properties. The main challenge of the implementation arises due to the size of the problem domain. To overcome this hurdle, assumptions need to be made to simplify compiles cloud microphysics. It is important that these assumptions are applied consistently throughout the simulation process. ISSARS addresses this issue by providing a computationally efficient and modular framework that can integrate currently existing models and is also capable of expanding for future development. ISSARS is designed to accommodate the simulation needs of the Aerosol/Clouds/Ecosystems (ACE) mission and the Global Precipitation Measurement (GPM) mission: radars, microwave radiometers, and optical instruments such as lidars and polarimeter. ISSARS's computation is performed in three stages: input reconditioning (IRM), electromagnetic properties (scattering/emission/absorption) calculation (SEAM), and instrument simulation (ISM). The computation is implemented as a web service while its configuration can be accessed through a web-based interface.

real-aperture instruments↗

Transferable dispersion-aware machine learning interatomic potentials for multilayer transition metal dichalcogenide heterostructures

Stacking atomically thin transition metal dichalcogenides (TMDs) into heterostructures enables exploration of exotic quantum phases, particularly through twist-angle-controlled moiré superlattices. These structures exhibit novel electronic and optical behaviors driven by atomic-scale structural reconstruction. However, studying such systems with DFT is computationally demanding due to their large unit cells and van der Waals (vdW) interactions between layers. To address this, we develop a transferable neural network potential (NNP) that includes long-range vdW corrections up to 12Å with minimal overhead. Trained on vdW-corrected DFT data for Mo- and W-based TMDs with S, Se, and Te, the NNP accurately models monolayers, bilayers, heterostructures, and their interaction with h-BN substrates. It reproduces equilibrium structures, energy landscapes, phonon dispersions, and matches experimental atomic reconstructions in twisted WS2 and MoS2/WSe2 systems. We demonstrate that our NNP achieves DFT-level accuracy and high computational efficiency, enabling large-scale simulations of TMD-based moiré superlattices both with and without substrates.

materials for energy and catalysis↗

FOILPOLARS (Grassmannian Foil Shape Sweeps for Polar Generation) [SWR-26-095]

FOILPOLARS (Grassmannian Foil Shape Sweeps for Polar Generation): Multifidelity aerodynamic polar data generation for hydrofoil/tidal-turbine airfoil sections. Foilpolars ties together three pieces: *AeroSandbox supplies the baseline airfoil coordinates (UIUC database). *G2Aero parameterizes those shapes on a Grassmannian manifold (Karcher mean + PGA basis) and samples new perturbed shapes around that basis. *XFoil (panel method) and NeuralFoil (neural-network surrogate, shipped with AeroSandbox) each solve the resulting shapes for lift, drag, moment, and pressure at the swept angles of attack, Reynolds numbers, and n_crit values. Design optimization of foil shapes in a computationally efficient way requires polars data across many candidate shapes, not just a handful of baseline foils. However, high-fidelity CFD at that scale is too costly, and naive shape perturbation strays from realistic geometries. FOILPOLARS addresses this by loading baseline airfoils (via AeroSandbox) and mapping them onto a Grassmannian manifold (via G2Aero), computing a Karcher mean and principal geodesic analysis (PGA) basis. New shapes are sampled by perturbing PGA coefficients, keeping them close to the manifold of realistic foils. Each sampled shape is evaluated across a configurable sweep of angle of attack, Reynolds number, and critical amplification factor using two solvers: XFoil (panel method) and NeuralFoil (neural-network surrogate), producing a paired dataset of lift, drag, moment, pressure, convergence, and confidence, indexed alongside each shape's PGA coefficients and shared Grassmannian basis in a single xarray dataset. From this, FOILPOLARS produces convergence summaries and comparison plots per shape, Reynolds number, and n_crit. A command-line interface exposes each pipeline stage independently, supporting data-driven design, optimization, and machine-learning workflows for foils.

Sandhu, Rimple [National Laboratory of the Rockies↗

Improved numerical methods for turbulent viscous flows aerothermal modeling program, phase 2

The details of a study to develop accurate and efficient numerical schemes to predict complex flows are described. In this program, several discretization schemes were evaluated using simple test cases. This assessment led to the selection of three schemes for an in-depth evaluation based on two-dimensional flows. The scheme with the superior overall performance was incorporated in a computer program for three-dimensional flows. To improve the computational efficiency, the selected discretization scheme was combined with a direct solution approach in which the fluid flow equations are solved simultaneously rather than sequentially.

Karki, K. C.↗

Reliable algorithm for modal decomposition

This paper describes a reliable, general algorithm for modal decomposition in real arithmetic and its use in analyzing and synthesizing control logic for linear dynamic systems. The numerical difficulties are described associated with computing the Jordan canonical form when the system has repeated, or nearly repeated, eigenvalues. A new algorithm is described that satisfactorily solves these numerical difficulties. The relation and extension to related numerical analysis research are discussed to clarify the reliability of the techniques. Finally, its implementation as a practical modal decomposition method for efficiently computing the matrix exponential, transfer functions, and frequency response is also described.

Walker, Robert A.↗

Enhancements to viscous-shock-layer technique

A solution procedure is presented which considerably improves the computational efficiency of the viscous-shock-layer technique, especially for long slender bodies. The 'predictor-corrector' procedure suggested for obtaining the shock shape beyond the nose region requires only a single global pass. The accuracy of the present method is demonstrated by comparison with globally iterated results over the entire body and with ground- and flight-test data. A good comparison of the results computed with the two methods is shown for different flowfield chemistry models and axisymmetric body shapes. The new procedure results in computer run times 1/3 to 1/2 of the times required for the full-body global iteration procedure. Further, the algebraic expressions used to specify the initial shock shape eliminate the need for a shock shape generated by external means and permit immediate introduction of the full viscous-shock-layer equations. Finally, the present method of solution for the VSL equations provides to the aerothermal designer a very efficient and accurate tool for detailed flowfield as well as future technology studies.

Gupta, Roop N.↗