Search NASA⌕ Search

SEARCH · Search NASA

Results for “computational cost”

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 217 records · Page 12

Kolmogorov-Arnold wavefunctions

Here, this work investigates Kolmogorov-Arnold network-based (KAN) wave-function Ansätz as viable representations for quantum Monte Carlo simulations. Through systematic analysis of one-dimensional model systems, we evaluate their computational efficiency and representational power against established methods. Our numerical experiments suggest some efficient training methods and we explore how the computational cost scales with desired precision, particle number, and system parameters. Roughly speaking, KANs seem to be 10 times cheaper computationally than other neural-network-based Ansätz . We also introduce a novel approach for handling strong short-range potentials—a persistent challenge for many numerical techniques—which generalizes efficiently to higher-dimensional, physically relevant systems with short-ranged strong potentials common in atomic and nuclear physics.

1-dimensional systems↗

Modeling Low-G Slosh Using Negative Mass

The modeling of the behavior of fluids in low- or microgravity is a field with little validated data but of great interest to space agencies and companies in the face of humanity’s expanding presence beyond low Earth orbit. Efforts to refuel and repair satellites in geostationary orbit require an understanding of the behavior of sloshing fuel in microgravity. The stability of remote sensing equipment and satellites depends on robust fluid slosh dampening or very accurate modeling, and the Artemis program includes the refueling of large landing systems in its architecture. However, current methodologies are quite binary: either use a relatively low-accuracy equivalent mechanical model or use computational fluid dynamics which are not practical for onboard systems due to their relatively high computational cost. In this work, a novel method of tracking the bubble rather than tracking the fuel itself is presented. Computational fluid dynamics simulations are used to validate the model based on available experimental data, and the dynamics of a refueler spacecraft based on Gateway’s Logistics Module are simulated both for the sloshing case and without sloshing considered.

Matthew M. Wittal↗

Explicit modeling and concurrent processing in the simulation of multibody dynamic systems

The objective is to present the activities at TRW in developing the capability to simulate the behavior of large flexible multibody space structures. The features of the simulation tools are: (1) to accommodate all rigid/flexible body degrees-of-freedom which incorporate the control system models and external forces, (2) to provide the flexibility to incorporate engineering-defined models and to retain parameters of significance to the engineer, (3) to reduce the computation cost by one order of magnitude (two orders of magnitude compared to a CRAY 1S), and (4) to keep it versatile so that radical variations in anticipated space structures can be accommodated. The current computer tools to simulate multibody systems appear not only to be very costly and time consuming, but also do not produce the desired fidelity of the mathematical models. In summary, a multibody simulation tool will be developed in the near future which will allow solution of the dynamics and controls of the deployment of the LDR backup structure, or the problem associated with the robotic assembly of the structure. The tools will allow the engineer to define the modeling technique and solve problems in less time and at reduced cost.

Gluck, R.↗

Computing Reaction Kinetics with MC-PDFT–OPESf: Combining Multireference Electronic Structure Theory and Enhanced Sampling

Accurate rate constants are crucial for understanding and optimizing catalytic reactions mediated by enzymes, metalloproteins, and heterogeneous catalysts. These systems frequently present a dual computational challenge. Multiconfigurational reaction sites require multireference techniques for the accurate treatment of the electronic structure, and high activation barriers prevent efficient sampling of unbiased reactive transitions. In this work, we combine multiconfiguration pair-density functional theory (MC-PDFT) as an accurate and efficient multireference electronic structure method with on-the-fly probability-enhanced sampling flooding (OPESf) as an enhanced sampling method capable of accelerating reactive transitions. We demonstrate the approach on the Diels–Alder [4+2] cycloaddition between cis-butadiene and ethene as a reaction characterized by a large activation barrier and multireference character. MC-PDFT–OPESf provides reaction rates in agreement with experiments at a fraction of the computational cost required by conventional unbiased ab initio calculations. Here, we propose MC-PDFT–OPESf as an efficient approach for computing kinetics in strongly correlated molecular systems.

Chemical calculations↗

Machine learning and TDDFT software for stopping power computation

(SF-24-012) Stopping power describes the rate that a material slows radiation particles passing through it and is useful in designing many technologies. Few organizations can perform new measurements, which require significant resources and rare equipment, and all others rely on coarse approximations rendered from pre-existing data. Methods for computing stopping power in new materials, such as time-dependent density functional theory (TD-DFT), have only recently (circa-2015) become available but are too computationally costly to use frequently enough to have a pronounced impact. We have created a method that opens a pathway to computing stopping power without any need for experimental data by combining electronic structure computations and machine learning.

Ward, Logan↗

Rapid Aero Modeling for Urban Air Mobility Aircraft in Computational Experiments

Rapid Aero Modeling (RAM) applied to computational testing, RAM-C, is an approach to efficiently and automatically obtain aerodynamic models during computational investigations. RAM-C is designed to estimate models appropriate for flight dynamics studies and simulations. The approach responds to a demand for experimental efficiency and model fidelity that has increased with growing aircraft complexity and aerodynamic nonlinearities associated with hybrid and electric vertical takeoff and landing (eVTOL) aircraft. In an Urban Air Mobility (UAM) transportation system, it is expected that aircraft will embrace many features from both airplanes and rotorcraft. These vehicles present many more factors than conventional aircraft which can lead to increased computational costs and missed key factor interactions when applying traditional testing and modeling methods. RAM-C provides feedback loops around computational codes to rapidly guide testing toward aerodynamic models meeting user-defined fidelity goals. It combines and extends concepts from design of experiment theory and aircraft system identification theory that allow the user the freedom to choose, in advance of the test, a specific level of fidelity in terms of prediction error. RAM-C only collects enough data required to meet the user-specified prediction error requirements thus saving computational time and resources. The overall achievable fidelity of the final model also depends on the accuracy of the test facility, or in this case, the computational modeling approach. Previous studies to support development of the RAM-T process were conducted in wind tunnel tests to assess potential metrics, algorithms, and procedures. This paper presents results from the next steps taken and tests conducted for the development of RAM-C technology and highlights some of the unique features of RAM applied eVTOL configurations in a computational study.

Aerodynamics↗

LATTE: open-source, high-performance traveltime computation, tomography and source location in acoustic and elastic media

Traveltime-based tomography and source location are fundamental approaches for imaging subsurface structures and understanding the spatiotemporal distribution of seismicity from local to global scales. We present an open-source, high-performance framework integrating eikonal equation solvers and adjoint-state theory for traveltime computation, velocity tomography, source location and joint tomography-location in 2-D/3-D acoustic and elastic media. We introduce novel regularization schemes based on total generalized p-variation, structural similarity and multitask machine learning to enhance the fidelity and interpretability of inverted models and source locations. Key features of our implementation also include the ability to leverage both absolute-difference and double-difference traveltime misfits for high-fidelity velocity tomography and source parameter estimation; support for traveltime computation and inversion in diverse 2-D/3-D scenarios with arbitrary source and receiver distributions; and a perturbation-based optimal step-size estimation method to reduce computational costs. In addition, our implementation employs shared-memory and distributed-memory parallelization to provide an efficient solution for traveltime computation, tomography, and source location. In conclusion, we validate the efficacy and accuracy of our approach through multiple synthetic data examples.

58 GEOSCIENCES↗

ResSR: A Computationally Efficient Residual Approach to Super-Resolving Multispectral Images

Multispectral imaging (MSI) plays a critical role in material classification, environmental monitoring, and remote sensing. However, MSI sensors typically have wavelength-dependent resolution, which limits downstream analysis. MSI super-resolution (MSI-SR) methods address this limitation by reconstructing all bands at a common high spatial resolution. Existing methods can achieve high reconstruction quality but often rely on spatially-coupled optimization or large learning-based models, leading to significant computational cost and limiting their use in large-scale or time-critical settings. In this paper, we introduce ResSR, a computationally efficient, model-based MSI-SR method that achieves high-quality reconstruction without supervised training or spatially-coupled optimization. Notably, ResSR decouples spectral and spatial processing into two sequential steps. ResSR first computes a spectrally-informed high-resolution estimate of the MSI using singular value decomposition together with a spatially-decoupled approximate forward model. It then applies a residual correction step to restore low-frequency spatial consistency while preserving high-frequency detail recovered by the spectral reconstruction. ResSR achieves comparable or improved reconstruction quality relative to existing MSI-SR methods while being

Sullivan, Haley [ORNL] (ORCID:0000000274069217)↗

Verifying X-Radiographs With Computed Tomographs

Nondestructive technique gives added confidence in inspection. Ambiguous indications in radiographic inspections of metal castings checked by computed tomography. Fast and inexpensive conventional x-ray inspection used to make film image of overall casting, and slower, more costly computed tomography used to reinspect relatively few parts of casting presenting possible diffraction patterns or other difficult-to-interpret features. Method effective in resolving ambiguities in radiographs of turbine blades. Provides same information as metallurgical sectioning.

Roy, Jagatjit↗

Aerodynamic design optimization using sensitivity analysis and computational fluid dynamics

A new and efficient method is presented for aerodynamic design optimization, which is based on a computational fluid dynamics (CFD)-sensitivity analysis algorithm. The method is applied to design a scramjet-afterbody configuration for an optimized axial thrust. The Euler equations are solved for the inviscid analysis of the flow, which in turn provides the objective function and the constraints. The CFD analysis is then coupled with the optimization procedure that uses a constrained minimization method. The sensitivity coefficients, i.e. gradients of the objective function and the constraints, needed for the optimization are obtained using a quasi-analytical method rather than the traditional brute force method of finite difference approximations. During the one-dimensional search of the optimization procedure, an approximate flow analysis (predicted flow) based on a first-order Taylor series expansion is used to reduce the computational cost. Finally, the sensitivity of the optimum objective function to various design parameters, which are kept constant during the optimization, is computed to predict new optimum solutions. The flow analysis of the demonstrative example are compared with the experimental data. It is shown that the method is more efficient than the traditional methods.

Baysal, Oktay↗

PCLAM: a Python Module for Computing Surface Lineloads and Moments

Lineloads serve a unique and important role in aerodynamic database development as well as configuration design and analysis. A new software suite was constructed which can compute lineloads rapidly enough that the calculations can run in tandem with high-fidelity fluid flow solvers. This enables the calculation of iteration- or time-dependent lineloads, which have thus far been too computationally costly to create for complicated systems like launch vehicles. The suite is organized into a standalone Python module named PCLAM (PCLAM Computes Lineloads And Moments) which can be imported into other software with minimal restructuring by the user or developer. The computed lineloads are integrated with a $C^0$ numerical quality and exhibit the expected sensitivity to underlying grid resolution. Even at low grid and lineload resolutions, the computed lineloads were found to be in strong agreement with several analytical test cases.

sectional loads↗

Kernel fusion in atomistic spin dynamics simulations on Nvidia GPUs using tensor core

In atomistic spin dynamics simulations, the time cost of constructing the space- and time-displaced pair correlation function in real space increases quadratically as the number of spins N, leading to significant computational effort. The GEMM subroutine can be adopted to accelerate the calculation of the dynamical spin-spin correlation function, but the computational cost of simulating large spin systems (>40000 spins) on CPUs remains expensive. In this work, we perform the simulation on the graphics processing unit (GPU), a hardware solution widely used as an accelerator for scientific computing and deep learning. Here we show that GPUs can accelerate the simulation up to 25-fold compared to multi-core CPUs when using the GEMM subroutine on both. To hide memory latency, we fuse the element-wise operation into the GEMM kernel using CUTLASS that can improve the performance by 26% ~ 33% compared to implementation based on cuBLAS. Furthermore, we perform the on-the-fly calculation in the epilogue of the GEMM subroutine to avoid saving intermediate results on global memory, which makes the large-scale atomistic spin dynamics simulation feasible and affordable.

97 MATHEMATICS AND COMPUTING↗

Dominant balance-based adaptive mesh refinement for incompressible fluid flows

This work introduces a novel adaptive mesh refinement (AMR) method that utilizes dominant balance analysis (DBA) for efficient and accurate grid adaptation in computational fluid dynamics (CFD) simulations. The proposed method leverages a Gaussian mixture model (GMM) to classify grid cells into active and passive regions based on the dominant physical interactions within the equation space. By modeling truncation error probabilistically from discretized terms, the method identifies regions of high interaction where numerical accuracy is most sensitive to resolution. Unlike traditional AMR strategies, this approach does not rely on heuristic-based sensors or user-defined thresholds, providing a fully automated and problem-independent framework for AMR. Applied to the incompressible Navier-Stokes equations for steady and unsteady flow past a cylinder, the DBA-based AMR method achieves comparable accuracy to high-resolution grids while reducing computational costs by up to 70 %. The validation highlights the method’s effectiveness in capturing complex flow features while minimizing grid cells, directing computational resources toward regions with the most critical dynamics. This modular and scalable strategy is adaptable to a wide range of applications, presenting a promising tool for efficient high-fidelity simulations in CFD and other multiphysics domains.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A kinetic line-driven radiation operator and its application to Gyrokinetics

A velocity dependent, kinetic model for line radiation is developed for continuum kinetic codes. It has been implemented in the full-f gyrokinetic code Gkeyll. The total radiation for a charge state is modeled as an advection in velocity space with a form of $\nabla_v \cdot(v\nu(v)f(v))$, guaranteeing particle conservation. The velocity dependence (in the form of an effective frequency $\nu(v)$) is found through fitting the energy loss of the operator, i.e. the second velocity moment, to the radiation data in the OpenADAS database. Therefore, each individual transition does not need to be evaluated every time step, significantly reducing the computational cost of including line radiation in a kinetic model. The dependence on velocity instead of the usual, temperature, allows the radiation to be computed from non-Maxwellian electron distribution functions: We benchmark the model against a collisional radiative model using isotropic non-Maxwellian distribution functions. A velocity dependent model of radiation can more accurately describe the radiation in the more kinetic regimes expected in reactor-scale devices. The velocity dependence qualitatively captures the quantum mechanical need for a minimum velocity before any radiation occurs.

kinetic↗

Near-Wall Models in Large Eddy Simulations of Flow Behind a Backward-Facing Step

Accurate large eddy simulation (LES) of a wall-bounded flow generally requires a near-wall resolution comparable to that in direct numerical simulation (DNS). As much as 50% of the total grid points and computational costs are expended in the near-wall regions in a typical simulation. This limits LES to fairly low Reynolds numbers on current computers. To perform practical flow applications at realistically high Reynolds numbers, such as flow over an airfoil, it is desirable to replace very thin, near-wall regions in the LES with easily and inexpensively computed wall models to specify the near-wall boundary conditions.

Cabot, W.↗

Spiking Neurons for Analysis of Patterns

Artificial neural networks comprising spiking neurons of a novel type have been conceived as improved pattern-analysis and pattern-recognition computational systems. These neurons are represented by a mathematical model denoted the state-variable model (SVM), which among other things, exploits a computational parallelism inherent in spiking-neuron geometry. Networks of SVM neurons offer advantages of speed and computational efficiency, relative to traditional artificial neural networks. The SVM also overcomes some of the limitations of prior spiking-neuron models. There are numerous potential pattern-recognition, tracking, and data-reduction (data preprocessing) applications for these SVM neural networks on Earth and in exploration of remote planets. Spiking neurons imitate biological neurons more closely than do the neurons of traditional artificial neural networks. A spiking neuron includes a central cell body (soma) surrounded by a tree-like interconnection network (dendrites). Spiking neurons are so named because they generate trains of output pulses (spikes) in response to inputs received from sensors or from other neurons. They gain their speed advantage over traditional neural networks by using the timing of individual spikes for computation, whereas traditional artificial neurons use averages of activity levels over time. Moreover, spiking neurons use the delays inherent in dendritic processing in order to efficiently encode the information content of incoming signals. Because traditional artificial neurons fail to capture this encoding, they have less processing capability, and so it is necessary to use more gates when implementing traditional artificial neurons in electronic circuitry. Such higher-order functions as dynamic tasking are effected by use of pools (collections) of spiking neurons interconnected by spike-transmitting fibers. The SVM includes adaptive thresholds and submodels of transport of ions (in imitation of such transport in biological neurons). These features enable the neurons to adapt their responses to high-rate inputs from sensors, and to adapt their firing thresholds to mitigate noise or effects of potential sensor failure. The mathematical derivation of the SVM starts from a prior model, known in the art as the point soma model, which captures all of the salient properties of neuronal response while keeping the computational cost low. The point-soma latency time is modified to be an exponentially decaying function of the strength of the applied potential. Choosing computational efficiency over biological fidelity, the dendrites surrounding a neuron are represented by simplified compartmental submodels and there are no dendritic spines. Updates to the dendritic potential, calcium-ion concentrations and conductances, and potassium-ion conductances are done by use of equations similar to those of the point soma. Diffusion processes in dendrites are modeled by averaging among nearest-neighbor compartments. Inputs to each of the dendritic compartments come from sensors. Alternatively or in addition, when an affected neuron is part of a pool, inputs can come from other spiking neurons. At present, SVM neural networks are implemented by computational simulation, using algorithms that encode the SVM and its submodels. However, it should be possible to implement these neural networks in hardware: The differential equations for the dendritic and cellular processes in the SVM model of spiking neurons map to equivalent circuits that can be implemented directly in analog very-large-scale integrated (VLSI) circuits.

Huntsberger, Terrance↗

Economical Third-Order Methods for Accurate Surface Heating Predictions on Simplex Element Meshes

A node-centered edge-based finite volume discretization of the compressible Navier-Stokes equations is presented with the heat flux reformulated as a first order system. A dissipation vector is derived for the reformulated system, such that the heat flux can be upgraded to O(h^3) on simplex element meshes in the same fashion as the inviscid fluxes. The method of manufactured solutions is used to demonstrate this uniform order property in heat flux. This new system is shown to efficiently produce accurate surface heating predictions on hypersonic hemisphere flow using an anisotropic simplex element mesh, achieving O(h^3) accuracy at relatively low computational cost compared to similar methods.

Computational Fluid Dynamics↗