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

NASA's Scientific Agenda for GPM Mission

The objectives of the Global Precipitation Measurement (GPM) Mission are to: 1) Understand the horizontal and vertical structure of rainfall, its macro- and micro-physical nature, and its associated latent heating, 2) Train and calibrate retrieval algorithms for constellation radiometers, 3) Provide sufficient global sampling to significantly reduce uncertainties in short-term rainfall accumulations, and 4) Extend scientific and societal applications. The GPM mission design consists of a core satellite, constellation satellties, precipitation validation sites for error characterization, and a precipitation processing center. This viewgraph presentation profiles the science goals of the mission, and its capability for producing climate data and weather predictions.

Smith, Eric A.↗

NASA Strategy to Safely Live and Work in the Space Radiation Environment

In space, astronauts are constantly bombarded with energetic particles. The goal of the National Aeronautics and Space Agency and the NASA Space Radiation Project is to ensure that astronauts can safely live and work in the space radiation environment. The space radiation environment poses both acute and chronic risks to crew health and safety, but unlike some other aspects of space travel, space radiation exposure has clinically relevant implications for the lifetime of the crew. Among the identified radiation risks are cancer, acute and late CNS damage, chronic and degenerative tissue decease, and acute radiation syndrome. The term "safely" means that risks are sufficiently understood such that acceptable limits on mission, post-mission and multi-mission consequences can be defined. The NASA Space Radiation Project strategy has several elements. The first element is to use a peer-reviewed research program to increase our mechanistic knowledge and genetic capabilities to develop tools for individual risk projection, thereby reducing our dependency on epidemiological data and population-based risk assessment. The second element is to use the NASA Space Radiation Laboratory to provide a ground-based facility to study the health effects/mechanisms of damage from space radiation exposure and the development and validation of biological models of risk, as well as methods for extrapolation to human risk. The third element is a risk modeling effort that integrates the results from research efforts into models of human risk to reduce uncertainties in predicting the identified radiation risks. To understand the biological basis for risk, we must also understand the physical aspects of the crew environment. Thus, the fourth element develops computer algorithms to predict radiation transport properties, evaluate integrated shielding technologies and provide design optimization recommendations for the design of human space systems. Understanding the risks and determining methods to mitigate the risks are keys to a successful radiation protection strategy.

Cucinotta, Francis A.↗

Bio-Inspired Neural Model for Learning Dynamic Models

A neural-network mathematical model that, relative to prior such models, places greater emphasis on some of the temporal aspects of real neural physical processes, has been proposed as a basis for massively parallel, distributed algorithms that learn dynamic models of possibly complex external processes by means of learning rules that are local in space and time. The algorithms could be made to perform such functions as recognition and prediction of words in speech and of objects depicted in video images. The approach embodied in this model is said to be "hardware-friendly" in the following sense: The algorithms would be amenable to execution by special-purpose computers implemented as very-large-scale integrated (VLSI) circuits that would operate at relatively high speeds and low power demands.

Duong, Tuan↗

Simultaneous Retrieval of Surface Roughness Parameters for Bare Soils From Combined Active–Passive Microwave SMAP Observations

An active–passive microwave retrieval algorithm for simultaneous determination of soil surface roughness parameters [vertical root-mean-square (RMS) height ( s ) and horizontal correlation length ( l )] is presented for bare soils. The algorithm is based on active–passive microwave covariation, including the improved Integral Equation Method (I(exp 2) EM), and is tested with global soil moisture active passive (SMAP) observations. The estimated retrieval results for s and l are overall consistent with values in the literature, indicating the validity of the proposed algorithm. Sensitivity analyses showed that the developed roughness retrieval algorithm is independent of permittivity for E(sub s) > 10 [-]. Furthermore, the physical model basis of this approach (I(exp 2) EM) allows the application of different autocorrelation functions (ACF), such as Gaussian and exponential ACFs. Global roughness retrieval results confirm bare areas in deserts such as Sahara or Gobi. However, the type of ACF used within roughness parameter estimation is important. Retrieval results for the Gaussian ACF describe a rougher surface than retrieval results for the exponential ACF. No correlations were found between roughness results and the amount of precipitation or the soil texture, which could be due to the coarse spatial resolution of the SMAP data. The extension of this approach to vegetated soils is planned as an add-on study.

Correlation length↗

How Autonomous Intelligent Systems Can Facilitate Earth-independent Medical Care: Going Beyond Telepresence

During the last decade, teleoperated robotic systems have extended humans’ sensorimotor competence to digitally fly beyond the physical barrier of distance and scale and thus transmit sensorimotor skills of the human through direct communication. Telepresence capabilities have enabled tele-physical remote access at small scales thanks to telerobotic mediums. Although the concept was initially motivated by space applications, such technologies quickly have expanded into the medical domain and resulted in teleoperated medical robots, including telerobotic surgical systems (such as the da Vinci surgical system). Effective telepresence fundamentally depends on an agile, reliable, and secure communication medium that can transmit real-time information between the operator and a remote device. However, direct telepresence may not be achievable for long-duration exploration spaceflight missions. Thus, autonomous systems and local intelligence represent potential solutions to the aforementioned issues. One example solution employs demonstration systems which enable learning from the pre-captured inputs of a skilled human operator. These will be computationally modeled and later probabilistically replicated toward the completion of remote physical tasks when direct telepresence is not viable - such as under communication blackout conditions. In other words, trained autonomous systems (e.g., robots) can perform remote operations that mimic the physical performance of experts during remote operations/training. Beyond learning the physics of the task, autonomous agents can also be used to conduct algorithmic decision-making that mimics the higher-level cognition of the expert. Thus, using an autonomous system, pre-trained cognitive and manipulation-based skills can be leveraged (acquired during pre-mission events) to produce digital twins of an intelligent operator. Such systems can be used for the real-time conduction of intricate tasks in complex and unstructured environments. Such systems will operationalize “cognitive digital twins” and can expand the reach of human cognition and manipulation through the power of data-driven learning from demonstration algorithms. This system category will be discussed as a fully autonomous operation in this talk. In addition to the above, we will also propose and discuss the possibility of partial-automation using remote intelligence and remote sensing. In contrast to full automation, partial automation can close the loop through a local operator equipped with augmented sensory awareness through wearable systems. Such technologies will allow the local operator to conduct delicate tasks while being guided using sensory augmentation and being monitored to gauge her/his level of cognitive focus and performance. The difference with the previous category is that a remote human will conduct the task. Further, rather than making a digital twin of human cognition, we will augment the control inputs of the local human to match those of the skilled expert operator who is not accessible in real-time. Going beyond classic telepresence and thus approaching intelligent telepresence, our vision is that autonomous agents will eventually enable the safe, consistent and efficient delivery of complex, remote and smart medical care during space exploration across operators in an Earth-independent fashion. We will discuss our collective vision from NASA and MERIIT@NYU lab in this talk.

Telepresence↗

Improved Fermion Hamiltonians for Quantum Simulations

Constructing improved hamiltonians for gauge theories coupled to fermonic matter will be important for improving continuum limit extrapolations of quantum computations. In this talk we will present a formulation for simulating ASQTAD fermions for lattice computation and provide fault tolerant resource costs in terms of primitive group operations. We additionally show that the scaling of energies with respect to the lattice spacing are better than for the unimproved Hamiltonian for toy models.

Quantum Algorithms↗

Demonstration of the rodeo algorithm on a quantum computer

The rodeo algorithm is an efficient algorithm for eigenstate preparation and eigenvalue estimation for any observable on a quantum computer. This makes it a promising tool for studying the spectrum and structure of atomic nuclei as well as other fields of quantum many-body physics. The only requirement is that the initial state has sufficient overlap probability with the desired eigenstate. While it is exponentially faster than well-known algorithms such as phase estimation and adiabatic evolution for eigenstate preparation, it has yet to be implemented on an actual quantum device. In this work, we apply the rodeo algorithm to determine the energy levels of a random one-qubit Hamiltonian, resulting in a relative error of 0.08% using mid-circuit measurements on the IBM Q device Casablanca. This surpasses the accuracy of directly-prepared eigenvector expectation values using the same quantum device. We take advantage of the high-accuracy energy determination and use the Hellmann-Feynman theorem to compute eigenvector expectation values for a different random one-qubit observable. For the Hellmann-Feynman calculations, we find a relative error of 0.7%. Here, we conclude by discussing possible future applications of the rodeo algorithm for multi-qubit Hamiltonians.

algorithm↗

Quantum simulations of nuclear resonances with variational methods

Background: The many-body nature of nuclear physics problems poses significant computational challenges. These challenges become even more pronounced when studying the resonance states of nuclear systems, which are governed by the non-Hermitian Hamiltonian. Quantum computing, particularly for quantum many-body systems, offers a promising alternative, especially within the constraints of current noisy intermediate-scale quantum (NISQ) devices. Purpose: This work aims to simulate nuclear resonances using quantum algorithms by developing a variational framework compatible with non-Hermitian Hamiltonians and implementing it fully on a quantum simulator. Methods: We employ the complex scaling technique to extract resonance positions classically and adapt it for quantum simulations using a two-step algorithm. First, we transform the non-Hermitian Hamiltonian into a Hermitian form by using the energy variance as a cost function within a variational framework. Second, we perform 𝜃-trajectory calculations to determine optimal resonance positions in the complex energy plane. To address resource constraints on NISQ devices, we utilize Gray code (GC) encoding to reduce qubit requirements. Results: We first validate our approach using a schematic potential model that mimics a nuclear potential, successfully reproducing known resonance energies with high fidelity. We then extend the method to a more realistic 𝛼−𝛼 nuclear potential and compute the 𝐷- and 𝐺-wave resonance energies with a basis size of 𝑁=16, using only four qubits. The quantum simulation results closely match the classical values, demonstrating the feasibility of our approach. Conclusions: This study demonstrates, for the first time, that the complete 𝜃-trajectory method can be implemented on a quantum computer without relying on any classical input beyond the Hamiltonian. The results establish a scalable and efficient quantum framework for simulating resonance phenomena in nuclear systems. This work represents a significant step toward quantum simulations of open quantum systems and lays the foundation for future investigations into resonance structures in nuclear, atomic, and molecular physics.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

The change in critical technologies for computational physics

It is noted that the types of technology required for computational physics are changing as the field matures. Emphasis has shifted from computer technology to algorithm technology and, finally, to visual analysis technology as areas of critical research for this field. High-performance graphical workstations tied to a supercommunicator with high-speed communications along with the development of especially tailored visualization software has enabled analysis of highly complex fluid-dynamics simulations. Particular reference is made here to the development of visual analysis tools at NASA's Numerical Aerodynamics Simulation Facility. The next technology which this field requires is one that would eliminate visual clutter by extracting key features of simulations of physics and technology in order to create displays that clearly portray these key features. Research in the tuning of visual displays to human cognitive abilities is proposed. The immediate transfer of technology to all levels of computers, specifically the inclusion of visualization primitives in basic software developments for all work stations and PCs, is recommended.

Watson, Val↗

Wavefront distortion correction in scanning tunneling microscope image

Here, we report an algorithm to identify and correct distorted wavefronts in atomic resolution scanning tunneling microscope images. This algorithm can be used to correct nonlinear in-plane distortions without prior knowledge of the physical scanning parameters, the characteristics of the piezoelectric actuator, or individual atom positions. The 2D image is first defined as a sum of sinusoidal plane waves, where a nonlinear distortion renders a curve for an otherwise ideal linear wavefront. Using the Fourier transforms of local areas of the image, the algorithm generates a wavefront vector field. The identified wavefronts are subsequently linearized for each plane wave without changing lattice orders, giving rise to distortion corrections. Our algorithm is complementary to conventional post-processing algorithms that require prior detection of real space features, which can also be used to correct nonlinear distortions in 2D images acquired by other microscopy techniques.

47 OTHER INSTRUMENTATION↗

Some numerical and physical aspects of unsteady Navier-Stokes computations over airfoils using dynamic meshes

An upwind-biased implicit approximate factorization algorithm is applied to several unsteady flows on dynamic meshes. The thin-layer form of the compressible Navier-Stokes equations is used to solve both laminar and turbulent flows over airfoils pitching about the quarter chord. Numerical aspects of the solutions are investigated, including grid and time step effects. Two methods for determining fluxes - flux-vector splitting and flux-difference splitting - are compared. Flux-difference splitting predicts results more accurately than flux-vector splitting on a coarse mesh, but both methods agree on a fine mesh. Physical aspects of the computations are also examined. An equilibrium turbulent boundary layer model computes generally better unsteady results in comparison with experiment than a nonequilibrium model for the transonic case analyzed. Also, the size and location of the primary shed vortex for an airfoil pitching up at a constant rate is calculated in good agreement with experiment for two pitch rates.

Rumsey, Christopher L.↗

Fast Quantum Algorithm for Predicting Descriptive Statistics of Stochastic Processes

Stochastic processes are used as a modeling tool in several sub-fields of physics, biology, and finance. Analytic understanding of the long term behavior of such processes is only tractable for very simple types of stochastic processes such as Markovian processes. However, in real world applications more complex stochastic processes often arise. In physics, the complicating factor might be nonlinearities; in biology it might be memory effects; and in finance is might be the non-random intentional behavior of participants in a market. In the absence of analytic insight, one is forced to understand these more complex stochastic processes via numerical simulation techniques. In this paper we present a quantum algorithm for performing such simulations. In particular, we show how a quantum algorithm can predict arbitrary descriptive statistics (moments) of N-step stochastic processes in just O(square root of N) time. That is, the quantum complexity is the square root of the classical complexity for performing such simulations. This is a significant speedup in comparison to the current state of the art.

Williams Colin P.↗

Physics-Informed Neural Network (PINN) Prediction of Mixed Mass-Heat-Crystallization Limited Methane Hydrate Formation and Dissociation in Micro-Confinement

The creation and use of Physics-Informed Neural Networks (PINNs) for simulating the dynamics of methane hydrate formation and dissociation will be presented. The PINN framework's main benefit is its capacity to impose physical consistency with only a partial comprehension of the governing equations. This makes the algorithm especially useful for systems with little experimental evidence or a lack of theoretical knowledge. A strong basis for forecasting methane hydrate behavior over the verified operating ranges of 30.0-80.9 bar pressure and 1.0-4.0 K sub-cooling conditions is provided by the combination of conductive heat transfer equations and mixed mass-transfer–crystallization kinetics. PINNs were more accurate at predicting the mixed mass-heat-crystallization limited kinetics than conventional Artificial Neural Networks (ANNs), demonstrating remarkable predictive accuracy for methane hydrate production over the ANN model. The efficiency of incorporating physical limitations from first principles into machine learning frameworks for methane hydrate crystallizations is reinforced by these findings. For hydrate-related applications in energy generation, carbon sequestration, and climate modelling, our study establishes PINNs as a computational tool that is both scalable and efficient. The proven capacity to close the gap between conventional physics-based simulations and solely data-driven models creates new opportunities for expedited hydrate research and practical applications.

Hartman, Ryan L [NYU Tandon School of Engineering]↗

A new finite element formulation for computational fluid dynamics. X - The compressible Euler and Navier-Stokes equations

A space-time element method is presented for solving the compressible Euler and Navier-Stokes equations. The proposed formulation includes the variational equation, predictor multi-corrector algorithms and boundary conditions. The variational equation is based on the time-discontinuous Galerkin method, in which the physical entropy variables are employed. A least-squares operator and a discontinuity-capturing operator are added, resulting in a high-order accurate and unconditionally stable method. Implicit/explicit predictor multi-corrector algorithms, applicable to steady as well as unsteady problems, are presented; techniques are developed to enhance their efficiency. Implementation of boundary conditions is addressed; in particular, a technique is introduced to satisfy nonlinear essential boundary conditions, and a consistent method is presented to calculate boundary fluxes. Numerical results are presented to demonstrate the performance of the method.

Shakib, Farzin↗

(abstract) 3D Electromagnetic Plasma Particle Simulations

A 3D electromagnetic plasma particle-in-cell code has been developed using the General Concurrent PIC algorithm. The GCPIC algorithm uses a domain decomposition to divide the computation among the processors. Particles must be exchanged between processors as they move. The efficiencies for 1-, 2-, and 3-dimensional partitions of the three dimensional domain are compared, and the algorithm is found to be very efficient even when a large fraction (e.g., 30%) of the particles must be exchanged at every time step. This PIC code has been used to perform simulations of a variety of space plasma physics problems. Results of three applications will be discussed: 1) plasma disturbances induced by moving conducting bodies in a magnetized plasma; 2) plasma plume interactions; and 3) solar wind termination shock.

electromagnetic plasma particles simulations 3D al↗

Neutrino interaction vertex reconstruction in DUNE with Pandora deep learning

The Pandora Software Development Kit and algorithm libraries perform reconstruction of neutrino interactions in liquid argon time projection chamber detectors. Pandora is the primary event reconstruction software used at the Deep Underground Neutrino Experiment, which will operate four large-scale liquid argon time projection chambers at the far detector site in South Dakota, producing high-resolution images of charged particles emerging from neutrino interactions. While these high-resolution images provide excellent opportunities for physics, the complex topologies require sophisticated pattern recognition capabilities to interpret signals from the detectors as physically meaningful objects that form the inputs to physics analyses. A critical component is the identification of the neutrino interaction vertex. Subsequent reconstruction algorithms use this location to identify the individual primary particles and ensure they each result in a separate reconstructed particle. A new vertex-finding procedure described in this article integrates a U-ResNet neural network performing hit-level classification into the multi-algorithm approach used by Pandora to identify the neutrino interaction vertex. The machine learning solution is seamlessly integrated into a chain of pattern-recognition algorithms. The technique substantially outperforms the previous BDT-based solution, with a more than 20% increase in the efficiency of sub-1 cm vertex reconstruction across all neutrino flavours.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Extension and validation of a method for locating damaged members in large space trusses

The damage location approach employs the control system capabilities for the structure to test the structure and measure the dynamic response. The measurements are then used in a system identification algorithm to produce a model of the damaged structure. The model is compared to one for the undamaged structure to find regions of reduced stiffness which indicate the location of damage. Kabe's 3,4 stiffness matrix adjustment method was the central identification algorithm. The strength of his method is that, with minimal data, it preserves the representation of the physical connectivity of the structure in the resulting model of the damaged truss. However, extensive storage and computational effort were required as a result. Extension of the damage location method to overcome these problems is the first part of the current work. The central system identification algorithm is replaced with the MSMT method of stiffness matrix adjustment which was previously derived by generalizing an optimal-update secant method form quasi-Newton approaches for nonlinear optimization. Validation of the extended damage location method is the second goal.

Smith, Suzanne Weaver↗

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↗