Search NASA⌕ Search

SEARCH · Search NASA

Results for “Algorithms.”

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 1,315 records · Page 73

Future Response of Coastal Wetlands to Environmental Stresses: Algorithm Comparison of Numerical Models

Coastal wetlands are a critical component of the earth system that strongly influence the global water and biogeochemical cycles. They are also likely important sentinel of climate change. Because eco-geomorphological processes have long been recognized to be important for coastal wetland survival under accelerated sea-level rise (SLR), many eco-geomorphology models have been developed to assess the impact of climate change on coastal wetlands. Although these models differ substantially in complexity and numerical methods, few studies have investigated the algorithm-level uncertainties in these models. In this study, we developed a multiple-algorithm model framework of coastal wetlands that represents coastal hydrodynamics (such as water level, significant wave height and bottom shear stress) and four eco-geomorphological processes: mineral accretion, organic matter accretion, storm surge erosion and landward migration. We validated the model at three representative coastal wetland sites (Venice Lagoon, Plum Island Estuary and Hunter Estuary) for hydrodynamics, mineral accretion and organic matter accretion. Through model-data comparison, we showed that the model can well capture the dynamics of hydrodynamical and eco-geomorphological conditions in the study sites. Importantly, analysis of the multiple-algorithm simulations suggests that differences in the process representation of mineral and organic matter accretion may contribute to the recent contradicting predictions of coastal wetland evolution under accelerated SLR.

54 ENVIRONMENTAL SCIENCES↗

Cosmic Algorithms: Unveiling Mysteries of the Universe with Artificial Intelligence

In the boundless expanse of the cosmos lies a tapestry of mysteries waiting to be unraveled. In this talk, we delve into the realm of "Cosmic Algorithms," where the marriage of cutting-edge artificial intelligence (AI) and astrophysical inquiry paves the way for unprecedented discoveries. One of the foremost challenges we face in contemporary astrophysics is the staggering size and complexity of astronomical datasets. I will discuss how AI provides a transformative solution to these challenges, enabling us to efficiently sift through vast amounts of data to extract meaningful insights. Moreover, I will explore the fascinating realm of gravitationally lensed galaxies and merging galaxies, showcasing how AI algorithms play a pivotal role in identifying, characterizing, and understanding these phenomena. Today we stand at the threshold of unprecedented discovery, inspired by the boundless potential of Cosmic Algorithms to illuminate the darkest corners of space. The remarkable synergy between AI and astrophysics will continue to push the boundaries of human knowledge and open new roads to discovery.

79 ASTRONOMY AND ASTROPHYSICS↗

An Inverse Heat Conduction Algorithm Used to Calculate the Temperatures on the Inner and Outer Cylindrical Surfaces of an HMX-based PBX Explosive Annulus

In this work, a new Inverse Heat Conduction (IHC) algorithm is applied to estimate the surface temperatures at twelve locations on the inner and outer cylindrical boundaries of an HMX-based Plastic Bonded Explosive (PBX) annulus. This IHC algorithm was developed in references using a set of Direct Heat Conduction (DHC) solutions and a temperature correction method. The DHC solutions were calculated using a Galerkin based finite element (FE) method. This HMX based PBX annulus was used in the Large Scale Annular Cookoff (LSAC) experiment, Shot 5. The reason Shot 5 was chosen as a prototype mathematical model for this study is that the temperature was measured at eighteen locations in the midplane of the HMX-based PBX annulus. In addition, this annulus underwent an experimental thermal ignition and a deflagration that caused a thermal explosion and the disassembly of the experiment. The objective of this study is to describe how the application of the temperature correction algorithm produced the convergence of the DHC solutions to the measured temperatures at twelve internal locations in the midplane of the HMX-based PBX annulus.

36 MATERIALS SCIENCE↗

Variational Quantum Algorithms for Semidefinite Programming

A semidefinite program (SDP) is a particular kind of convex optimization problem with applications in operations research, combinatorial optimization, quantum information science, and beyond. In this work, we propose variational quantum algorithms for approximately solving SDPs. For one class of SDPs, we provide a rigorous analysis of their convergence to approximate locally optimal solutions, under the assumption that they are weakly constrained (i.e., N " M, where N is the dimension of the input matrices and M is the number of constraints). We also provide algorithms for a more general class of SDPs that requires fewer assumptions. Finally, we numerically simulate our quantum algorithms for applications such as MaxCut, and the results of these simulations provide evidence that convergence still occurs in noisy settings.

97 MATHEMATICS AND COMPUTING↗

Assessing Ground State Energy of Molecules and Energy Profile of the NH3 Capturing CO2 System Using the Quantum Computing Algorithms

Molecule size correlates with the number of electrons on electronic energies and strength of anharmonicity on vibrational properties, however, it is challenging to address using classical computing. In this study, variational quantum eigensolver (VQE) algorithm was implemented on a quantum simulator to quantify electronic and vibrational energies and reaction pathways of CO2 + NH3 = NH2COOH. The VQE-based Hartree-Fock-Embedding algorithm was adopted to benchmark electronic energies for a series of molecules (doi.org/10.1063/5.0188249) and quantify the reaction energy profile of the CO2 capture reaction (doi.org/10.1116/5.0137750). The generated reaction profile is in good agreement with the classical high-level Coupled-Cluster-Singles-and-Doubles (CCSD) results. The quantum computing algorithm also helps enhance the calculation of vibrational ground-state energies by considering the many-body coupling using the Vibrational Self-Consistent Field method, providing results for CO2 and NH3 molecules with accuracy comparable to the direct diagonalization method. Our approach indicates quantum computing can be applied to solve practical problems.

Lee, Yueh-Lin↗

Bringing randomized algorithms to mainstream numerical linear algebra

Numerical linear algebra (NLA) underpins huge swaths of computational science and engineering. For scientists and engineers to make the most of the DOE’s computing resources, it is essential that they have access to high-performance implementations of algorithms with best-in-class scalability and reliability. Despite this, prevailing NLA libraries have little to no support for breakthrough algorithms from the field of randomized numerical linear algebra (RandNLA) that have been developed over the past twenty years. The goal of this LDRD was to break a log-jam that had prevented broad adoption of RandNLA. Our work had two thrusts. The first was to develop RandBLAS: a trustworthy and high-performance C++ library for randomized dimension reduction (an operation widely known as sketching). The second was the development of a novel randomized algorithm for computing a challenging type of matrix decomposition known as Householder QR with column pivoting (Householder QRCP). In this one-year late-start LDRD we successfully delivered RandBLAS 1.0 and new CPU and GPU codes for Householder QRCP. RandBLAS has extensive documentation at https://randblas.readthedocs.io/en/stable/. Papers on RandBLAS and and our high-performance QRCP codes are forthcoming.

97 MATHEMATICS AND COMPUTING↗

Reconfigurable neuromorphic components and algorithms for next-generation artificial intelligence

Digital transistor-based general-purpose hardware (e.g., central processing units) is the dominant solution to support both traditional computing (logic, arithmetic, etc.) as well as modern artificial intelligence. State-of-the-art research has shown feasibility of post-digital physics-based neuromorphic hardware, which is hypothesized to support artificial intelligence algorithms with orders-of-magnitude improved time/energy efficiencies. But such research has not been widely deployed mainly because of such novel hardware’s extreme application-specificity, and the dominance of low-cost general-purpose (but inefficient) digital hardware. To make use of the novel algorithms and the superlative performance of physics-based hardware, we need to identify scientific principles that can enable generality in physics-based hardware. This work resulted in two important broad outcomes – first, we demonstrate fully reconfigurable neuromorphic components, and second, we demonstrate a viable artificial intelligence learning algorithm that can exploit the functioning of neuromorphic hardware. We demonstrate up to five orders of magnitude improvement in energy efficiency compared to the best general-purpose digital hardware.

97 MATHEMATICS AND COMPUTING↗

Projecting GeoVisipedia Annotations onto Satellite Imagey with the PRISM Algorithm

GeoVisipedia is a new and novel approach to sharing knowledge about complex geospatial configurations such as facilities. GeoVisipieda annotates objects in facilities with wiki pages. Annotations are projected to and from facility imagery using the PRISM algorithm. This report describes how the PRISM algorithm uses image metadata and a 3D facility model to perform annotation projection. The report concludes with an illustration of the efficacy of the PRISM algorithm in projecting an annotation onto a stack, and a demonstration of the effects of modeling error.

3D geospatial models↗

Quantum algorithms from fluctuation theorems: Thermal-state preparation

Fluctuation theorems provide a correspondence between properties of quantum systems in thermal equilibrium and a work distribution arising in a non-equilibrium process that connects two quantum systems with Hamiltonians H 0 and H 1 = H 0 + V. Building upon these theorems, we present a quantum algorithm to prepare a purification of the thermal state of H 1 at inverse temperature β ≥ 0 starting from a purification of the thermal state of H 0 . The complexity of the quantum algorithm, given by the number of uses of certain unitaries, is $\mathcal{O}$ (e β(ΔA - w l )/2 ), where ΔA is the free-energy difference between H 1 and H 0 , and w l is a work cutoff that depends on the properties of the work distribution and the approximation error ϵ > 0. If the non-equilibrium process is trivial, this complexity is exponential i β∥V∥, where ∥V∥ is the spectral norm of V. This represents a significant improvement of prior quantum algorithms that have complexity exponential in β∥H 1 ∥ in the regime where ∥V∥$\ll$ ∥H 1 ∥. The dependence of the complexity in ϵ varies according to the structure of the quantum systems. It can be exponential in 1/ϵ in general, but we show it to be sublinear in 1/ϵ if H 0 and H 1 commute, or polynomial in 1/ϵ if H 0 and H 1 are local spin systems. The possibility of applying a unitary that drives the system out of equilibrium allows one to increase the value of w l and improve the complexity even further. To this end, we analyze the complexity for preparing the thermal state of the transverse field Ising model using different non-equilibrium unitary processes and see significant complexity improvements.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Real-Time Krylov Theory for Quantum Computing Algorithms

Quantum computers provide new avenues to access ground and excited state properties of systems otherwise difficult to simulate on classical hardware. New approaches using subspaces generated by real-time evolution have shown efficiency in extracting eigenstate information, but the full capabilities of such approaches are still not understood. In recent work, we developed the variational quantum phase estimation (VQPE) method, a compact and efficient real-time algorithm to extract eigenvalues on quantum hardware. Here we build on that work by theoretically and numerically exploring a generalized Krylov scheme where the Krylov subspace is constructed through a parametrized real-time evolution, which applies to the VQPE algorithm as well as others. We establish an error bound that justifies the fast convergence of our spectral approximation. We also derive how the overlap with high energy eigenstates becomes suppressed from real-time subspace diagonalization and we visualize the process that shows the signature phase cancellations at specific eigenenergies. We investigate various algorithm implementations and consider performance when stochasticity is added to the target Hamiltonian in the form of spectral statistics. To demonstrate the practicality of such real-time evolution, we discuss its application to fundamental problems in quantum computation such as electronic structure predictions for strongly correlated systems.

97 MATHEMATICS AND COMPUTING↗

Encoding trade-offs and design toolkits in quantum algorithms for discrete optimization: coloring, routing, scheduling, and other problems

Challenging combinatorial optimization problems are ubiquitous in science and engineering. Several quantum methods for optimization have recently been developed, in different settings including both exact and approximate solvers. Addressing this field of research, this manuscript has three distinct purposes. First, we present an intuitive method for synthesizing and analyzing discrete (i.e., integer-based) optimization problems, wherein the problem and corresponding algorithmic primitives are expressed using a discrete quantum intermediate representation (DQIR) that is encoding-independent. This compact representation often allows for more efficient problem compilation, automated analyses of different encoding choices, easier interpretability, more complex runtime procedures, and richer programmability, as compared to previous approaches, which we demonstrate with a number of examples. Second, we perform numerical studies comparing several qubit encodings; the results exhibit a number of preliminary trends that help guide the choice of encoding for a particular set of hardware and a particular problem and algorithm. Our study includes problems related to graph coloring, the traveling salesperson problem, factory/machine scheduling, financial portfolio rebalancing, and integer linear programming. Third, we design low-depth graph-derived partial mixers (GDPMs) up to 16-level quantum variables, demonstrating that compact (binary) encodings are more amenable to QAOA than previously understood. We expect this toolkit of programming abstractions and low-level building blocks to aid in designing quantum algorithms for discrete combinatorial problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Variational Quantum Algorithms for Semidefinite Programming

A semidefinite program (SDP) is a particular kind of convex optimization problem with applications in operations research, combinatorial optimization, quantum information science, and beyond. In this work, we propose variational quantum algorithms for approximately solving SDPs. For one class of SDPs, we provide a rigorous analysis of their convergence to approximate locally optimal solutions, under the assumption that they are weakly constrained (i.e., N$\gg$M, where N is the dimension of the input matrices and M is the number of constraints). We also provide algorithms for a more general class of SDPs that requires fewer assumptions. Finally, we numerically simulate our quantum algorithms for applications such as MaxCut, and the results of these simulations provide evidence that convergence still occurs in noisy settings.

97 MATHEMATICS AND COMPUTING↗

HamLib: A library of Hamiltonians for benchmarking quantum algorithms and hardware

In order to characterize and benchmark computational hardware, software, and algorithms, it is essential to have many problem instances on-hand. This is no less true for quantum computation, where a large collection of real-world problem instances would allow for benchmarking studies that in turn help to improve both algorithms and hardware designs. To this end, here we present a large dataset of qubit-based quantum Hamiltonians. The dataset, called HamLib (for Hamiltonian Library), is freely available online and contains problem sizes ranging from 2 to 1000 qubits. HamLib includes problem instances of the Heisenberg model, Fermi-Hubbard model, Bose-Hubbard model, molecular electronic structure, molecular vibrational structure, MaxCut, Max- k -SAT, Max- k -Cut, QMaxCut, and the traveling salesperson problem. The goals of this effort are (a) to save researchers time by eliminating the need to prepare problem instances and map them to qubit representations, (b) to allow for more thorough tests of new algorithms and hardware, and (c) to allow for reproducibility and standardization across research studies.

97 MATHEMATICS AND COMPUTING↗

Well-Balanced, Conservative Finite Difference Algorithm for Atmospheric Flows

The numerical simulation of meso-, convective-, and microscale atmospheric flows requires the solution of the Euler or the Navier-Stokes equations. Nonhydrostatic weather prediction algorithms often solve the equations in terms of derived quantities such as Exner pressure and potential temperature (and are thus not conservative) and/or as perturbations to the hydrostatically balanced equilibrium state. This paper presents a well-balanced, conservative finite difference formulation for the Euler equations with a gravitational source term, where the governing equations are solved as conservation laws for mass, momentum, and energy. Preservation of the hydrostatic balance to machine precision by the discretized equations is essential because atmospheric phenomena are often small perturbations to this balance. The proposed algorithm uses the weighted essentially nonoscillatory and compact-reconstruction weighted essentially nonoscillatory schemes for spatial discretization that yields high-order accurate solutions for smooth flows and is essentially nonoscillatory across strong gradients; however, the well-balanced formulation may be used with other conservative finite difference methods. The performance of the algorithm is demonstrated on test problems as well as benchmark atmospheric flow problems, and the results are verified with those in the literature.

Ghosh, Debojyoti↗

Do Epistemic Uncertainties Allow for Replacing Microstructural Experiments with Reconstruction Algorithms?

A novel problem in computational materials modeling is addressed: “Are the computational microstructure reconstruction techniques reliable enough to replace experiments?” Here, “reliable” computations are associated with producing “expected” reconstructions that are adequately close to the experimental data. The output of computational techniques can deviate from the experimental measurements because of the epistemic uncertainties in the algorithms. In this work, an analytical formulation for quantification of epistemic uncertainties in a microstructure reconstruction algorithm based on Markov random field is presented. The method is used to predict the large-scale spatial distribution of a microstructure given an experimental input measured over a small spatial domain. However, small variations are observed on the microstructural features of the synthesized samples due to the Markov random field algorithm. The proposed analytical technique aims to quantify these uncertainties and estimate their propagation to the macroscale material properties to provide a significant understanding on how reliable it is to replace the experiments with the Markov random field model to predict microstructural maps over large spatial domains.

97 MATHEMATICS AND COMPUTING↗

Numerical Simulation of Shock-Turbulence Interactions Using High-Order Shock-Fitting Algorithms

High-order methods are critical for reliable numerical simulation of strong-shock and turbulence interaction problems. Such problems are not well understood due to limitations of numerical methods. Most widely used shock capturing methods for the numerical simulation of compressible flows are inherently dissipative, only first order accurate and may incur numerical oscillations near the shock waves. In our previous work [1, 2] we have shown that algorithms based on shock-fitting methodology can solve the flow with highorder accuracy near as well as away from the shocks without any numerical oscillations. In the current study, we extend the fifth order shock-fitting algorithm to carry out Direct Numerical Simulations (DNS) of interactions of shock waves with realistic isotropic turbulence. Incoming isotropic turbulence is developed in a temporal simulation of solenoidal fluctuations in a periodic box. Using Taylor’s hypothesis these fluctuations are prescribed upstream of the shock wave and the flow behind the shock wave is computed using the shock fitting algorithm. In this paper we investigate interactions of isotropic turbulence with normal shock waves of Mach numbers M1 2.0 10.0 and compare the results against numerical and Linear Interaction Analysis (LIA) results available in the literature. The results follow the trends observed in the previous studies which were only for the weak shocks. It is observed that velocity fluctuations are amplified across the shock wave and almost same amplification in turbulent kinetic energy observed for stronger than Mach 4 shocks. Transverse vorticity fluctuations are significantly increased across the shock and amplifications increase with increasing Mach number. Taylor microscales decrease as flow passes through a shock wave and amplification factor for transverse microscale agree well with the LIA results. Overall, the results generally confirm the findings by earlier numerical simulations and provide results for stronger shocks than those considered by numerical studies in the past. In future, higher Reynolds number flows will be considered with larger computer resources to avoid excessive viscous decay observed in the current study.

Rawat, Pradeep↗

CLUE: A Fast Parallel Clustering Algorithm for High Granularity Calorimeters in High-Energy Physics

One of the challenges of high granularity calorimeters, such as that to be built to cover the endcap region in the CMS Phase-2 Upgrade for HL-LHC, is that the large number of channels causes a surge in the computing load when clustering numerous digitized energy deposits (hits) in the reconstruction stage. In this article, we propose a fast and fully parallelizable density-based clustering algorithm, optimized for high-occupancy scenarios, where the number of clusters is much larger than the average number of hits in a cluster. The algorithm uses a grid spatial index for fast querying of neighbors and its timing scales linearly with the number of hits within the range considered. We also show a comparison of the performance on CPU and GPU implementations, demonstrating the power of algorithmic parallelization in the coming era of heterogeneous computing in high-energy physics.

Rovere, Marco↗