Search NASA⌕ Search

SEARCH · Search NASA

Results for “hybrid 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 613 records · Page 34

Optical modeling and electrical properties of cadmium oxide nanofilms: Developing a meta–heuristic calculation process model

Cadmium oxide thin films were deposited onto glass substrates by sol–gel dip-coating method and annealed in air. The normal incidence transmittance of the films was measured by a spectrophotometer. D.C electrical parameters such as carrier concentration and mobility were analyzed by Hall Effect measurements. A combination of Forouhi–Bloomer and standard Drude model was used to simulate the optical constants and thicknesses of the films from transmittance data. The transmittance spectra of the films in the visible domain of wavelengths were successfully fitted by using the result of a hybrid particle swarm optimization method and genetic algorithm. The simulated transmittance is in good accordance with the measured spectrum in the whole measurement wavelength range. The electrical parameters obtained from the optical simulation are well consistent with those measured electrically by Hall Effect measurements.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Measuring the Loschmidt Amplitude for Finite-Energy Properties of the Fermi-Hubbard Model on an Ion-Trap Quantum Computer

Calculating the equilibrium properties of condensed-matter systems is one of the promising applications of near-term quantum computing. Recently, hybrid quantum-classical time-series algorithms have been proposed to efficiently extract these properties from a measurement of the Loschmidt amplitude ⟨ ψ | e − i H ^ t | ψ ⟩ from initial states | ψ ⟩ and a time evolution under the Hamiltonian H ^ up to short times t . In this work, we study the operation of this algorithm on a present-day quantum computer. Specifically, we measure the Loschmidt amplitude for the Fermi-Hubbard model on a 16 -site ladder geometry (32 orbitals) on the Quantinuum H2-1 trapped-ion device. We assess the effect of noise on the Loschmidt amplitude and implement algorithm-specific error-mitigation techniques. By using a thus-motivated error model, we numerically analyze the influence of noise on the full operation of the quantum-classical algorithm by measuring expectation values of local observables at finite energies. Finally, we estimate the resources needed for scaling up the algorithm. Published by the American Physical Society 2024

Physics↗

A Summary of the UCLA HANE-Laser Experiment: 2011-2020

In the early years of this century, there was renewed interest at DTRA in artificial radiation belts, the dynamics of high altitude nuclear explosions that produced them, the development of large-scale kinetic plasma computer models at LLNL and LANL (particularly in the form of “hybrid” {i.e., particle ions, massless fluid electrons} algorithms), and the building of a laser facility at UCLA, under the direction of Prof. Niemann, which was connected to the Large Plasma Device (LAPD), a DOE user facility. These advances sparked the idea for a new laser experimental program to examine early-time HANE issues, reviving the concept from a former program at NRL in the 90’s. The basic motivation for this new effort can be traced back to the first DTRA artificial radiation belt workshop at Stanford in 2009. Subsequent discussions then led to a formal proposal from UCLA that was submitted to DTRA (Grant Jones) in 2010, vigorously reviewed, and finally approved in 2011, with funding begun in 2012. An historical perspective of this development process was presented at a DTRA review last year. In this document we review and summarize the major achievements of the DTRA-sponsored UCLA HANE-laser experiment over the past eight years. Our purpose is to briefly describe the major achievements of this program, as documented in the included extensive list of journal publications [which does not include all the publications nor any of the many invited and contributed presentations of the UCLA group], the role of the national laboratories in this effort, and how this work has impacted (and will continue to improve) our understanding of high altitude nuclear events.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Microstructural Origins of Nonlinear Response in Associating Polymers under Oscillatory Shear

The response of associating polymers with oscillatory shear is studied through large-scale simulations. A hybrid molecular dynamics (MD), Monte Carlo (MC) algorithm is employed. Polymer chains are modeled as a coarse-grained bead-spring system. Functionalized end groups, at both ends of the polymer chains, can form reversible bonds according to MC rules. Stress-strain curves show nonlinearities indicated by a non-ellipsoidal shape. We consider two types of nonlinearities. Type I occurs at a strain amplitude much larger than one, type II at a frequency at which the elastic storage modulus dominates the viscous loss modulus. In this last case, the network topology resembles that of the system at rest. The reversible bonds are broken and chains stretch when the system moves away from the zero-strain position. For type I, the chains relax and the number of reversible bonds peaks when the system is near an extreme of the motion. During the movement to the other extreme of the cycle, first a stress overshoot occurs, then a yield accompanied by shear-banding. Lastly, the network restructures. Interestingly, the system periodically restores bonds between the same associating groups. Even though major restructuring occurs, the system remembers previous network topologies.

36 MATERIALS SCIENCE↗

Time-dependent finite-difference simulation of unsteady interactive flows

The solution of the time-dependent, Reynolds-averaged, Navier-Stokes equations for unsteady, interacting flows by finite-difference algorithms is discussed. Specific examples include (1) unsteady transonic flow over a thick biconvex airfoil, (2) determination of buffet boundaries for a transonic lifting airfoil, (3) the simulation of aileron buzz and (4) dynamic stall. Algorithms considered include explicit methods, mixed (or hybrid) methods, and fully implicit methods. Consideration of time scales for computational stability, computational accuracy, and physical accuracy and the use of time-dependent adaptive meshing to realize computational efficiency are also discussed.

Deiwert, G. S.↗

Software reliability through fault-avoidance and fault-tolerance

Twenty independently developed but functionally equivalent software versions were used to investigate and compare empirically some properties of N-version programming, Recovery Block, and Consensus Recovery Block, using the majority and consensus voting algorithms. This was also compared with another hybrid fault-tolerant scheme called Acceptance Voting, using dynamic versions of consensus and majority voting. Consensus voting provides adaptation of the voting strategy to varying component reliability, failure correlation, and output space characteristics. Since failure correlation among versions effectively reduces the cardinality of the space in which the voter make decisions, consensus voting is usually preferable to simple majority voting in any fault-tolerant system. When versions have considerably different reliabilities, the version with the best reliability will perform better than any of the fault-tolerant techniques.

Vouk, Mladen A.↗

Aerocapture Guidance Performance for the Neptune Orbiter

A performance evaluation of the Hybrid Predictor corrector Aerocapture Scheme (HYPAS) guidance algorithm for aerocapture at Neptune is presented in this paper for a Mission to Neptune and the Neptune moon Triton'. This mission has several challenges not experienced in previous aerocapture guidance assessments. These challengers are a very high Neptune arrival speed, atmospheric exit into a high energy orbit about Neptune, and a very high ballistic coefficient that results in a low altitude acceleration capability when combined with the aeroshell LD. The evaluation includes a definition of the entry corridor, a comparison to the theoretical optimum performance, and guidance responses to variations in atmospheric density, aerodynamic coefficients and flight path angle for various vehicle configurations (ballistic numbers). The benefits of utilizing angle-of-attack modulation in addition to bank angle modulation to improve flight performance is also discussed. The results show that despite large sensitivities in apoapsis targeting, the algorithm performs within the allocated AV budget for the Neptune mission bank angle only modulation. The addition of angle-of-attack modulation with as little as 5 degrees of amplitude significantly improves the scatter in final orbit apoapsis. Although the angle-of-attack modulation complicates the vehicle design, the performance enhancement reduces aerocapture risk and reduces the propellant consumption needed to reach the high energy target orbit for a conventional propulsion system.

Masciarelli, James P.↗

Partition-based Feasible Integer Solution Pre-computation for Hybrid Model Predictive Control

For multiparametric mixed-integer convex programming problems such as those encountered in hybrid model predictive control, we propose an algorithm for generating a feasible partition of a subset of the parameter space. The result is a static map from the current parameter to a suboptimal integer solution such that the remaining convex program is feasible. Convergence is proved with a new insight that the overlap among the feasible parameter sets of each integer solution governs the partition complexity. The partition is stored as a tree which makes querying the feasible solution efficient. The algorithm can be used to warm start a mixed integer solver with a real-time guarantee or to provide a reference integer solution in several suboptimal MPC schemes. The algorithm is tested on randomly generated systems with up to six states, demonstrating the effectiveness of the approach.

Bayard, David S.↗

PNNL pushing scientific discovery through data intensive computing breakthroughs

The Pacific Northwest National Laboratory's approach to data intensive computing (DIC) is focused on three key research areas: hybrid hardware architectures, software architectures, and analytic algorithms. Advancements in these areas will help to address, and solve, DIC issues associated with capturing, managing, analyzing and understanding, in near real time, data at volumes and rates that push the frontiers of current technologies.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

PNNLs Data Intensive Computing research battles Homeland Security threats

The Pacific Northwest National Laboratorys (PNNL's) approach to data intensive computing (DIC) is focused on three key research areas: hybrid hardware architecture, software architectures, and analytic algorithms. Advancements in these areas will help to address, and solve, DIC issues associated with capturing, managing, analyzing and understanding, in near real time, data at volumes and rates that push the frontiers of current technologies.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Hybrid Parallelism for Volume Rendering on Large, Multi-core Systems

This work studies the performance and scalability characteristics of"hybrid'"parallel programming and execution as applied to raycasting volume rendering -- a staple visualization algorithm -- on a large, multi-core platform. Historically, the Message Passing Interface (MPI) has become the de-facto standard for parallel programming and execution on modern parallel systems. As the computing industry trends towards multi-core processors, with four- and six-core chips common today and 128-core chips coming soon, we wish to better understand how algorithmic and parallel programming choices impact performance and scalability on large, distributed-memory multi-core systems. Our findings indicate that the hybrid-parallel implementation, at levels of concurrency ranging from 1,728 to 216,000, performs better, uses a smaller absolute memory footprint, and consumes less communication bandwidth than the traditional, MPI-only implementation.

97 MATHEMATICS AND COMPUTING↗

Hybrid Parallelism for Volume Rendering on Large, Multi-core Systems

This work studies the performance and scalability characteristics of"hybrid" parallel programming and execution as applied to raycasting volume rendering -- a staple visualization algorithm -- on a large, multi-core platform. Historically, the Message Passing Interface (MPI) has become the de-facto standard for parallel programming and execution on modern parallel systems. As the computing industry trends towards multi-core processors, with four- and six-core chips common today and 128-core chips coming soon, we wish to better understand how algorithmic and parallel programming choices impact performance and scalability on large, distributed-memory multi-core systems. Our findings indicate that the hybrid-parallel implementation, at levels of concurrency ranging from 1,728 to 216,000, performs better, uses a smaller absolute memory footprint, and consumes less communication bandwidth than the traditional, MPI-only implementation.

97 MATHEMATICS AND COMPUTING↗

Non-preconditioned conjugate gradient on cell and FPGA based hybrid supercomputer nodes

This work presents a detailed implementation of a double precision, non-preconditioned, Conjugate Gradient algorithm on a Roadrunner heterogeneous supercomputer node. These nodes utilize the Cell Broadband Engine Architecture{sup TM} in conjunction with x86 Opteron{sup TM} processors from AMD. We implement a common Conjugate Gradient algorithm, on a variety of systems, to compare and contrast performance. Implementation results are presented for the Roadrunner hybrid supercomputer, SRC Computers, Inc. MAPStation SRC-6 FPGA enhanced hybrid supercomputer, and AMD Opteron only. In all hybrid implementations wall clock time is measured, including all transfer overhead and compute timings.

99 GENERAL AND MISCELLANEOUS↗

Non-preconditioned conjugate gradient on cell and FPCA-based hybrid supercomputer nodes

This work presents a detailed implementation of a double precision, Non-Preconditioned, Conjugate Gradient algorithm on a Roadrunner heterogeneous supercomputer node. These nodes utilize the Cell Broadband Engine Architecture{trademark} in conjunction with x86 Opteron{trademark} processors from AMD. We implement a common Conjugate Gradient algorithm, on a variety of systems, to compare and contrast performance. Implementation results are presented for the Roadrunner hybrid supercomputer, SRC Computers, Inc. MAPStation SRC-6 FPGA enhanced hybrid supercomputer, and AMD Opteron only. In all hybrid implementations wall clock time is measured, including all transfer overhead and compute timings.

97 MATHEMATICS AND COMPUTING↗

Implementing Molecular Dynamics for Hybrid High Performance Computers - 1. Short Range Forces

The use of accelerators such as general-purpose graphics processing units (GPGPUs) have become popular in scientific computing applications due to their low cost, impressive floating-point capabilities, high memory bandwidth, and low electrical power requirements. Hybrid high performance computers, machines with more than one type of floating-point processor, are now becoming more prevalent due to these advantages. In this work, we discuss several important issues in porting a large molecular dynamics code for use on parallel hybrid machines - 1) choosing a hybrid parallel decomposition that works on central processing units (CPUs) with distributed memory and accelerator cores with shared memory, 2) minimizing the amount of code that must be ported for efficient acceleration, 3) utilizing the available processing power from both many-core CPUs and accelerators, and 4) choosing a programming model for acceleration. We present our solution to each of these issues for short-range force calculation in the molecular dynamics package LAMMPS. We describe algorithms for efficient short range force calculation on hybrid high performance machines. We describe a new approach for dynamic load balancing of work between CPU and accelerator cores. We describe the Geryon library that allows a single code to compile with both CUDA and OpenCL for use on a variety of accelerators. Finally, we present results on a parallel test cluster containing 32 Fermi GPGPUs and 180 CPU cores.

43 PARTICLE ACCELERATORS↗

Parallel peak pruning for scalable SMP contour tree computation

As data sets grow to exascale, automated data analysis and visualisation are increasingly important, to intermediate human understanding and to reduce demands on disk storage via in situ analysis. Trends in architecture of high performance computing systems necessitate analysis algorithms to make effective use of combinations of massively multicore and distributed systems. One of the principal analytic tools is the contour tree, which analyses relationships between contours to identify features of more than local importance. Unfortunately, the predominant algorithms for computing the contour tree are explicitly serial, and founded on serial metaphors, which has limited the scalability of this form of analysis. While there is some work on distributed contour tree computation, and separately on hybrid GPU-CPU computation, there is no efficient algorithm with strong formal guarantees on performance allied with fast practical performance. Here in this paper, we report the first shared SMP algorithm for fully parallel contour tree computation, withfor-mal guarantees of O(lgnlgt) parallel steps and O(n lgn) work, and implementations with up to 10x parallel speed up in OpenMP and up to 50x speed up in NVIDIA Thrust.

97 MATHEMATICS AND COMPUTING↗

Scalable Contour Tree Computation by Data Parallel Peak Pruning

As data sets grow to exascale, automated data analysis and visualization are increasingly important, to intermediate human understanding and to reduce demands on disk storage via in situ analysis. Trends in architecture of high performance computing systems necessitate analysis algorithms to make effective use of combinations of massively multicore and distributed systems. One of the principal analytic tools is the contour tree, which analyses relationships between contours to identify features of more than local importance. Unfortunately, the predominant algorithms for computing the contour tree are explicitly serial, and founded on serial metaphors, which has limited the scalability of this form of analysis. While there is some work on distributed contour tree computation, and separately on hybrid GPU-CPU computation, there is no efficient algorithm with strong formal guarantees on performance allied with fast practical performance. Furthermore, we report the first shared SMP algorithm for fully parallel contour tree computation, with formal guarantees of O(lg V lg t) parallel steps and O(V lg V) work for data with V samples and t contour tree supernodes, and implementations with more than 30× parallel speed up on both CPU using TBB and GPU using Thrust and up 70× speed up compared to the serial sweep and merge algorithm.

97 MATHEMATICS AND COMPUTING↗