Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computer 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 847 records · Page 47
All sourcesNASA NTRSDOE OSTI
NASA NTRS1988

Fast computation of the multivariable stability margin for real interrelated uncertain parameters

A novel algorithm for computing the multivariable stability margin for checking the robust stability of feedback systems with real parametric uncertainty is proposed. This method eliminates the need for the frequency search involved in another given algorithm by reducing it to checking a finite number of conditions. These conditions have a special structure, which allows a significant improvement on the speed of computations.

Sideris, Athanasios↗
DOE OSTI2023

Collective neutrino oscillations on a quantum computer with hybrid quantum-classical algorithm

We simulate the time evolution of collective neutrino oscillations in two-flavor settings on a quantum computer. We explore the generalization of Trotter-Suzuki approximation to time-dependent Hamiltonian dynamics. The trotterization steps are further optimized using the Cartan decomposition of two-qubit unitary gates U ϵ SU(4) in the minimum number of controlled-NOT (CNOT) gates making the algorithm more resilient to the hardware noise. As a result, a more efficient hybrid quantum-classical algorithm is also explored to solve the problem on noisy intermediate-scale quantum devices.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Applications and Techniques for Fast Machine Learning in Science

In this community review report, we discuss applications and techniques for fast machine learning (ML) in science—the concept of integrating powerful ML methods into the real-time experimental data processing loop to accelerate scientific discovery. The material for the report builds on two workshops held by the Fast ML for Science community and covers three main areas: applications for fast ML across a number of scientific domains; techniques for training and implementing performant and resource-efficient ML algorithms; and computing architectures, platforms, and technologies for deploying these algorithms. We also present overlapping challenges across the multiple scientific domains where common solutions can be found. This community report is intended to give plenty of examples and inspiration for scientific discovery through integrated and accelerated ML solutions. This is followed by a high-level overview and organization of technical advances, including an abundance of pointers to source material, which can enable these breakthroughs.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
NASA NTRS1992

A proposed study of multiple scattering through clouds up to 1 THz

A rigorous computation of the electromagnetic field scattered from an atmospheric liquid water cloud is proposed. The recent development of a fast recursive algorithm (Chew algorithm) for computing the fields scattered from numerous scatterers now makes a rigorous computation feasible. A method is presented for adapting this algorithm to a general case where there are an extremely large number of scatterers. It is also proposed to extend a new binary PAM channel coding technique (El-Khamy coding) to multiple levels with non-square pulse shapes. The Chew algorithm can be used to compute the transfer function of a cloud channel. Then the transfer function can be used to design an optimum El-Khamy code. In principle, these concepts can be applied directly to the realistic case of a time-varying cloud (adaptive channel coding and adaptive equalization). A brief review is included of some preliminary work on cloud dispersive effects on digital communication signals and on cloud liquid water spectra and correlations.

Gerace, G. C.↗
DOE OSTI2020

Quantum Dynamics at Scale: Ultrafast Control of Emergent Functional Materials

Confluence of extreme-scale quantum dynamics simulations (i.e. quantum@scale) and cutting-edge x-ray free-electron laser experiments are revolutionizing materials science. An archetypal example is the exciting concept of using picosecond light pulses to control emergent material properties on demand in atomically-thin layered materials. This paper describes efforts to scale our quantum molecular dynamics engine toward the United States' first exaflop/s computer, under an Aurora Early Science Program project named "Metascalable layered material genome". Key algorithmic and computing techniques incorporated are: (1) globally-scalable and locally-fast solvers within a linear-scaling divide-conquer-recombine algorithmic framework; (2) algebraic `BLASification' of computational kernels; and (3) data alignment and loop restructuring, along with register and cache blocking, for enhanced vectorization and efficient memory access. The resulting weak-scaling parallel efficiency was 0.93 on 131,072 Intel Xeon Phi cores for a 56.6 million atom (or 169 million valence-electron) system, whereas the various code transformations achieved 5-fold speedup. The optimized simulation engine allowed us for the first time to establish a significant effect of substrate on the dynamics of layered material upon electronic excitation.

Algebraic BLASification↗
DOE OSTI2021

Impact of Numerical Hydrodynamics in Turbulent Mixing Transition Simulations

Underresolved simulations are unavoidable in high Reynolds (Re) and Mach (Ma) number turbulent flow applications at scale. Implicit large-Eddy simulation (ILES) often becomes the effective strategy to capture the dominating effects of convectively driven flow instabilities. We evaluate the impact of three distinct numerical strategies in simulations of transition and turbulence decay with ILES: the Harten–Lax–van Leer (HLL) Riemann solver applying Strang splitting and a Lagrange-plus-Remap formalism to solve the directional sweep—denoted split; the Harten–Lax–Van Leer-Contact (HLLC) Riemann solver using a directionally unsplit strategy and parabolic reconstruction—denoted unsplit; and the HLLC Riemann solver using unsplit and a low-Ma correction (LMC)—denoted unsplit*. Three case studies are considered: (1) a shock tube problem prototyping shock-driven turbulent mixing, (2) the Taylor–Green Vortex (TGV) prototyping transition to turbulence, and, (3) an homogeneous isotropic turbulence (HIT) case, focusing on the impact of discretization on transition and decay from fixed well-characterized initial conditions. Significantly more accurate predictions are provided by the unsplit schemes, in particular, when augmented with the LMC. For given resolution, only the unsplit schemes predict the turbulent mixing transition after reshock observed in the shock tube experiments. Relevant comparisons of ILES based on Euler and Navier–Stokes equations addressing potential occurrence of low-Re regimes in the applications are presented. Unsplit schemes are instrumental in allowing to capture the spatial development of the TGV flow and its validation at prescribed Re with significantly less resolution. HIT analysis confirms higher simulated turbulence Re and increased small-scale content associated with the unsplit discretizations.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2021

Ab initio molecular dynamics on quantum computers

Ab initio molecular dynamics (AIMD) is a valuable technique for studying molecules and materials at finite temperatures where the nuclei evolve on potential energy surfaces obtained from accurate electronic structure calculations. In this work, we present an approach to running AIMD simulations on noisy intermediate-scale quantum (NISQ)-era quantum computers. The electronic energies are calculated on a quantum computer using the variational quantum eigensolver (VQE) method. Algorithms for computation of analytical gradients entirely on a quantum computer require quantum fault-tolerant hardware, which is beyond NISQ-era. Therefore, we compute the energy gradients numerically using finite differences, the Hellmann-Feynman theorem, and a correlated sampling technique. This method only requires additional classical calculations of electron integrals for each degree of freedom without any additional computations on a quantum computer beyond the initial VQE run. As a proof of concept, AIMD simulations are demonstrated for the H-2 molecule on IBM quantum devices. In addition, we demonstrate the validity of the method for larger molecules using full configuration interaction wave functions. As quantum hardware and noise mitigation techniques continue to improve, the method can be utilized for studying larger molecular systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

Numerical evidence against advantage with quantum fidelity kernels on classical data

Quantum machine learning techniques are commonly considered one of the most promising candidates for demonstrating practical quantum advantage. In particular, quantum kernel methods have been demonstrated to be able to learn certain classically intractable functions efficiently if the kernel is well aligned with the target function. In the more general case, quantum kernels are known to suffer from exponential “flattening” of the spectrum as the number of qubits grows, preventing generalization and necessitating the control of the inductive bias by hyperparameters. We show that the general-purpose hyperparameter-tuning techniques proposed to improve the generalization of quantum kernels lead to the kernel becoming well approximated by a classical kernel, removing the possibility of quantum advantage. We provide extensive numerical evidence for this phenomenon utilizing multiple previously studied quantum feature maps and both synthetic and real data. Our results show that unless novel techniques are developed to control the inductive bias of quantum kernels, they are unlikely to provide a quantum advantage on classical data that lacks special structure.

Quantum Information, Science & Technology↗
DOE OSTI2024

Effects of noise on the overparametrization of quantum neural networks

Overparametrization is one of the most surprising and notorious phenomena in machine learning. Recently, there have been several efforts to study if, and how, quantum neural networks (QNNs) acting in the absence of hardware noise can be overparametrized. In particular, it has been proposed that a QNN can be defined as overparametrized if it has enough parameters to explore all available directions in state space. That is, if the rank of the quantum Fisher information matrix (QFIM) for the QNN's output state is saturated. Here, we explore how the presence of noise affects the overparametrization phenomenon. Our results show that noise can “turn on” previously zero eigenvalues of the QFIM. This enables the parametrized state to explore directions that were otherwise inaccessible, thus potentially turning an overparametrized QNN into an underparametrized one. For small noise levels, the QNN is quasioverparametrized, as large eigenvalues coexists with small ones. Then, we prove that as the magnitude of noise increases all the eigenvalues of the QFIM become exponentially suppressed, indicating that the state becomes insensitive to any change in the parameters. As such, there is a pull-and-tug effect where noise can enable new directions but also suppress the sensitivity to parameter updates. Finally, our results imply that current QNN capacity measures are ill-defined when hardware noise is present. Published by the American Physical Society 2024

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

ARMing the Edge: Designing Edge Computing–Capable Machine Learning Algorithms to Target ARM Doppler Lidar Processing

Abstract There is a need for long-term observations of cloud and precipitation fall speeds in validating and improving rainfall forecasts from climate models. To this end, the U.S. Department of Energy Atmospheric Radiation Measurement (ARM) user facility Southern Great Plains (SGP) site at Lamont, Oklahoma, hosts five ARM Doppler lidars that can measure cloud and aerosol properties. In particular, the ARM Doppler lidars record Doppler spectra that contain information about the fall speeds of cloud and precipitation particles. However, due to bandwidth and storage constraints, the Doppler spectra are not routinely stored. This calls for the automation of cloud and rain detection in ARM Doppler lidar data so that the spectral data in clouds can be selectively saved and further analyzed. During the ARMing the Edge field experiment, a Waggle node capable of performing machine learning applications in situ was deployed at the ARM SGP site for this purpose. In this paper, we develop and test four algorithms for the Waggle node to automatically classify ARM Doppler lidar data. We demonstrate that supervised learning using a ResNet50-based classifier will classify 97.6% of the clear-air images and 94.7% of cloudy images correctly, outperforming traditional peak detection methods. We also show that a convolutional autoencoder paired with k -means clustering identifies 10 clusters in the ARM Doppler lidar data. Three clusters correspond to mostly clear conditions with scattered high clouds, and seven others correspond to cloudy conditions with varying cloud-base heights.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2018

Regularized Finite Element Formulations for Shear Band Instabilities in Metals

In my research I have addressed several fundamental issues of dynamic fracture: 1. established the role of heat conduction as a natural regularizing mechanism in shearband problems (i.e. using the correct physics for this problem), 2. developed a unified model to incorporate fracture through a modified phase field formulation, 3. developed stability analysis tools to determine the onset of localization, 4. developed discretization methods and solvers to solve this problem (on parallel computers) that lead to mesh insensitive results and fast convergence. For such difficult problems, the physics and numerics are strongly coupled. To accurately model the physics, one must develop reliable numerics but reliable numerics depends on correct description of the physics. To this end, we have already made significant progress in the field showing that a fully-coupled implicit solution with heat conduction is the key to obtain reliable results for shear bands (see the next sections for more details). This research fits well within the mission of DOE ASCR program on all aspects: from governing equations to discretization to solvers to parallel computers to applications problems. It also relies on the computational tools developed through the SciDAC institutes FASTMath and SDAV, such as PETSc (and SLEPc), ParaView, Trilinos and Masquite.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1981

Numerical algorithms for finite element computations on arrays of microprocessors

The development of a multicolored successive over relaxation (SOR) program for the finite element machine is discussed. The multicolored SOR method uses a generalization of the classical Red/Black grid point ordering for the SOR method. These multicolored orderings have the advantage of allowing the SOR method to be implemented as a Jacobi method, which is ideal for arrays of processors, but still enjoy the greater rate of convergence of the SOR method. The program solves a general second order self adjoint elliptic problem on a square region with Dirichlet boundary conditions, discretized by quadratic elements on triangular regions. For this general problem and discretization, six colors are necessary for the multicolored method to operate efficiently. The specific problem that was solved using the six color program was Poisson's equation; for Poisson's equation, three colors are necessary but six may be used. In general, the number of colors needed is a function of the differential equation, the region and boundary conditions, and the particular finite element used for the discretization.

Ortega, J. M.↗
NASA NTRS1984

A new algorithm for tuning of computed radiances for HIRS2/MSU

Small biases of the order of 1 C exist in brightness temperatures computed for a number of atmospheric sounding channels using radiosonde reports of atmospheric temperature humidity profile compared to those of collocated HIRS2/MSU observations on TIROS N. These biases are attributed to errors in the computed atmospheric transmittances functions. Channel dependent empirical tuning coefficients were found such that the biases in the channel brightness temperatures are removed if the transmittances used to calculate these brightness temperatures are modified. Possible shortcomings of this method are that some of the bias errors may be due to instrumental calibration problems and that the part that is computational may not be of the form assumed in the equation used. Form of tuning was implemented in the calculation which has the potential of distinguishing between calibration and calculation errors and is also computationally faster and more easily vectorizable.

Susskind, J.↗