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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 703 records · Page 39

All sources NASA NTRS DOE OSTI

NASA NTRSDate not supplied

Comparison of Visual and LiDAR SLAM Algorithms using NASA Flight Test Data

Simultaneous Localization and Mapping (SLAM) is a promising technique that provides localization information and precise mapping of the physical environment without having much prior knowledge of the surroundings. SLAM may have a vital role in aeronautics and aerospace, where vehicles and aircraft must operate in complex environments with traditional localization services that may be degraded or unavailable. This paper compares several pre-canned 3D SLAM algorithms based on vision and LiDAR, namely ORB-SLAM, ORB-SLAM2, LOAM, A-LOAM, and F-LOAM on NASA UAS (Unmanned Aircraft System) flight test data. The NASA ARC UAS flight test demonstrates preliminary SLAM algorithm results, which serve as a stepping stone to simulated AAM (Advanced Air Mobility) concepts. Conducting AFRC UAS flight test for simulated AAM approach and landing with SLAM algorithms provides an Alternative Precision Navigation and Timing solution based on distributed landmarks and fiducials in the landing zone. These algorithms use the telemetry data as ground truth for a baseline comparison. The criteria of the performance comparison include robustness, accuracy, re-localization, response to environmental changes, and real-time effectiveness, which are currently qualitative but to be quantitative in the future.

computer vision↗

DOE OSTI2026

Machine learning approach for vibronically renormalized electronic band structures

Here, we present a machine learning (ML) method for efficient computation of vibrational thermal expectation values of physical properties from first principles. Our approach is based on the nonperturbative frozen phonon formulation in which stochastic Monte Carlo algorithm is employed to sample configurations of nuclei in a supercell at finite temperatures based on a first-principles phonon model. A deep-learning neural network is trained to accurately predict physical properties associated with sampled phonon configurations, thus bypassing the time-consuming ab initio calculations. To incorporate the point-group symmetry of the electronic system into the ML model, group-theoretical methods are used to develop a symmetry-invariant descriptor for phonon configurations in the supercell. We apply our ML approach to compute the temperature dependent electronic energy gap of silicon based on density functional theory (DFT). We show that, with less than a hundred DFT calculations for training the neural network model, an order of magnitude larger number of sampling can be achieved for the computation of the vibrational thermal expectation values. Our work highlights the promising potential of ML techniques for finite temperature first-principles electronic structure methods.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

NASA NTRS1992

Development of generalized pressure velocity coupling scheme for the analysis of compressible and incompressible combusting flows

The objective of this investigation has been to develop an algorithm (or algorithms) for the improvement of the accuracy and efficiency of the computer fluid dynamics (CFD) models to study the fundamental physics of combustion chamber flows, which are necessary ultimately for the design of propulsion systems such as SSME and STME. During this three year study (May 19, 1978 - May 18, 1992), a unique algorithm was developed for all speed flows. This newly developed algorithm basically consists of two pressure-based algorithms (i.e. PISOC and MFICE). This PISOC is a non-iterative scheme and the FICE is an iterative scheme where PISOC has the characteristic advantages on low and high speed flows and the modified FICE has shown its efficiency and accuracy to compute the flows in the transonic region. A new algorithm is born from a combination of these two algorithms. This newly developed algorithm has general application in both time-accurate and steady state flows, and also was tested extensively for various flow conditions, such as turbulent flows, chemically reacting flows, and multiphase flows.

Chen, C. P.↗

DOE OSTI2024

The black hole interior from non-isometric codes and complexity

Quantum error correction has given us a natural language for the emergence of spacetime, but the black hole interior poses a challenge for this framework: at late times the apparent number of interior degrees of freedom in effective field theory can vastly exceed the true number of fundamental degrees of freedom, so there can be no isometric (i.e. inner-product preserving) encoding of the former into the latter. In this paper we explain how quantum error correction nonetheless can be used to explain the emergence of the black hole interior, via the idea of “non-isometric codes protected by computational complexity”. We show that many previous ideas, such as the existence of a large number of “null states”, a breakdown of effective field theory for operations of exponential complexity, the quantum extremal surface calculation of the Page curve, post-selection, “state-dependent/state-specific” operator reconstruction, and the “simple entropy” approach to complexity coarse-graining, all fit naturally into this framework, and we illustrate all of these phenomena simultaneously in a soluble model.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2024

Evaluating a quantum-classical quantum Monte Carlo algorithm with Matchgate shadows

Solving the electronic structure problem of molecules and solids to high accuracy is a major challenge in quantum chemistry and condensed matter physics. The rapid emergence and development of quantum computers offer a promising route to systematically tackle this problem. Recent work by [Huggins et al ., Nature (London) 603 , 416 (2022)] proposed a hybrid quantum-classical quantum Monte Carlo (QC-QMC) algorithm using Clifford shadows to determine the ground state of a Fermionic Hamiltonian. This approach displayed inherent noise resilience and the potential for improved accuracy compared to its purely classical counterpart. Nevertheless, the use of Clifford shadows introduces an exponentially scaling postprocessing cost. In this work, we investigate an improved QC-QMC scheme utilizing the recently developed Matchgate shadows technique [Commun. Math. Phys. 404 , 629 (2023)], which removes the aforementioned exponential bottleneck. We observe from experiments on quantum hardware that the use of Matchgate shadows in QC-QMC is inherently noise robust. We show that this noise resilience has a more subtle origin than in the case of Clifford shadows. Nevertheless, we find that classical postprocessing, while asymptotically efficient, requires hours of runtime on thousands of classical CPUs for even the smallest chemical systems, presenting a major challenge to the scalability of the algorithm.

Monte Carlo methods↗

NASA NTRS2011

Graph Theory Roots of Spatial Operators for Kinematics and Dynamics

Spatial operators have been used to analyze the dynamics of robotic multibody systems and to develop novel computational dynamics algorithms. Mass matrix factorization, inversion, diagonalization, and linearization are among several new insights obtained using such operators. While initially developed for serial rigid body manipulators, the spatial operators and the related mathematical analysis have been shown to extend very broadly including to tree and closed topology systems, to systems with flexible joints, links, etc. This work uses concepts from graph theory to explore the mathematical foundations of spatial operators. The goal is to study and characterize the properties of the spatial operators at an abstract level so that they can be applied to a broader range of dynamics problems. The rich mathematical properties of the kinematics and dynamics of robotic multibody systems has been an area of strong research interest for several decades. These properties are important to understand the inherent physical behavior of systems, for stability and control analysis, for the development of computational algorithms, and for model development of faithful models. Recurring patterns in spatial operators leads one to ask the more abstract question about the properties and characteristics of spatial operators that make them so broadly applicable. The idea is to step back from the specific application systems, and understand more deeply the generic requirements and properties of spatial operators, so that the insights and techniques are readily available across different kinematics and dynamics problems. In this work, techniques from graph theory were used to explore the abstract basis for the spatial operators. The close relationship between the mathematical properties of adjacency matrices for graphs and those of spatial operators and their kernels were established. The connections hold across very basic requirements on the system topology, the nature of the component bodies, the indexing schemes, etc. The relationship of the underlying structure is intimately connected with efficient, recursive computational algorithms. The results provide the foundational groundwork for a much broader look at the key problems in kinematics and dynamics. The properties of general graphs and trees of nodes and edge were examined, as well as the properties of adjacency matrices that are used to describe graph connectivity. The nilpotency property of such matrices for directed trees was reviewed, and the adjacency matrices were generalized to the notion of block weighted adjacency matrices that support block matrix elements. This leads us to the development of the notion of Spatial Kernel Operator SKO kernels. These kernels provide the basis for the development of SKO resolvent operators.

Jain, Abhinandan↗

DOE OSTI2025

High-performance data format for scientific data storage and analysis

Here, in this article, we present the High-Performance Output (HiPO) data format developed at Jefferson Laboratory for storing and analyzing data from Nuclear Physics experiments. The format was designed to efficiently store large amounts of experimental data, utilizing modern fast compression algorithms. The purpose of this development was to provide organized data in the output, facilitating access to relevant information within the large data files. The HiPO data format has features that are suited for storing raw detector data, reconstruction data, and the final physics analysis data efficiently, eliminating the need to do data conversions through the lifecycle of experimental data. The HiPO data format is implemented in C++ and JAVA, and provides bindings to FORTRAN, Python, and Julia, providing users with the choice of data analysis frameworks to use. In this paper, we will present the general design and functionalities of the HiPO library and compare the performance of the library with more established data formats used in data analysis in High Energy and Nuclear Physics (such as ROOT and Parquete). In columnar data analysis, HiPO surpasses established data formats in performance and can be effectively applied to data analysis in other scientific fields.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

NASA NTRS2011

A Model-Based Prognostics Approach Applied to Pneumatic Valves

Within the area of systems health management, the task of prognostics centers on predicting when components will fail. Model-based prognostics exploits domain knowledge of the system, its components, and how they fail by casting the underlying physical phenomena in a physics-based model that is derived from first principles. Uncertainty cannot be avoided in prediction, therefore, algorithms are employed that help in managing these uncertainties. The particle filtering algorithm has become a popular choice for model-based prognostics due to its wide applicability, ease of implementation, and support for uncertainty management. We develop a general model-based prognostics methodology within a robust probabilistic framework using particle filters. As a case study, we consider a pneumatic valve from the Space Shuttle cryogenic refueling system. We develop a detailed physics-based model of the pneumatic valve, and perform comprehensive simulation experiments to illustrate our prognostics approach and evaluate its effectiveness and robustness. The approach is demonstrated using historical pneumatic valve data from the refueling system.

Daigle, Matthew J.↗

DOE OSTI2024

Performance of the CMS high-level trigger during LHC Run 2

The CERN LHC provided proton and heavy ion collisions during its Run 2 operation period from 2015 to 2018. Proton-proton collisions reached a peak instantaneous luminosity of 2.1× 10 34 cm -2 s -1 , twice the initial design value, at √(s)=13 TeV. The CMS experiment records a subset of the collisions for further processing as part of its online selection of data for physics analyses, using a two-level trigger system: the Level-1 trigger, implemented in custom-designed electronics, and the high-level trigger, a streamlined version of the offline reconstruction software running on a large computer farm. This paper presents the performance of the CMS high-level trigger system during LHC Run 2 for physics objects, such as leptons, jets, and missing transverse momentum, which meet the broad needs of the CMS physics program and the challenge of the evolving LHC and detector conditions. Sophisticated algorithms that were originally used in offline reconstruction were deployed online. Highlights include a machine-learning b tagging algorithm and a reconstruction algorithm for tau leptons that decay hadronically.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

NASA NTRS1993

Development of deterministic transport methods for low energy neutrons for shielding in space

Transport of low energy neutrons associated with the galactic cosmic ray cascade is analyzed in this dissertation. A benchmark quality analytical algorithm is demonstrated for use with BRYNTRN, a computer program written by the High Energy Physics Division of NASA Langley Research Center, which is used to design and analyze shielding against the radiation created by the cascade. BRYNTRN uses numerical methods to solve the integral transport equations for baryons with the straight-ahead approximation, and numerical and empirical methods to generate the interaction probabilities. The straight-ahead approximation is adequate for charged particles, but not for neutrons. As NASA Langley improves BRYNTRN to include low energy neutrons, a benchmark quality solution is needed for comparison. The neutron transport algorithm demonstrated in this dissertation uses the closed-form Green's function solution to the galactic cosmic ray cascade transport equations to generate a source of neutrons. A basis function expansion for finite heterogeneous and semi-infinite homogeneous slabs with multiple energy groups and isotropic scattering is used to generate neutron fluxes resulting from the cascade. This method, called the FN method, is used to solve the neutral particle linear Boltzmann transport equation. As a demonstration of the algorithm coded in the programs MGSLAB and MGSEMI, neutron and ion fluxes are shown for a beam of fluorine ions at 1000 MeV per nucleon incident on semi-infinite and finite aluminum slabs. Also, to demonstrate that the shielding effectiveness against the radiation from the galactic cosmic ray cascade is not directly proportional to shield thickness, a graph of transmitted total neutron scalar flux versus slab thickness is shown. A simple model based on the nuclear liquid drop assumption is used to generate cross sections for the galactic cosmic ray cascade. The ENDF/B V database is used to generate the total and scattering cross sections for neutrons in aluminum. As an external verification, the results from MGSLAB and MGSEMI were compared to ANISN/PC, a routinely used neutron transport code, showing excellent agreement. In an application to an aluminum shield, the FN method seems to generate reasonable results.

Ganapol, Barry↗

DOE OSTI2025

Resilience–runtime tradeoff relations for quantum algorithms

Abstract A leading approach to algorithm design aims to minimize the number of operations in an algorithm’s compilation. One intuitively expects that reducing the number of operations may decrease the chance of errors. This paradigm is particularly prevalent in quantum computing, where gates are hard to implement and noise rapidly decreases a quantum computer’s potential to outperform classical computers. Here, we find that minimizing the number of operations in a quantum algorithm can be counterproductive, leading to a noise sensitivity that induces errors when running the algorithm in non-ideal conditions. To show this, we develop a framework to characterize the resilience of an algorithm to perturbative noises (including coherent errors, dephasing, and depolarizing noise). Some compilations of an algorithm can be resilient against certain noise sources while being unstable against other noises. We condense these results into a tradeoff relation between an algorithm’s number of operations and its noise resilience. We also show how this framework can be leveraged to identify compilations of an algorithm that are better suited to withstand certain noises.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS1991

A Newton algorithm for complex curve fitting

The problem of synthesizing transfer functions from frequency response measurements is considered. Given a complex vector representing the measured frequency response of a physical system, a transfer function of specified order is determined that minimizes the sum of the magnitude-squared of the frequency response errors. This nonlinear least squares minimization problem is solved by an iterative global descent algorithm of the Newton type which converges quadratically near the minimum. The unknown transfer function is expressed as a sum of second order rational polynomials, a parameterization that facilitates a numerically robust computer implementation. The algorithm is developed for single-input, single-output, causal, stable transfer functions.

Spanos, J. T.↗

NASA NTRS2017

Algorithms for the Computation of Debris Risk

Determining the risks from space debris involve a number of statistical calculations. These calculations inevitably involve assumptions about geometry - including the physical geometry of orbits and the geometry of satellites. A number of tools have been developed in NASA’s Orbital Debris Program Office to handle these calculations; many of which have never been published before. These include algorithms that are used in NASA’s Orbital Debris Engineering Model ORDEM 3.0, as well as other tools useful for computing orbital collision rates and ground casualty risks. This paper presents an introduction to these algorithms and the assumptions upon which they are based.

Matney, Mark J.↗

NASA NTRS2007

Statistical Analyses of Satellite Cloud Object Data from CERES: Comparison with Cloud-Resolving Model Simulations of Tropical Convective Clouds - Part III

The present study evaluates the ability of a cloud-resolving model (CRM) to simulate the physical properties of tropical deep convective cloud objects identified from a Clouds and the Earth s Radiant Energy System (CERES) data product. The emphasis of this study is the comparisons among the small-, medium- and large-size categories of cloud objects observed during March 1998 and between the large-size categories of cloud objects observed during March 1998 (strong El Ni o) and March 2000 (weak La Ni a). Results from the CRM simulations are analyzed in a way that is consistent with the CERES retrieval algorithm and they are averaged to match the scale of the CERES satellite footprints. Cloud physical properties are analyzed in terms of their summary histograms for each category. It is found that there is a general agreement in the overall shapes of all cloud physical properties between the simulated and observed distributions. Each cloud physical property produced by the CRM also exhibits different degrees of disagreement with observations over different ranges of the property. The simulated cloud tops are generally too high and cloud top temperatures are too low except for the large-size category of March 1998. The probability densities of the simulated top-of-the-atmosphere (TOA) albedos for all four categories are underestimated for high albedos, while those of cloud optical depth are overestimated at its lowest bin. These disagreements are mainly related to uncertainties in the cloud microphysics parameterization and inputs such as cloud ice effective size to the radiation calculation. Summary histograms of cloud optical depth and TOA albedo from the CRM simulations of the large-size category of cloud objects do not differ significantly between the March 1998 and 2000 periods, consistent with the CERES observations. However, the CRM is unable to reproduce the significant differences in the observed cloud top height while it overestimates the differences in the observed outgoing longwave radiation and cloud top temperature between the two periods. Comparisons between the CRM results and the observations for most parameters in March 1998 consistently show that both the simulations and observations have larger differences between the large- and small-size categories than between the large- and medium-size, or between the medium- and small-size categories. However, the simulated cloud properties do not change as much with size as observed. These disagreements are likely related to the spatial averaging of the forcing data and the mismatch in time and in space between the numerical weather prediction model from which the forcing data are produced and the CERES observed cloud systems.

Luo, Yali↗

NASA NTRS2004

Evaluation and Validation of Case 2 Algorithms in Chesapeake Bay

The high temporal and spatial resolution of satellite ocean color observations will prove invaluable for monitoring the health of coastal ecosystems where physical and biological variability demands sampling scales beyond that possible by ship. However, ocean color remote sensing of Case 2 waters is a challenging undertaking due to the optical complexity of the water. The focus of this SIMBIOS support has been to provide in situ optical measurements form Chesapeake Bay (CB) and adjacent mid-Atlantic bight (MAB) waters for use in algorithm development and validation efforts to improve the satellite retrieval of chlorophyll (chl a) in Case 2 waters. CB provides a valuable site for validation of data from ocean color sensors for a number of reasons. First, the physical dimensions of the Bay (greater than 6,500 square kilometers) make retrievals from satellites with a spatial resolution of approximately 1 kilometer (i.e., SeaWiFS) or less (i.e., MODIS) reasonable for most of the ecosystem. Second, CB is highly influenced by freshwater flow from major rivers, making it a classic Case 2 water body with significant concentrations of chlorophyll, particulates and chromophoric dissolved organic matter (CDOM) that highly impact the shape of reflectance spectra. Finally, past and ongoing research efforts provided an expensive data set of optical observations that support the goal of this project.

Harding, Lawrence W., Jr.↗

NASA NTRS1989

Modified Chebyshev pseudospectral method with O(N exp -1) time step restriction

The extreme eigenvalues of the Chebyshev pseudospectral differentiation operator are O(N exp 2) where N is the number of grid points. As a result of this, the allowable time step in an explicit time marching algorithm is O(N exp -2) which, in many cases, is much below the time step dictated by the physics of the partial differential equation. A new set of interpolating points is introduced such that the eigenvalues of the differentiation operator are O(N) and the allowable time step is O(N exp -1). The properties of the new algorithm are similar to those of the Fourier method. The new algorithm also provides a highly accurate solution for non-periodic boundary value problems.

Kosloff, Dan↗

NASA NTRS1993

A modified Chebyshev pseudospectral method with an O(N exp -1) time step restriction

Kosloff, Dan↗

DOE OSTI2024

Machine learning-guided discovery of polymer membranes for CO 2 separation with genetic algorithm

Designing polymer membranes with high gas permeability and selectivity is a difficult multi-task constrained problem due to the trade-off between these two properties. In this work, we present a machine learning (ML) driven genetic algorithm to tackle the design problem of polymer membranes for CO 2 separation from N 2 and O 2 . Using literature data of permeability for three gases, we constructed multiple ML models with different fingerprinting featurization schemes to predict gas permeabilities. Then, we employed a genetic algorithm to design new polymers and evaluated their performance using our ML models. We were able to identify new polymer membranes that are promising for both CO 2 /N 2 and CO 2 /O 2 separations. Further, the top discovered polymers are predicted to have high glass transition temperatures. Similarly, the pyridine functionality was found in ≈20% of the predicted polymers. This framework can be used to design polymers for any application involving constrained optimization. Finally, we outlined the challenges and opportunities with using ML guided data-driven inverse design of polymers.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗