Search NASA⌕ Search

SEARCH · Search NASA

Results for “Physical Algorithm”

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 541 records · Page 30
All sourcesNASA NTRSDOE OSTI
NASA NTRS2021

Measurements of Rainfall Rate, Drop Size Distribution, and Variability at Middle and Higher Latitudes: Application to the Combined DPR-GMI Algorithm

The Global Precipitation Measurement mission is a major U.S.–Japan joint mission to understand the physics of the Earth’s global precipitation as a key component of its weather, climate, and hydrological systems. The core satellite carries a dual-precipitation radar and an advanced microwave imager which provide measurements to retrieve the drop size distribution (DSD) and rain rates using a Combined Radar-Radiometer Algorithm (CORRA). Our objective is to validate key assumptions and parameterizations in CORRA and enable improved estimation of precipitation products, especially in the middle-to-higher latitudes in both hemispheres. The DSD parameters and statistical relationships between DSD parameters and radar measurements are a central part of the rainfall retrieval algorithm, which is complicated by regimes where DSD measurements are abysmally sparse (over the open ocean). In view of this, we have assembled optical disdrometer datasets gathered by research vessels, ground stations, and aircrafts to simulate radar observables and validate the scattering lookup tables used in CORRA. The joint use of all DSD datasets spans a large range of drop concentrations and characteristic drop diameters. The scaling normalization of DSDs defines an intercept parameter N(W), which normalizes the concentrations, and a scaling diameter D(m), which compresses or stretches the diameter coordinate axis. A major finding of this study is that a single relationship between N(W) and D(m), on average, unifies all datasets included, from stratocumulus to heavier rainfall regimes. A comparison with the N(W)–D(m) relation used as a constraint in versions 6 and 7 of CORRA highlights the scope for improvement of rainfall retrievals for small drops (D(m) < 1 mm) and large drops (D(m) > 2 mm). The normalized specific attenuation–reflectivity relationships used in the combined algorithm are also found to match well the equivalent relationships derived using DSDs from the three datasets, suggesting that the currently assumed lookup tables are not a major source of uncertainty in the combined algorithm rainfall estimates.

Viswanathan Bringi↗
NASA NTRS2011

Surface Modeling to Support Small-Body Spacecraft Exploration and Proximity Operations

In order to simulate physically plausible surfaces that represent geologically evolved surfaces, demonstrating demanding surface-relative guidance navigation and control (GN&C) actions, such surfaces must be made to mimic the geological processes themselves. A report describes how, using software and algorithms to model body surfaces as a series of digital terrain maps, a series of processes was put in place that evolve the surface from some assumed nominal starting condition. The physical processes modeled in this algorithmic technique include fractal regolith substrate texturing, fractally textured rocks (of empirically derived size and distribution power laws), cratering, and regolith migration under potential energy gradient. Starting with a global model that may be determined observationally or created ad hoc, the surface evolution is begun. First, material of some assumed strength is layered on the global model in a fractally random pattern. Then, rocks are distributed according to power laws measured on the Moon. Cratering then takes place in a temporal fashion, including modeling of ejecta blankets and taking into account the gravity of the object (which determines how much of the ejecta blanket falls back to the surface), and causing the observed phenomena of older craters being progressively buried by the ejecta of earlier impacts. Finally, regolith migration occurs which stratifies finer materials from coarser, as the fine material progressively migrates to regions of lower potential energy.

Riedel, Joseph E.↗
NASA NTRS2007

Integrated Hardware and Software for No-Loss Computing

When an algorithm is distributed across multiple threads executing on many distinct processors, a loss of one of those threads or processors can potentially result in the total loss of all the incremental results up to that point. When implementation is massively hardware distributed, then the probability of a hardware failure during the course of a long execution is potentially high. Traditionally, this problem has been addressed by establishing checkpoints where the current state of some or part of the execution is saved. Then in the event of a failure, this state information can be used to recompute that point in the execution and resume the computation from that point. A serious problem arises when one distributes a problem across multiple threads and physical processors is that one increases the likelihood of the algorithm failing due to no fault of the scientist but as a result of hardware faults coupled with operating system problems. With good reason, scientists expect their computing tools to serve them and not the other way around. What is novel here is a unique combination of hardware and software that reformulates an application into monolithic structure that can be monitored in real-time and dynamically reconfigured in the event of a failure. This unique reformulation of hardware and software will provide advanced aeronautical technologies to meet the challenges of next-generation systems in aviation, for civilian and scientific purposes, in our atmosphere and in atmospheres of other worlds. In particular, with respect to NASA s manned flight to Mars, this technology addresses the critical requirements for improving safety and increasing reliability of manned spacecraft.

James, Mark↗
NASA NTRS1979

A one-dimensional model describing aerosol formation and evolution in the stratosphere. I - Physical processes and mathematical analogs. II - Sensitivity studies and comparison with observations

A new time-dependent one-dimensional model of the stratospheric sulfate aerosol layer is developed. The model treats atmospheric photochemistry and aerosol physics in detail and includes the interaction between gases and particles explicitly. It is shown that the numerical algorithms used in the model are quite precise. Sensitivity studies and comparison with observations are made. The simulated aerosol physics generates a particle layer with most of the observed properties. The sensitivity of the calculated properties to changes in a large number of aeronomic aerosol parameters is discussed in some detail. The sensitivity analysis reveals areas where the aerosol model is most uncertain. New observations are suggested that might help resolve important questions about the origin of the stratospheric aerosol layer.

Turco, R. P.↗
NASA NTRS2010

Analysis of Sting Balance Calibration Data Using Optimized Regression Models

Calibration data of a wind tunnel sting balance was processed using a candidate math model search algorithm that recommends an optimized regression model for the data analysis. During the calibration the normal force and the moment at the balance moment center were selected as independent calibration variables. The sting balance itself had two moment gages. Therefore, after analyzing the connection between calibration loads and gage outputs, it was decided to choose the difference and the sum of the gage outputs as the two responses that best describe the behavior of the balance. The math model search algorithm was applied to these two responses. An optimized regression model was obtained for each response. Classical strain gage balance load transformations and the equations of the deflection of a cantilever beam under load are used to show that the search algorithm s two optimized regression models are supported by a theoretical analysis of the relationship between the applied calibration loads and the measured gage outputs. The analysis of the sting balance calibration data set is a rare example of a situation when terms of a regression model of a balance can directly be derived from first principles of physics. In addition, it is interesting to note that the search algorithm recommended the correct regression model term combinations using only a set of statistical quality metrics that were applied to the experimental data during the algorithm s term selection process.

Ulbrich, N.↗
DOE OSTI2025

Real Time implementation of Artificial Intelligence compression algorithm for High-Speed Streaming Readout signals

The new generation of high-energy physics experiments plans to acquire data in streaming mode. With this approach, it is possible to access the information of the whole detector (organized in time slices) for optimal and lossless triggering of data acquisitions. With this approach, data rates, especially in large detectors, are often very high, and the network is likely to be the bottleneck for the entire Streaming Read Out system. The aim of this work is to study the implementation of a lossy compression algorithm based on Artificial Intelligence: an Autoencoder. With Machine Learning it is possible to achieve a high compression ratio and fast inference time with only a small degradation of the signals, almost negligible for the specific application. This work explores different configurations of the Autoencoder and the implementation on different hardware. Different Autoencoder configurations are explored to find the best trade-off between compression ratio and reconstruction loss, both for signals and energy spectrum. Different hardware implementations are also explored to find the best platform to achieve real-time performance for the specific application.

Rossi, Fabio (ORCID:0009000385713885)↗
NASA NTRS2002

Using TRMM Data To Understand Interannual Variations In the Tropical Water Balance

A significant element of the science rationale for TRMM centered on assembling rainfall data needed to validate climate models-- climatological estimates of precipitation, its spatial and temporal variability, and vertical modes of latent heat release. Since the launch of TRMM, a great interest in the science community has emerged for quantifying interannual variability (IAV) of precipitation and its relationship to sea-surface temperature (SST) changes. The fact that TRMM has sampled one strong warm/ cold ENSO couplet, together with the prospect for a mission lifetime approaching ten years, has bolstered this interest in these longer time scales. Variability on a regional basis as well as for the tropics as a whole is of concern. Our analysis of TRMM results so far has shown surprising lack of concordance between various algorithms in quantifying IAV of precipitation. The first objective of this talk is to quantify the sensitivity of tropical precipitation to changes in SSTs. We analyze performance of the 3A11, 3A25, and 3B31 algorithms and investigate their relationship to scattering-- based algorithms constructed from SSM/I and TRMM 85 kHz data. The physical basis for the differences (and similarities) in depicting tropical oceanic and land rainfall will be discussed. We argue that scattering-based estimates of variability constitute a useful upper bound for precipitation variations. These results lead to the second question addressed in this talk-- How do TRMM precipitation / SST sensitivities compare to estimates of oceanic evaporation and what are the implications of these uncertainties in determining interannual changes in large-scale moisture transport? We summarize results of an analysis performed using COADS data supplemented by SSM/I estimates of near-surface variables to assess evaporation sensitivity to SST. The response of near 5 W sq m/K is compared to various TRMM precipitation sensitivities. Implied moisture convergence over the tropics and its sensitivity to errors of these algorithms is discussed.

Robertson, Franklin R.↗
NASA NTRS1989

Partitioning And Packing Equations For Parallel Processing

Algorithm developed to identify parallelism in set of coupled ordinary differential equations that describe physical system and to divide set into parallel computational paths, along with parts of solution proceeds independently of others during at least part of time. Path-identifying algorithm creates number of paths consisting of equations that must be computed serially and table that gives dependent and independent arguments and "can start," "can end," and "must end" times of each equation. "Must end" time used subsequently by packing algorithm.

Arpasi, Dale J.↗
DOE OSTI2026

Is the Matrix Completion of Reduced Density Matrices Unique?

Reduced density matrices are central to describing observables in many-body quantum systems. In electronic structure theory, the two-particle reduced density matrix (2-RDM) suffices to determine the energy and other key properties. Recent work has used matrix completion, leveraging the low-rank structure of RDMs and approximate theoretical models, to reconstruct the 2-RDM from partial data and thus reduce the computational cost. However, matrix completion is, in general, an under-determined problem. Revisiting Rosina’s theorem (Rosina, M. Queen’s Papers on Pure and Applied Mathematics , 1968, No. 11, 369), we here show that the matrix completion is unique under certain conditions, identifying the subset of 2-RDM elements that enables its exact reconstruction from incomplete information. Building on this, we introduce a hybrid quantum–stochastic algorithm that achieves exact matrix completion, demonstrated through applications to the Fermi–Hubbard model.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Snow Distribution Patterns Revisited: A Physics-Based and Machine Learning Hybrid Approach to Snow Distribution Mapping in the Sub-Arctic

Snowpack distribution in Arctic and alpine landscapes often occurs in repeating, year-to-year patterns due to local topographic, weather, and vegetation characteristics. Previous studies have suggested that with years of observational data, these snow distribution patterns can be statistically integrated into a snow process modeling workflow. Recent advances in snow hydrology and machine learning (ML) have increased our ability to predict snowpack distribution using in-situ observations, remote sensing data sets, and simple landscape characteristics that can be easily obtained for most environments. Here, we propose a hybrid approach to couple a ML snow distribution pattern (MLSDP) map with a physics-based, snow process model. We trained a random forest ML algorithm on tens of thousands of snow survey observations from a subarctic study area on the Seward Peninsula, Alaska, collected during peak snow water equivalent (SWE). We validated hybrid model outputs using in-situ snow depth and SWE observations, as well as a light detection and ranging data set and a distributed temperature profiling sensor data set. When the hybrid results were compared with the physics-based method, the hybrid method more accurately depicted the spatial patterns of the snowpack, areas of drifting snow, and years when no in-situ observations were used in the random forest ML training data set. The hybrid method also showed improvements in root mean squared error at 61% of locations where time-series estimations of snow depth were observed. These results can be applied to any physics-based model to improve the snow distribution patterning to reflect observed conditions in high latitude and high elevation cold region environments.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS2003

Rough-Wall Channel Analysis Using Suboptimal Control Theory

The original aim of this work was to shed some light on the physics of turbulence over rough walls using large-eddy simulations and the suboptimal-control wall boundary conditions introduced by Nicoud et al. It was hoped that, if that algorithm was used to fit the mean velocity profile of the simulations to that of a rough-walled channel, instead of to a smooth one, the wall stresses introduced by the control algorithm would give some indication of what aspects of rough walls are most responsible for the modification of the flow in real turbulence. It was similarly expected that the structure of the resulting velocity fluctuations would share some of the characteristics of rough-walled flows, thus again suggesting what is intrinsic and what is accidental in the effect of geometric wall roughness. A secondary goal was to study the effect of 'unphysical' boundary conditions on the outside flow by observing how a relatively major change of the target velocity profile, and therefore presumably of the applied wall stresses, modifies properties such as the dominant length scales of the velocity fluctuations away from the wall. As will be seen below, this secondary goal grew more important during the course of the study, which was carried out during a short summer visit of the first two authors to the CTR. It became clear that there are open questions about the way in which the control algorithm models the boundary conditions, even for smooth walls, and that these questions make the physical interpretation of the results difficult. Considerable more work in that area seems to be needed before even relatively advanced large-eddy simulations, such as these, can be used to draw conclusions about the physics of wall-bounded turbulent flows. The numerical method is the same as in Nicoud et al. The modifications introduced in the original code are briefly described in section 2, but the original paper should be consulted for a full description of the algorithm. The results are presented in section 3 and summarized in section 4. The elementary properties of turbulence over rough walls which are used in the text have been taken from recent reviews such as Raupach et al. or Jimenez.

Flores, O.↗
DOE OSTI2024

Foundations of automatic feature extraction at LHC–point clouds and graphs

Abstract Deep learning algorithms will play a key role in the upcoming runs of the Large Hadron Collider (LHC), helping bolster various fronts ranging from fast and accurate detector simulations to physics analysis probing possible deviations from the Standard Model. The game-changing feature of these new algorithms is the ability to extract relevant information from high-dimensional input spaces, often regarded as “replacing the expert” in designing physics-intuitive variables. While this may seem true at first glance, it is far from reality. Existing research shows that physics-inspired feature extractors have many advantages beyond improving the qualitative understanding of the extracted features. In this review, we systematically explore automatic feature extraction from a phenomenological viewpoint and the motivation for physics-inspired architectures. We also discuss how prior knowledge from physics results in the naturalness of the point cloud representation and discuss graph-based applications to LHC phenomenology.

Bhardwaj, Akanksha↗
DOE OSTI2024

GX: a GPU-native gyrokinetic turbulence code for tokamak and stellarator design

GX is a code designed to solve the nonlinear gyrokinetic system for low-frequency turbulence in magnetized plasmas, particularly tokamaks and stellarators. In GX, our primary motivation and target is a fast gyrokinetic solver that can be used for fusion reactor design and optimization along with wide-ranging physics exploration. Here, this has led to several code and algorithm design decisions, specifically chosen to prioritize time to solution. First, we have used a discretization algorithm that is pseudospectral in the entire phase space, including a Laguerre–Hermite pseudospectral formulation of velocity space, which allows for smooth interpolation between coarse gyrofluid-like resolutions and finer conventional gyrokinetic resolutions and efficient evaluation of a model collision operator. Additionally, we have built GX to natively target graphics processors (GPUs), which are among the fastest computational platforms available today. Finally, we have taken advantage of the reactor-relevant limit of small $\rho _*$ by using the radially local flux-tube approach. In this paper we present details about the gyrokinetic system and the numerical algorithms used in GX to solve the system. We then present several numerical benchmarks against established gyrokinetic codes in both tokamak and stellarator magnetic geometries to verify that GX correctly simulates gyrokinetic turbulence in the small $\rho _*$. Moreover, we show that the convergence properties of the Laguerre–Hermite spectral velocity formulation are quite favourable for nonlinear problems of interest. Coupled with GPU acceleration, which we also investigate with scaling studies, this enables GX to be able to produce useful turbulence simulations in minutes on one (or a few) GPUs and higher fidelity results in a few hours using several GPUs. GX is open-source software that is ready for fusion reactor design studies.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Quantum Algorithm for Linear Non-unitary Dynamics with Near-Optimal Dependence on All Parameters

We introduce a family of identities that express general linear non-unitary evolution operators as a linear combination of unitary evolution operators, each solving a Hamiltonian simulation problem. This formulation can exponentially enhance the accuracy of the recently introduced linear combination of Hamiltonian simulation (LCHS) method [An, Liu, and Lin, Physical Review Letters, 2023]. For the first time, this approach enables quantum algorithms to solve linear differential equations with both optimal state preparation cost and near-optimal scaling in matrix queries on all parameters.

Applied Dynamical Systems↗
DOE OSTI2025

Iterative quantum optimization of spin glass problems with rapidly oscillating transverse fields

In this work, we introduce a new iterative quantum algorithm, called Iterative Symphonic Tunneling for Satisfiability problems (IST-SAT), which solves quantum spin glass optimization problems using high-frequency oscillating transverse fields. IST-SAT operates as a sequence of iterations, in which bitstrings returned from one iteration are used to set spin-dependent phases in oscillating transverse fields in the next iteration. Over several iterations, the novel mechanism of the algorithm steers the system toward the problem ground state. We benchmark IST-SAT on sets of hard MAX-3-XORSAT problem instances with exact state vector simulation, and report polynomial speedups over Trotterized adiabatic quantum computation and the best known semi-greedy classical algorithm. When IST-SAT is seeded with a sufficiently good initial approximation, the algorithm converges to exact solution(s) in a polynomial number of iterations. Our numerical results identify a critical Hamming radius, or quality of initial approximation, where the time-to-solution crosses from exponential to polynomial scaling in problem size. This work proposes IST-SAT a new quantum algorithm, which improves upon solutions obtained from initial classical or quantum optimization algorithms. The steering mechanism we introduce through IST-SAT presents a new path toward achieving quantum advantage in optimization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS2000

Recent Trends in the Analysis of Quasioptical Systems

The recent trend in microwave instruments is the use of multiple millimeter and submillimeter wavelength bands. These systems are typically analyzed by using physical optics, Gaussian beams or ray tracing techniques. Physical optics offers high accuracy at the expense of computation time. This trade-off becomes particularly apparent in the analysis of multiple reflector antennas, such as beam waveguide antennas, where physical optics is used to compute the current on each reflector from the current on the previous reflector. At the other end of the spectrum is ray tracing approaches that ignore diffraction effects entirely. These methods are fast but sacrifice the ability to predict some effects accurately. An intermediate approach is to use an appropriate set of expansion functions to model the field between the reflectors. If the set is chosen wisely only a few coefficients need to be determined from each reflector current. The field is then computed at the next reflector through the use of the expansion functions and their coefficients rather than by using the previous reflector current. For a beam waveguide system with no enclosing tubes an excellent set of expansion functions is the Gaussian beam mode set. In many cases a preliminary design which includes the effects on diffraction may be obtained by considering only the fundamental mode and a thin lens model for the reflectors. Higher-order modes are included to model the effects of the curved reflector, which include asymmetric distortion of the beam, cross polarization, and beam truncation. This paper describes a computer code implementing higher-order Gaussian beam scattering by multiple reflector systems. There are four essential steps in the algorithm. (1) Compute the current on the first reflector using physical optics using either a feed model or by an incident set of Gaussian beam modes. (2) Find the direction of propagation for the reflected Gaussian beam-set using ray tracing. (3) Determine the waist size and location for the output beam set by examining the amplitude and phase distribution of the current on the reflector. (4) Compute the amplitudes of the individual modes in the output mode set. These steps are then repeated for each addition reflector in the chain. In each of these cases the previous Gaussian beam set provides the input field for the current calculation. Details of the four steps discussed above will be discussed. Examples will compare results from the Gaussian beam approach to pure physical optics, illustrating both its merits and limitations. Hybrid approaches capable of eliminating some of the limitations will also be discussed.

Hoppe, D. J.↗