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 127 records · Page 7

ShiftNMFk 1.2

The ShiftNMFk1.2 code, or as we call it, GreenNMFk, represents a hybrid algorithm combining unsupervised adaptive machine learning and Green's function inverse method. GreenNMFk allows an efficient and high performance de-mixing and feature extraction of a multitude of nonnegative signals that change their shape propagating through the medium. The signals are mixed and recorded by a network of uncorrelated sensors. The code couples Non-negative Matrix Factorization (NMF) and inverse-analysis Green's functions method. GreenNMF synergistically performs decomposition of the recorded mixtures, finds the number of the unknown sources and uses the Green's function of the governing partial differential equation to identify the unknown sources and their charecteristics. GreenNMF can be applied directly to any problem controlled by a known partial-differential parabolic equation where mixtures of an unknown number of sources are measured at multiple locations. Full GreenNMFk method is a subject LANL U.S. Patent application S133364.000 August, 2017. The ShiftNMFk 1.2 version here is a toy version of this method that can work with a limited number of unknown sources (4 or less).

Alexandrov, BoianS.↗

HOPSPACK: Hybrid Optimization Parallel Search Package

In this paper, we describe the technical details of HOPSPACK (Hybrid Optimization Parallel Search Package), a new software platform which facilitates combining multiple optimization routines into a single, tightly-coupled, hybrid algorithm that supports parallel function evaluations. The framework is designed such that existing optimization source code can be easily incorporated with minimal code modification. By maintaining the integrity of each individual solver, the strengths and code sophistication of the original optimization package are retained and exploited.

Gray, Genetha Anne↗

A fast computation of complex convolution using a hybrid transform

The cyclic convolution of complex values was obtained by a hybrid transform that is a combination of a Winograd transform and a fast complex integer transform. This new hybrid algorithm requires fewer multiplications than any previously known algorithm.

Reed, I. S.↗

An implicit flux-difference splitting scheme for three-dimensional, incompressible Navier-Stokes solutions to leading edge vortex flows

A new, implicit finite-difference scheme designed to solve the conservative, flux-difference split Navier-Stokes equations is used to compute incompressible vortex flows around delta wings. The completely vectorizable hybrid algorithm is constructed in delta form for steady state solutions independent of the time-step sizes. The scheme combines approximate factorization in crossflow planes with a symmetric planar Gauss-Seidel relaxation in the remaining spatial direction. The governing equations are solved in curvilinear, body-fitted coordinates for treating complex geometries. The computed flow field results are compared with other theoretical and experimental data.

Hartwich, P.-M.↗

Implicit hybrid schemes for the flux-difference split, three-dimensional Navier-Stokes equations

Implicit hybrid algorithms employing symmetric planar Gauss-Seidel (SPGS) relaxation and either block-tridiagonally structured coefficient matrices (AF-SPGS) or block-triangular coefficient matrices (LU-SPGS) are derived to solve the flux-difference-split Navier-Stokes equations for three-dimensional incompressible flow in an upwind scheme. The physical basis of the approach is discussed, and results for problems involving vortex flow around a thin delta wing at Reynolds numbers 900,000 and 10,000 are presented graphically. It is found that AF-SPGS converges faster on vector computers which depend on long vector lengths to achieve optimum performance, whereas LU-SPGS is preferable on sequentially operating machines and vector computers using shorter vector lengths.

Hartwich, P.-M.↗

The effect of Mach number on the stability of a plane supersonic wave

The influence of compressibility on the mechanisms governing the various stages of transition in a supersonic wake is investigated. Results from linear stability theory are used to provide physical insights into the observed reduction in growth rate at high Mach numbers. A newly developed hybrid algorithm is used to solve the compressible inviscid linear disturbance equations. Growth rates for both antisymmetric and symmetric modes of two-dimensional and oblique waves are computed for a wide range of Mach numbers. Results from two and three-dimensional direct numerical simulations of a forced compressible time-developing wake are presented in order to understand the nonlinear stages of transition at high Mach numbers. Observed nonlinear growth rate comparisons are made for wakes at two different Mach numbers. The reduction in growth rate at high Mach numbers is explained by examining contour plots of baroclinic torques and the product of dilatation and vorticity.

Chen, Jacqueline H.↗

Numerical Studies of Collisionless Current Layers

The purpose of this proposal was to investigate collisionless current layers using a variety of analytic and numerical tools. The first year of the contract was dedicated to analytical studies, to the porting and adaption of codes being used in this study, and to the numerical simulation of collisionless current layers. The second year entailed the development of multi-dimensional hybrid algorithms as well as the re-examination of the problem of integro-differential equations that occur in the linear stage of plasma instabilities.

Quest, Kevin B.↗

The analysis of control trajectories using symbolic and database computing

This final report comprises the formal semi-annual status reports for this grant for the periods June 30-December 31, 1993, January 1-June 30, 1994, and June 1-December 31, 1994. The research supported by this grant is broadly concerned with the symbolic computation, mixed numeric-symbolic computation, and database computation of trajectories of dynamical systems, especially control systems. A review of work during the report period covers: trajectories and approximating series, the Cayley algebra of trees, actions of differential operators, geometrically stable integration algorithms, hybrid systems, trajectory stores, PTool, and other activities. A list of publications written during the report period is attached.

Grossman, Robert↗

The Development of the Puerto Rico Lightning Detection Network for Meteorological Research

A land-based Puerto Rico Lightning Detection Network (PR-LDN) dedicated to the academic research of meteorological phenomena has being developed. Five Boltek StormTracker PCI-Receivers with LTS-2 Timestamp Cards with GPS and lightning detectors were integrated to Pentium III PC-workstations running the CentOS linux operating system. The Boltek detector linux driver was compiled under CentOS, modified, and thoroughly tested. These PC-workstations with integrated lightning detectors were installed at five of the University of Puerto Rico (UPR) campuses distributed around the island of PR. The PC-workstations are left on permanently in order to monitor lightning activity at all times. Each is networked to their campus network-backbone permitting quasi-instantaneous data transfer to a central server at the UPR-Bayam n campus. Information generated by each lightning detector is managed by a C-program developed by us called the LDN-client. The LDN-client maintains an open connection to the central server operating the LDN-server program where data is sent real-time for analysis and archival. The LDN-client also manages the storing of data on the PC-workstation hard disk. The LDN-server software (also an in-house effort) analyses the data from each client and performs event triangulations. Time-of-arrival (TOA) and related hybrid algorithms, lightning-type and event discriminating routines are also implemented in the LDN-server software. We also have developed software to visually monitor lightning events in real-time from all clients and the triangulated events. We are currently monitoring and studying the spatial, temporal, and type distribution of lightning strikes associated with electrical storms and tropical cyclones in the vicinity of Puerto Rico.

Legault, Marc D.↗

Second-Generation Six-Limbed Experimental Robot

The figure shows the LEMUR II - the second generation of the Limbed Excursion Mechanical Utility Robot (LEMUR), which was described in "Six-Legged Experimental Robot" (NPO-20897), NASA Tech Briefs, Vol. 25, No. 12 (December 2001), page 58. The LEMUR II incorporates a number of improvements, including new features, that extend its capabilities beyond those of its predecessor, which is now denoted the LEMUR I. To recapitulate: the LEMUR I was a six-limbed robot for demonstrating robotic capabilities for assembly, maintenance, and inspection. The LEMUR I was designed to be capable of walking autonomously along a truss structure toward a mechanical assembly at a prescribed location and to perform other operations. The LEMUR I was equipped with stereoscopic video cameras and image-data-processing circuitry for navigation and mechanical operations. It was also equipped with a wireless modem, through which it could be commanded remotely. Upon arrival at a mechanical assembly, the LEMUR I would perform simple mechanical operations with one or both of its front limbs. It could also transmit images to a host computer. Each of the six limbs of the LEMUR I was operated independently. Each of the four rear limbs had three degrees of freedom (DOFs), while each of the front two limbs had four DOFs. The front two limbs were designed to hold, operate, and/or be integrated with tools. The LEMUR I included an onboard computer equipped with an assortment of digital control circuits, digital input/output circuits, analog-to-digital converters for input, and digital-to-analog (D/A) converters for output. Feedback from optical encoders in the limb actuators was utilized for closed-loop microcomputer control of the positions and velocities of the actuators. The LEMUR II incorporates the following improvements over the LEMUR I: a) The drive trains for the joints of the LEMUR II are more sophisticated, providing greater torque and accuracy. b) The six limbs are arranged symmetrically about a hexagonal body platform instead of in straight lines along the sides. This symmetrical arrangement is more conducive to omnidirectional movement in a plane. c) The number of degrees of freedom of each of the rear four limbs has been increased by one. Now, every limb has four degrees of freedom: three at the hip (or shoulder, depending on one s perspective) and one at the knee (or elbow, depending on one s perspective). d) Now every limb (instead of only the two front limbs) can perform operations. For this purpose, each limb is tipped with an improved quick-release mechanism for swapping of end-effector tools. e) New end-effector tools have been developed. These include an instrumented rotary driver that accepts all tool bits that have 0.125-in. (3.175-mm)-diameter shanks, a charge-coupled-device video camera, a super bright light-emitting diode for illuminating the work area of the robot, and a generic collet tool that can be quickly and inexpensively modified to accept any cylindrical object up to 0.5 in. (12.7 mm) in diameter. f) The stereoscopic cameras are mounted on a carriage that moves along a circular track, thereby providing for omnidirectional machine vision. g) The control software has been augmented with software that implements innovations reported in two prior NASA Tech Briefs articles: the HIPS algorithm ["Hybrid Image-Plane/Stereo Manipulation" (NPO-30492), Vol. 28, No. 7 (July 2004), page 55] and the CAMPOUT architecture ["An Architecture for Controlling Multiple Robots" (NPO-30345), Vol. 28, No. 10 (October 2004), page 65].

Kennedy, Brett↗

Development of INSPCT-S for inspection of spent fuel pool

In this paper, we discuss an accurate and fast software tool (INSPCT-S, Inspection of Nuclear Spent fuel-Pool Calculation Tool, version Spreadsheet) developed for calculation of the response of fission chambers placed in a spent fuel pool, such as Atucha-I. INSPCT-S is developed for identification of suspicious regions of the pool that may have missing or substitute assemblies. INSPCT-S uses a hybrid algorithm based on the adjoint function methodology. The neutron source is comprised of spontaneous fission, ({alpha}, n) interactions, and subcritical multiplication. The former is evaluated using the ORIGEN-ARP code, and the latter is obtained with the fission matrix (FM) formulation. The FM coefficients are determined using the MCNP Monte Carlo code, and the importance function is determined using the PENTRAN 3-D parallel Sn code. Three databases for the neutron source, FM elements, and adjoint flux are prepared as functions of different parameters including burnup, cooling time, enrichment, and pool lattice size. INSPCT-S uses the aforementioned databases and systems of equations to calculate detector responses, which are subsequently compared with normalized experimental data. If this comparison is not satisfied, INSPCT-S utilizes color coding to identify the suspicious regions of a spent fuel pool. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Capturing dynamics on multiple timescales: a hybrid approach for cluttered electromagnetic data

Many problems in electromagnetic signal analysis exhibit dynamics on a wide range of time scales against nonstationary clutter and noise. We consider a problem in which the relevant time scales can range from nanoseconds to hours or days (12 or 13 orders of magnitude). We present a hybrid algorithm currently designed to capture the dynamic behavior at scales from nanoseconds to milliseconds (6 orders of magnitude) while remaining robust to clutter and noise. We draw from techniques of adaptive feature extraction, statistical machine learning, and discrete process modeling and present results on a simulated multimode problem. Our goals are to find a representation of the signal that allows us to identify which pulses were produced by a target emitter and to determine the operational mode of the target.

97 MATHEMATICS AND COMPUTING↗

Analyses of large quasistatic deformations of inelastic bodies by a new hybrid-stress finite element algorithm - Applications

A new hybrid-stress finite element algorithm suitable for analyzing large quasistatic deformations of inelastic solids is presented and its feasibility and performance are demonstrated with examples. The algorithm provides extremely accurate bifurcation analysis which is stable with respect to variation in the finite element mesh, so long as the same type of element is used in every mesh. When the mesh element is varied, the result changes in a predictable manner. The method does not necessarily lead to an upper or lower bound for the critical load. An explicit forward gradient scheme is used to improve stability and is shown to be useful also for elongation-dominated deformations. The application of the method to the onset of necking in plane extension and to deformation and stress in plane extension of an elasticoviscous fluid with an array of cylindrical voids is given in detail.

Reed, K. W.↗

An Adaptive Optimizer for Measurement-Frugal Variational Algorithms

Variational hybrid quantum-classical algorithms (VHQCAs) have the potential to be useful in the era of near-term quantum computing. However, recently there has been concern regarding the number of measurements needed for convergence of VHQCAs. Here, we address this concern by investigating the classical optimizer in VHQCAs. We introduce a novel optimizer called individual Coupled Adaptive Number of Shots (iCANS). This adaptive optimizer frugally selects the number of measurements (i.e., number of shots) both for a given iteration and for a given partial derivative in a stochastic gradient descent. We numerically simulate the performance of iCANS for the variational quantum eigensolver and for variational quantum compiling, with and without noise. In all cases, and especially in the noisy case, iCANS tends to out-perform state-of-the-art optimizers for VHQCAs. We therefore believe this adaptive optimizer will be useful for realistic VHQCA implementations, where the number of measurements is limited.

97 MATHEMATICS AND COMPUTING↗

The potential of quantum annealing for rapid solution structure identification

Abstract The recent emergence of novel computational devices, such as quantum computers, coherent Ising machines, and digital annealers presents new opportunities for hardware-accelerated hybrid optimization algorithms. Unfortunately, demonstrations of unquestionable performance gains leveraging novel hardware platforms have faced significant obstacles. One key challenge is understanding the algorithmic properties that distinguish such devices from established optimization approaches. Through the careful design of contrived optimization tasks, this work provides new insights into the computation properties of quantum annealing and suggests that this model has the potential to quickly identify the structure of high-quality solutions. A meticulous comparison to a variety of algorithms spanning both complete and local search suggests that quantum annealing’s performance on the proposed optimization tasks is distinct. This result provides new insights into the time scales and types of optimization problems where quantum annealing has the potential to provide notable performance gains over established optimization algorithms and suggests the development of hybrid algorithms that combine the best features of quantum annealing and state-of-the-art classical approaches.

97 MATHEMATICS AND COMPUTING↗

Hybrid quantum-classical algorithms for approximate graph coloring

We show how to apply the recursive quantum approximate optimization algorithm (RQAOA) to MAX- k -CUT, the problem of finding an approximate k -vertex coloring of a graph. We compare this proposal to the best known classical and hybrid classical-quantum algorithms. First, we show that the standard (non-recursive) QAOA fails to solve this optimization problem for most regular bipartite graphs at any constant level p : the approximation ratio achieved by QAOA is hardly better than assigning colors to vertices at random. Second, we construct an efficient classical simulation algorithm which simulates level- 1 QAOA and level- 1 RQAOA for arbitrary graphs. In particular, these hybrid algorithms give rise to efficient classical algorithms, and no benefit arising from the use of quantum mechanics is to be expected. Nevertheless, they provide a suitable testbed for assessing the potential benefit of hybrid algorithm: We use the simulation algorithm to perform large-scale simulation of level- 1 QAOA and RQAOA with up to 300 qutrits applied to ensembles of randomly generated 3 -colorable constant-degree graphs. We find that level- 1 RQAOA is surprisingly competitive: for the ensembles considered, its approximation ratios are often higher than those achieved by the best known generic classical algorithm based on rounding an SDP relaxation. This suggests the intriguing possibility that higher-level RQAOA may be a potentially useful algorithm for NISQ devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Two Improved Algorithms for Envelope and Wavefront Reduction

Two algorithms for reordering sparse, symmetric matrices or undirected graphs to reduce envelope and wavefront are considered. The first is a combinatorial algorithm introduced by Sloan and further developed by Duff, Reid, and Scott; we describe enhancements to the Sloan algorithm that improve its quality and reduce its run time. Our test problems fall into two classes with differing asymptotic behavior of their envelope parameters as a function of the weights in the Sloan algorithm. We describe an efficient 0(nlogn + m) time implementation of the Sloan algorithm, where n is the number of rows (vertices), and m is the number of nonzeros (edges). On a collection of test problems, the improved Sloan algorithm required, on the average, only twice the time required by the simpler Reverse Cuthill-Mckee algorithm while improving the mean square wavefront by a factor of three. The second algorithm is a hybrid that combines a spectral algorithm for envelope and wavefront reduction with a refinement step that uses a modified Sloan algorithm. The hybrid algorithm reduces the envelope size and mean square wavefront obtained from the Sloan algorithm at the cost of greater running times. We illustrate how these reductions translate into tangible benefits for frontal Cholesky factorization and incomplete factorization preconditioning.

Kumfert, Gary↗

Stochastic Hybrid Models and Algorithms for Fluids (FHDeX) v1

This software contains numerical modules and application codes for studying the behavior of fluid dynamical systems where fluctuations play an important role in the dynamics. There is support for finite-volume/finite-difference solvers for partial differential equations, particle methods, and hybrid fluid-particle approaches.

Bell, JohnB.↗