Search NASA⌕ Search

SEARCH · Search NASA

Results for “COMPUTING PROBLEMS”

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 145 records · Page 8

Summer Proceedings 2018: The Center for Computing Research at Sandia National Laboratories

The Center for Computing Research (CCR) at Sandia National Laboratories organizes an active and productive summer program each year, in coordination with the Computer Science Research Institute (CSRI) and Cyber Engineering Research Institute (CERI). CERI focuses on open, exploratory research in cyber security in partnership with academia, industry, and government, and provides collaborators an accessible portal to Sandia's cybersecurity experts and facilities. Moreover, CERI provides an environment for visionary, threat-informed research on national cyber challenges. CSRI brings university faculty and students to Sandia National Laboratories for focused collaborative research on DOE computer and computational science problems. CSRI provides a mechanism by which university researchers learn about problems in computer and computational science at DOE Laboratories. Participants conduct leading - edge research, interact with scientists and engineers at the laboratories, and help transfer the results of their research to programs at the labs.

97 MATHEMATICS AND COMPUTING↗

CSRI Summer Proceedings 2021

The Computer Science Research Institute (CSRI) brings university faculty and students to Sandia National Laboratories for focused collaborative research on Department of Energy (DOE) computer and computational science problems. The institute provides an opportunity for university researches to learn about problems in computer and computational science at DOE laboratories, and help transfer results of their research to programs at the labs. Some specific CSRI research interest areas are: scalable solvers, optimization, algebraic preconditioners, graph-based, discrete, and combinatorial algorithms, uncertainty estimation, validation and verification methods, mesh generation, dynamic load-balancing, virus and other malicious-code defense, visualization, scalable cluster computers, beyond Moore’s Law computing, exascale computing tools and application design, reduced order and multiscale modeling, parallel input/output, and theoretical computer science. The CSRI Summer Program is organized by CSRI and includes a weekly seminar series and the publication of a summer proceedings.

97 MATHEMATICS AND COMPUTING↗

CSRI Summer Proceedings 2021

The Computer Science Research Institute (CSRI) brings university faculty and students to Sandia National Laboratories for focused collaborative research on Department of Energy (DOE) computer and computational science problems. The institute provides an opportunity for university researches to learn about problems in computer and computational science at DOE laboratories, and help transfer results of their research to programs at the labs. Some specific CSRI research interest areas are: scalable solvers, optimization, algebraic preconditioners, graph-based, discrete, and combinatorial algorithms, uncertainty estimation, validation and verification methods, mesh generation, dynamic load-balancing, virus and other malicious-code defense, visualization, scalable cluster computers, beyond Moore’s Law computing, exascale computing tools and application design, reduced order and multiscale modeling, parallel input/output, and theoretical computer science. The CSRI Summer Program is organized by CSRI and includes a weekly seminar series and the publication of a summer proceedings.

97 MATHEMATICS AND COMPUTING↗

Recent advances in 3D SRF cavity-based quantum computing facility at the Fermilab SQMS Center

This talk will describe the most recent advances and progress in building an SRF cavity-based quantum computing facility at the Fermilab SQMS center. Several technical challenges had been successfully overcome to preserve the highest quality factors of SRF cavities in the presence of the sapphire chip holding the transmon qubit inside the cavity. The record values of the attained multicell cavity (2-cell, 9-cell)-qubit systems will be presented, as well as a variety of quantum operations realized with such systems, including the generation of large Fock states, coherent states, entangled mode-mode states etc. The quantum algorithms and computational problems being implemented on this 3D SQMS QPUs will be discussed as well.

Romanenko, Alexander [Fermilab]↗

Quantum simulation of real-space dynamics

Quantum simulation is a prominent application of quantum computers. While there is extensive previous work on simulating finite-dimensional systems, less is known about quantum algorithms for real-space dynamics. We conduct a systematic study of such algorithms. In particular, we show that the dynamics of a d-dimensional Schrödinger equation with η particles can be simulated with gate complexity O ~ (ηdFpoly(log(g'/ϵ))), where ϵ is the discretization error, g' controls the higher-order derivatives of the wave function, and F measures the time-integrated strength of the potential. Compared to the best previous results, this exponentially improves the dependence on ϵ and g' from poly(g'/ϵ) to poly(log(g'/ϵ)) and polynomially improves the dependence on T and d, while maintaining best known performance with respect to η. For the case of Coulomb interactions, we give an algorithm using η 3 (d + η)Tpoly(log(ηdTg'/(Δϵ)))/Δ one- and two-qubit gates, and another using η 3 (4d) d/2 Tpoly(log(ηdTg'/(Δϵ)))/Δ one- and two-qubit gates and QRAM operations, where T is the evolution time and the parameter Δ regulates the unbounded Coulomb interaction. We give applications to several computational problems, including faster real-space simulation of quantum chemistry, rigorous analysis of discretization error for simulation of a uniform electron gas, and a quadratic improvement to a quantum algorithm for escaping saddle points in nonconvex optimization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Systematic comparison of local approaches for isotopically nonstationary metabolic flux analysis

Quantification of reaction fluxes of metabolic networks can help us understand how the integration of different metabolic pathways determine cellular functions. Yet, intracellular fluxes cannot be measured directly but are estimated with metabolic flux analysis (MFA) that relies on the patterns of isotope labeling of metabolites in the network. For metabolic systems, typical for plants, where all potentially labeled atoms effectively have only one source atom pool, only isotopically nonstationary MFA can provide information about intracellular fluxes. There are several global approaches that implement MFA for an entire metabolic network and estimate, at once, a steady-state flux distribution for all reactions with identifiable fluxes in the network. In contrast, local approaches deal with estimation of fluxes for a subset of reactions, with smaller data demand for flux estimation. Here we present a systematic comparative review and benchmarking of the existing local approaches for isotopically nonstationary MFA. The comparison is conducted with respect to the required data and underlying computational problems solved on a synthetic network example. Furthermore, we benchmark the performance of these approaches in estimating fluxes for a subset of reactions using data obtained from the simulation of nitrogen fluxes in the Arabidopsis thaliana core metabolism. The findings pinpoint practical aspects that need to be considered when applying local approaches for flux estimation in large-scale plant metabolic networks.

59 BASIC BIOLOGICAL SCIENCES↗

Quantifying How Density Gradients and Front Curvature Affect Carbon Detonation Strength during SNe Ia

Accurately reproducing the physics behind the detonations of SNe Ia and the resultant nucleosynthetic yields is important for interpreting observations of spectra and remnants. The scales of the processes involved span orders of magnitudes, making the problem computationally impossible to ever fully resolve in full-star simulations in the present and near future. In the lower density regions of the star, the curvature of the detonation front will slow the detonation, affecting the production of intermediate mass elements. We find that shock strengthening due to the density gradient present in the outer layers of the progenitor is essential for understanding the nucleosynthesis there, with burning extending well below the density at which a steady-state detonation is extinct. We show that a complete reaction network is not sufficient to obtain physical detonations at high densities and modest resolution due to numerical mixing at the unresolved reaction front. At low densities, below 6 × 10 5 g cm -3 , it is possible to achieve high enough resolution to separate the shock and the reaction region, and the abundance structure predicted by fully resolved quasi-steady-state calculations is obtained. For our best current benchmark yields, we utilize a method in which the unresolved portion of Lagrangian histories are reconstructed based on fully resolved quasi-steady-state detonation calculations. These computations demonstrate that under-resolved simulations agree approximately, ~10% in post-shock values of temperature, pressure, density, and abundances, with expected detonation structures sufficiently far from the under-resolved region, but that there is still room for some improvement in the treatment of subgrid reactions in the hydrodynamics to before better than 1% can be achieved at all densities.

79 ASTRONOMY AND ASTROPHYSICS↗

Artificial Intelligence for Smart Transportation

There are more than 7,000 public transit agencies in the U.S. (and many more private agencies), and together, they are responsible for serving 60 billion passenger miles each year. A well-functioning transit system fosters the growth and expansion of businesses, distributes social and economic benefits, and links the capabilities of community members, thereby enhancing what they can accomplish as a society. Since affordable public transit services are the backbones of many communities, this work investigates ways in which Artificial Intelligence (AI) can improve efficiency and increase utilization from the perspective of transit agencies. This book chapter discusses the primary requirements, objectives, and challenges related to the design of AI-driven smart transportation systems. We focus on three major topics. First, we discuss data sources and data. Second, we provide an overview of how AI can aid decision-making with a focus on transportation. Lastly, we discuss computational problems in the transportation domain and AI approaches to these problems.

Wilbur, Michael↗

Supercomputer Assisted Generation of Machine Learning Agents for the Calibration of Building Energy Models

Building Energy Modeling (BEM) is an approach to model the energy usage in buildings for design and retrot pur- poses. EnergyPlus is the agship Department of Energy software that performs BEM for dierent types of buildings. The input to EnergyPlus can often extend in the order of a few thousand parameters which have to be calibrated manu- ally by an expert for realistic energy modeling. This makes it challenging and expensive thereby making building en- ergy modeling unfeasible for smaller projects. In this paper, we describe the \Autotune" research which employs machine learning algorithms to generate agents for the dierent kinds of standard reference buildings in the U.S. building stock. The parametric space and the variety of building locations and types make this a challenging computational problem necessitating the use of supercomputers. Millions of En- ergyPlus simulations are run on supercomputers which are subsequently used to train machine learning algorithms to generate agents. These agents, once created, can then run in a fraction of the time thereby allowing cost-eective cali- bration of building models.

autotune↗

Scientific Computing

Scientists, engineers and programmers at Fermilab are tackling today’s most challenging computational problems. Their solutions, motivated by the needs of worldwide research in particle physics and accelerators, help America stay at the forefront of innovation.

Fermilab↗

Scientific Computing

Scientists, engineers and programmers at Fermilab are tackling today’s most challenging computational problems. Their solutions, motivated by the needs of worldwide research in particle physics and accelerators, help America stay at the forefront of innovation.

Fermilab, Fermilab↗

Counting abelian squares efficiently for a problem in quantum computing

Here, I describe how the number of abelian squares of given length relates to a certain problem in theoretical quantum computing, and I present a recursive formula for calculating the number of abelian squares of length t+t over an alphabet of size d. The presented formula is similar to previously known formula but has substantially lower complexity for large d, a key improvement resulting in a practical solution to the original application.

97 MATHEMATICS AND COMPUTING↗

A Hybrid Approach for Solving Optimization Problems on Small Quantum Computers

Solving larger-sized problems is an important area of research in quantum computing. Designing hybrid quantum-classical algorithms is a promising approach to solving this. We discuss decomposition-based hybrid approaches for solving optimization problems and demonstrate them for applications related to community detection.

97 MATHEMATICS AND COMPUTING↗

Quantum computing based hybrid solution strategies for large-scale discrete-continuous optimization problems

Quantum computing (QC) has gained popularity due to its unique capabilities that are quite different from that of classical computers in terms of speed and methods of operations. This paper proposes hybrid models and methods that effectively leverage the complementary strengths of deterministic algorithms and QC techniques to overcome combinatorial complexity for solving large-scale mixed-integer programming problems. Four applications, namely the molecular conformation problem, job-shop scheduling problem, manufacturing cell formation problem, and the vehicle routing problem, are specifically addressed. Large-scale instances of these application problems across multiple scales ranging from molecular design to logistics optimization are computationally challenging for deterministic optimization algorithms on classical computers. To address the computational challenges, hybrid QC-based algorithms are proposed and extensive computational experimental results are presented to demonstrate their applicability and efficiency. The proposed QC-based solution strategies enjoy high computational efficiency in terms of solution quality and computation time, by utilizing the unique features of both classical and quantum computers.

97 MATHEMATICS AND COMPUTING↗

The reduced basis method for the electric field integral equation

We introduce the reduced basis method (RBM) as an efficient tool for parametrized scattering problems in computational electromagnetics for problems where field solutions are computed using a standard Boundary Element Method (BEM) for the parametrized electric field integral equation (EFIE). This combination enables an algorithmic cooperation which results in a two step procedure. The first step consists of a computationally intense assembling of the reduced basis, that needs to be effected only once. In the second step, we compute output functionals of the solution, such as the Radar Cross Section (RCS), independently of the dimension of the discretization space, for many different parameter values in a many-query context at very little cost. Parameters include the wavenumber, the angle of the incident plane wave and its polarization.

97 MATHEMATICS AND COMPUTING↗

Solving generalized eigenvalue problems by ordinary differential equations on a quantum computer

Many eigenvalue problems arising in practice are often of the generalized form A x = λ B x . One particularly important case is symmetric, namely A , B are Hermitian and B is positive definite. The standard algorithm for solving this class of eigenvalue problems is to reduce them to Hermitian eigenvalue problems. For a quantum computer, quantum phase estimation is a useful technique to solve Hermitian eigenvalue problems. In this work, we propose a new quantum algorithm for symmetric generalized eigenvalue problems using ordinary differential equations. The algorithm has lower complexity than the standard one based on quantum phase estimation. Moreover, it works for a wider case than symmetric: B is invertible, B - 1 A is diagonalizable and all the eigenvalues are real.

Science & Technology - Other Topics↗

Comparing quantum annealing and spiking neuromorphic computing for sampling binary sparse coding QUBO problems

We consider the problem of computing a sparse binary representation of an image. Given an image and an overcomplete, non-orthonormal basis, we aim to find a sparse binary vector indicating the minimal set of basis vectors that when added together best reconstruct the given input. We formulate this problem with an L 2 loss on the reconstruction error, and an L 0 loss on the binary vector enforcing sparsity. First, we solve the sparse representation QUBOs by solving them both on a D-Wave quantum annealer with Pegasus chip connectivity, as well as on the Intel Loihi 2 spiking neuromorphic processor using a stochastic Non-equilibrium Boltzmann Machine (NEBM). Second, using Quantum Evolution Monte Carlo with Reverse Annealing and iterated warm starting on Loihi 2 to evolve the solution quality from the respective machines. We demonstrate that both quantum annealing and neuromorphic computing are suitable for solving binary sparse coding QUBOs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗