Search NASA⌕ Search

SEARCH · Search NASA

Results for “Mathematical and Computer Sciences (General)”

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 19 records

The Jump-Off Velocity of an Impulsively Loaded Spherical Shell

We consider a constant temperature spherical shell of isotropic, homogeneous, linearly elastic material with density ρ and Lamé coefficients λ and μ. The inner and outer radii of the shell are r i and r o , respectively. We assume that the inside of the shell is a void. On the outside of the shell, we apply a uniform, time-varying pressure p(t). We also assume that the shell is initially at rest. We want to compute the jump-off time and velocity of the pressure wave, which are the first time after t = 0 at which the pressure wave from the outer surface reaches the inner surface. This analysis computes the jump-off velocity and time for both compressible and incompressible materials. This differs substantially from [3], where only incompressible materials are considered. We will consider the behavior of an impulsively loaded, exponentially decaying pressure wave p(t) = P 0 e -αt , where α ≥ 0. We notice that a constant pressure wave P(t) = P 0 is a special case (α = 0) of a decaying pressure wave. Both of these boundary conditions are considered in [3].

36 MATERIALS SCIENCE↗

Memristive networks: From graph theory to statistical physics

In this work, we provide an introduction to a very specific toy model of memristive networks, for which an exact differential equation for the internal memory which contains the Kirchhoff laws is known. In particular, we highlight how the circuit topology enters the dynamics via an analysis of directed graph. We try to highlight in particular the connection between the asymptotic states of memristors and the Ising model, and the relation to the dynamics and statics of disordered systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA ESTO Advanced Information Systems Technology (AIST)

"(Only Talk/No Publication) NASA’s Advanced Information Systems Technology (AIST) Program identifies, develops, and supports adoption of software and information systems, as well as novel computer science technologies expected to be needed by the Earth Science Division in the 5-10-year timeframe. This presentation gives an overview of the AIST Program. AIST’s previous thrusts have been New Observing Strategies (NOS) and Analytic Collaborative Frameworks (ACF). The current vision is to connect these two thrusts and integrate them into the larger concept of Earth System Digital Twins (ESDT). To implement this new vision, the AIST Program is focusing on technologies and innovative concepts with three main objectives: O1. Enable new observation measurements and new observing systems design and operations through intelligent, timely, dynamic, and coordinated distributed sensing; O2. Enable agile science investigations that fully utilize the large amount of diverse observations using advanced analytic tools, visualizations, and computing environments, and that interact seamlessly with relevant observing systems; O3. Enable the development of integrated Earth Science frameworks that mirror the Earth with state-of-the-art models (Earth system models and others), timely and relevant observations, and analytic tools. This thrust will provide technology for enabling near- and long-term science and policy decisions (“science decisions” including planning for the acquisition of new measurements; the development of new models or science analysis; the integration of Earth observations in novel ways; applications to inform choices, support decisions, and guide actions for societal benefit; etc.)."

Mathematical and Computer Sciences (General)↗

Machine Learning for NASA Advanced Information Systems

NASA's Advanced Information Systems Technology (AIST) Program is one of several Technology programs managed by the Earth Science Technology Office (ESTO) in the Earth Science Division (ESD). The AIST Program focuses on advanced information systems and novel computer science technologies that will be needed by NASA Earth Science in the next 5 to 10 years. The three main thrusts of the AIST Program deal with Novel Observing Strategies (NOS), Analytic Collaborative Frameworks (ACF) and Earth System Digital Twins (ESDT). For all these thrusts, Machine Learning (ML) is increasingly being used in multiple aspects of Earth science systems, e.g., for onboard autonomy and decision making, for the analysis of massive and diverse datasets as well as more recently for developing surrogate models that will represent one of the main components of future Digital Twins of the Earth. Particularly, ESDT technologies developed by the AIST Program will allow to develop integrated Earth Science frameworks that will mirror the Earth with state-of-the-art models (Earth system models and others), timely and relevant observations, and analytic tools. These information systems will be used for supporting near- and long-term science and policy decisions. ESDT frameworks will build on previously developed AIST capabilities and technologies to integrate interconnected models with continuous streams of observations, data analytics, data assimilation, simulations, advanced visualizations and the ability to conduct "what-if" scenarios. This talk will describe the three thrusts of the AIST Program with a special focus on Machine Learning and how it is being used at all steps of the Earth Science data lifecycle.

Mathematical and Computer Sciences (General)↗

Arianna Wright Rosenbluth

Brief article discussing the contributions of Dr. Arianna Wright Rosenbluth to work done at Los Alamos and to computer science in general.

97 MATHEMATICS AND COMPUTING↗

MCMini: Monte Carlo on GPGPU

MCMini is a proof of concept that demonstrates the possibility for Monte Carlo neutron transport using OpenCL with a focus on performance. This implementation, written in C, shows that tracing particles and calculating reactions on a 3D mesh can be done in a highly scalable fashion. These results demonstrate a potential path forward for MCNP or other Monte Carlo codes.

97 MATHEMATICS AND COMPUTING↗

Exascale Monte Carlo R&D [Slides]

Overview of this presentation is (1) Exascale computing - different technologies, getting there; (2) high-performance proof-of-concept MCMini - features and results; and (3) OpenCL toolkit - Oatmeal (OpenCL Automatic Memory Allocation Library) - purpose and features. Despite driver issues, OpenCL seems like a good, hardware agnostic tool. MCMini demonstrates the possibility for GPGPU-based Monte Carlo methods - it shows great scaling for HPC application and algorithmic equivalence. Oatmeal provides a flexible framework to aid in the development of scientific OpenCL codes.

97 MATHEMATICS AND COMPUTING↗

Moab Job Priority (aka. Why is my Job not Running?) [Slides]

Why is a job not running is the most frequent Moab question we receive. 93%* of the time, the answer is, “because the cluster is busy” and the job has to wait its turn (*not really, but seems like it). Most users want to know why other jobs launched in front of their own, and a subset of those want to know what they can do about it.

97 MATHEMATICS AND COMPUTING↗

Quantum-centric supercomputing for materials science: A perspective on challenges and future directions

Computational models are an essential tool for the design, characterization, and discovery of novel materials. Computationally hard tasks in materials science stretch the limits of existing high-performance supercomputing centers, consuming much of their resources for simulation, analysis, and data processing. Quantum computing, on the other hand, is an emerging technology with the potential to accelerate many of the computational tasks needed for materials science. In order to do that, the quantum technology must interact with conventional high-performance computing in several ways: approximate results validation, identification of hard problems, and synergies in quantum-centric supercomputing. Here in this paper, we provide a perspective on how quantum-centric supercomputing can help address critical computational problems in materials science, the challenges to face in order to solve representative use cases, and new suggested directions.

36 MATERIALS SCIENCE↗

The Applied Mathematics for Power Systems (AMPS)

Increased deployment of new technologies, e.g., renewable generation and electric vehicles, is rapidly transforming electrical power networks by crossing previously distinct spatiotemporal scales and invalidating many traditional approaches for designing, analyzing, and operating power grids. This trend is expected to accelerate over the coming years, bringing the disruptive challenge of complexity, but also opportunities to deliver unprecedented efficiency and reliability. Our Applied Mathematics for Power Systems (AMPS) Center will discover, enable, and solve emerging mathematics challenges arising in power systems and, more generally, in complex engineered networks. We will develop foundational applied mathematics resulting in rigorous algorithms and simulation toolboxes for modern and future engineered networks. The AMPS Center deconstruction/reconstruction approach 'deconstructs' complex networks into sub-problems within non-separable spatiotemporal scales, a missing step in 20th century modeling of engineered networks. These sub-problems are addressed within the appropriate AMPS foundational pillar - complex systems, control theory, and optimization theory - and merged or 'reconstructed' at their boundaries into more general mathematical descriptions of complex engineered networks where important new questions are formulated and attacked. These two steps, iterated multiple times, will bridge the growing chasm between the legacy power grid and its future as a complex engineered network.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Towards large-scale quantum optimization solvers with few qubits

Quantum computers hold the promise of more efficient combinatorial optimization solvers, which could be game-changing for a broad range of applications. However, a bottleneck for materializing such advantages is that, in order to challenge classical algorithms in practice, mainstream approaches require a number of qubits prohibitively large for near-term hardware. Here we introduce a variational solver for MaxCut problems over $m={{\mathcal{O}}}({n}^{k})$ binary variables using only n qubits, with tunable k > 1. The number of parameters and circuit depth display mild linear and sublinear scalings in m , respectively. Moreover, we analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature. Altogether, this leads to high quantum-solver performances. For instance, for m = 7000, numerical simulations produce solutions competitive in quality with state-of-the-art classical solvers. In turn, for m = 2000, experiments with n = 17 trapped-ion qubits feature MaxCut approximation ratios estimated to be beyond the hardness threshold 0.941. Our findings offer an interesting heuristics for quantum-inspired solvers as well as a promising route towards solving commercially-relevant problems on near-term quantum devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum fluctuation theorem for error diagnostics in quantum annealers

Near term quantum hardware promises unprecedented computational advantage. Crucial in its development is the characterization and minimization of computational errors. We introduce the use of the quantum fluctuation theorem to benchmark the accuracy of quantum annealers. This versatile tool provides simple means to determine whether the quantum dynamics are unital, unitary, and adiabatic, or whether the system is prone to thermal noise. Our proposal is experimentally tested on two generations of the D-Wave machine, which illustrates the sensitivity of the fluctuation theorem to the smallest aberrations from ideal annealing. In addition, for the optimally operating D-Wave machine, our experiment provides the first experimental verification of the integral fluctuation in an interacting, many-body quantum system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum eigenvalue estimation via time series analysis

We present an efficient method for estimating the eigenvalues of a Hamiltonian H from the expectation values of the evolution operator for various times. For a given quantum state ρ, our method outputs a list of eigenvalue estimates and approximate probabilities. Each probability depends on the support of ρ in those eigenstates of H associated with eigenvalues within an arbitrarily small range. The complexity of our method is polynomial in the inverse of a given precision parameter ε, which is the gap between eigenvalue estimates. Unlike the well-known quantum phase estimation algorithm that uses the quantum Fourier transform, our method does not require large ancillary systems, large sequences of controlled operations, or preserving coherence between experiments, and is therefore more attractive for near-term applications. The output of our method can be used to estimate spectral properties of H and other expectation values efficiently, within additive error proportional to ε.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Entanglement spectroscopy with a depth-two quantum circuit

Noisy intermediate-scale quantum (NISQ) computers have gate errors and decoherence, limiting the depth of circuits that can be implemented on them. Here, a strategy for NISQ algorithms is to reduce the circuit depth at the expense of increasing the qubit count.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Earth observations and global change decision making: A special bibliography, 1991

The first section of the bibliography contains 294 bibliographic citations and abstracts of relevant reports, articles, and documents announced in 'Scientific and Technical Aerospace Reports (STAR)' and 'International Aerospace Abstracts (IAA)'. These abstracts are categorized by the following major subject divisions: aeronautics, astronautics, chemistry and materials, engineering, geosciences, life sciences, mathematical and computer sciences, physics, social sciences, space sciences and general. Following the abstract section, seven indexes are provided for further assistance.

Source record↗

NASA aerospace database subject scope: An overview

Outlined here is the subject scope of the NASA Aerospace Database, a publicly available subset of the NASA Scientific and Technical (STI) Database. Topics of interest to NASA are outlined and placed within the framework of the following broad aerospace subject categories: aeronautics, astronautics, chemistry and materials, engineering, geosciences, life sciences, mathematical and computer sciences, physics, social sciences, space sciences, and general. A brief discussion of the subject scope is given for each broad area, followed by a similar explanation of each of the narrower subject fields that follow. The subject category code is listed for each entry.

Source record↗