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 91 records · Page 5

Leveraging operator learning to accelerate convergence of the preconditioned conjugate gradient method

We propose a new deflation strategy to accelerate the convergence of the preconditioned conjugate gradient (PCG) method for solving parametric large-scale linear systems of equations. Unlike traditional deflation techniques that rely on eigenvector approximations or recycled Krylov subspaces, we generate the deflation subspaces using operator learning, specifically the Deep Operator Network (DeepONet). To this aim, we introduce two complementary approaches for assembling the deflation operators. The first approach approximates near-null space vectors of the discrete PDE operator using the basis functions learned by the DeepONet. The second approach directly leverages solutions predicted by the DeepONet. To further enhance convergence, we also propose several strategies for prescribing the sparsity pattern of the deflation operator. Here, a comprehensive set of numerical experiments encompassing steady-state, time-dependent, scalar, and vector-valued problems posed on both structured and unstructured geometries is presented and demonstrates the effectiveness of the proposed DeepONet-based deflated PCG method, as well as its generalization across a wide range of model parameters and problem resolutions.

Deflation↗

Quantifying the impact of precision errors on quantum approximate optimization algorithms

The quantum approximate optimization algorithm (QAOA) is a hybrid quantum-classical algorithm that seeks to achieve approximate solutions to optimization problems by iteratively alternating between intervals of controlled quantum evolution. Here, we examine the effect of analog precision errors on QAOA performance from the perspective of both algorithmic training and performance guarantees. Leveraging cumulant expansions, we recast the faulty QAOA as a control problem in which precision errors are expressed as multiplicative control noise and derive bounds on the performance of QAOA. We show using both analytical techniques and numerical simulations that fixed precision implementations of QAOA circuits are subject to an exponential degradation in performance dependent upon the number of optimal QAOA layers and magnitude of the precision error. Despite this significant reduction, we show that it is possible to mitigate precision errors in QAOA via digitization of the variational parameters at the cost of increasing circuit depth.

quantum algorithms↗

Hybrid LZW compression

The Science Data Management and Science Payload Operations subpanel reports from the NASA Conference on Scientific Data Compression (Snowbird, Utah in 1988) indicate the need for both lossless and lossy image data compression systems. The ranges developed by the subpanel suggest ratios of 2:1 to 4:1 for lossless coding and 2:1 to 6:1 for lossy predictive coding. For the NASA Freedom Science Video Processing Facility it would be highly desirable to implement one baseline compression system which would meet both of these criteria. Presented here is such a system, utilizing an LZW hybrid coding scheme which is adaptable to either type of compression. Simulation results are presented with the hybrid LZW algorithm operating in each of its modes.

Lewis, H. Garton, Jr.↗

Aerocapture and aeromaneuvering at Mars

This paper presents the results of a guidance analysis study for aerocapture and aeromaneuvering at Mars. A 4-state, near-optimal, hybrid guidance algorithm is derived for applications throughout the paper. It is based on the critical assumption that Loh's function remains constant between successive guidance updates. Besides the guidance algorithm, the paper presents a performance evaluation of guidance derived from estimated or 'navigated' spacecraft state, provided by an onboard navigation subsystem for real-time applications on Mars. For the performance evaluation, the spacecraft state is augmented by such parameters as the reference atmospheric density and scale-height, the banking angle and angle of attack for spacecraft control and the accelerometer measurement model errors. Finally, the paper examines also, the influence of random uncertainties in atmospheric density on aeroassisted maneuvers, by a Monte Carlo type of simulation.

Vijayaraghavan, A.↗

Multiple-camera/motion stereoscopy for range estimation in helicopter flight

Aiding the pilot to improve safety and reduce pilot workload by detecting obstacles and planning obstacle-free flight paths during low-altitude helicopter flight is desirable. Computer vision techniques provide an attractive method of obstacle detection and range estimation for objects within a large field of view ahead of the helicopter. Previous research has had considerable success by using an image sequence from a single moving camera to solving this problem. The major limitations of single camera approaches are that no range information can be obtained near the instantaneous direction of motion or in the absence of motion. These limitations can be overcome through the use of multiple cameras. This paper presents a hybrid motion/stereo algorithm which allows range refinement through recursive range estimation while avoiding loss of range information in the direction of travel. A feature-based approach is used to track objects between image frames. An extended Kalman filter combines knowledge of the camera motion and measurements of a feature's image location to recursively estimate the feature's range and to predict its location in future images. Performance of the algorithm will be illustrated using an image sequence, motion information, and independent range measurements from a low-altitude helicopter flight experiment.

Smith, Phillip N.↗

Design for dependability: A simulation-based approach

This research addresses issues in simulation-based system level dependability analysis of fault-tolerant computer systems. The issues and difficulties of providing a general simulation-based approach for system level analysis are discussed and a methodology that address and tackle these issues is presented. The proposed methodology is designed to permit the study of a wide variety of architectures under various fault conditions. It permits detailed functional modeling of architectural features such as sparing policies, repair schemes, routing algorithms as well as other fault-tolerant mechanisms, and it allows the execution of actual application software. One key benefit of this approach is that the behavior of a system under faults does not have to be pre-defined as it is normally done. Instead, a system can be simulated in detail and injected with faults to determine its failure modes. The thesis describes how object-oriented design is used to incorporate this methodology into a general purpose design and fault injection package called DEPEND. A software model is presented that uses abstractions of application programs to study the behavior and effect of software on hardware faults in the early design stage when actual code is not available. Finally, an acceleration technique that combines hierarchical simulation, time acceleration algorithms and hybrid simulation to reduce simulation time is introduced.

Goswami, Kumar K.↗

Shared Memory Parallelization of an Implicit ADI-type CFD Code

A parallelization study designed for ADI-type algorithms is presented using the OpenMP specification for shared-memory multiprocessor programming. Details of optimizations specifically addressed to cache-based computer architectures are described and performance measurements for the single and multiprocessor implementation are summarized. The paper demonstrates that optimization of memory access on a cache-based computer architecture controls the performance of the computational algorithm. A hybrid MPI/OpenMP approach is proposed for clusters of shared memory machines to further enhance the parallel performance. The method is applied to develop a new LES/DNS code, named LESTool. A preliminary DNS calculation of a fully developed channel flow at a Reynolds number of 180, Re(sub tau) = 180, has shown good agreement with existing data.

Hauser, Th.↗

Dynamically Reconfigurable Approach to Multidisciplinary Problems

The complexity and autonomy of the constituent disciplines and the diversity of the disciplinary data formats make the task of integrating simulations into a multidisciplinary design optimization problem extremely time-consuming and difficult. We propose a dynamically reconfigurable approach to MDO problem formulation wherein an appropriate implementation of the disciplinary information results in basic computational components that can be combined into different MDO problem formulations and solution algorithms, including hybrid strategies, with relative ease. The ability to re-use the computational components is due to the special structure of the MDO problem. We believe that this structure can and should be used to formulate and solve optimization problems in the multidisciplinary context. The present work identifies the basic computational components in several MDO problem formulations and examines the dynamically reconfigurable approach in the context of a popular class of optimization methods. We show that if the disciplinary sensitivity information is implemented in a modular fashion, the transfer of sensitivity information among the formulations under study is straightforward. This enables not only experimentation with a variety of problem formations in a research environment, but also the flexible use of formulations in a production design environment.

Alexandrov, Natalie M.↗

Reconfigurability in MDO Problem Synthesis

Integrating autonomous disciplines into a problem amenable to solution presents a major challenge in realistic multidisciplinary design optimization (MDO). We propose a linguistic approach to MDO problem description, formulation, and solution we call reconfigurable multidisciplinary synthesis (REMS). With assistance from computer science techniques, REMS comprises an abstract language and a collection of processes that provide a means for dynamic reasoning about MDO problems in a range of contexts. The approach may be summarized as follows. Description of disciplinary data according to the rules of a grammar, followed by lexical analysis and compilation, yields basic computational components that can be assembled into various MDO problem formulations and solution algorithms, including hybrid strategies, with relative ease. The ability to re-use the computational components is due to the special structure of the MDO problem. The range of contexts for reasoning about MDO spans tasks from error checking and derivative computation to formulation and reformulation of optimization problem statements. In highly structured contexts, reconfigurability can mean a straightforward transformation among problem formulations with a single operation. We hope that REMS will enable experimentation with a variety of problem formulations in research environments, assist in the assembly of MDO test problems, and serve as a pre-processor in computational frameworks in production environments. This paper, Part 1 of two companion papers, discusses the fundamentals of REMS. Part 2 illustrates the methodology in more detail.

Alexandrov, Natalia M.↗

Reconfigurability in MDO Problem Synthesis

Integrating autonomous disciplines into a problem amenable to solution presents a major challenge in realistic multidisciplinary design optimization (MDO). We propose a linguistic approach to MDO problem description, formulation, and solution we call reconfigurable multidisciplinary synthesis (REMS). With assistance from computer science techniques, REMS comprises an abstract language and a collection of processes that provide a means for dynamic reasoning about MDO problems in a range of contexts. The approach may be summarized as follows. Description of disciplinary data according to the rules of a grammar, followed by lexical analysis and compilation, yields basic computational components that can be assembled into various MDO problem formulations and solution algorithms, including hybrid strategies, with relative ease. The ability to re-use the computational components is due to the special structure of the MDO problem. The range of contexts for reasoning about MDO spans tasks from error checking and derivative computation to formulation and reformulation of optimization problem statements. In highly structured contexts, reconfigurability can mean a straightforward transformation among problem formulations with a single operation. We hope that REMS will enable experimentation with a variety of problem formulations in research environments, assist in the assembly of MDO test problems, and serve as a pre-processor in computational frameworks in production environments. Part 1 of two companion papers, discusses the fundamentals of REMS. This paper, Part 2 illustrates the methodology in more detail.

Alexandrov, Natalia M.↗

LISA Framework for Enhancing Gravitational Wave Signal Extraction Techniques

This paper describes the development of a Framework for benchmarking and comparing signal-extraction and noise-interference-removal methods that are applicable to interferometric Gravitational Wave detector systems. The primary use is towards comparing signal and noise extraction techniques at LISA frequencies from multiple (possibly confused) ,gravitational wave sources. The Framework includes extensive hybrid learning/classification algorithms, as well as post-processing regularization methods, and is based on a unique plug-and-play (component) architecture. Published methods for signal extraction and interference removal at LISA Frequencies are being encoded, as well as multiple source noise models, so that the stiffness of GW Sensitivity Space can be explored under each combination of methods. Furthermore, synthetic datasets and source models can be created and imported into the Framework, and specific degraded numerical experiments can be run to test the flexibility of the analysis methods. The Framework also supports use of full current LISA Testbeds, Synthetic data systems, and Simulators already in existence through plug-ins and wrappers, thus preserving those legacy codes and systems in tact. Because of the component-based architecture, all selected procedures can be registered or de-registered at run-time, and are completely reusable, reconfigurable, and modular.

Thompson, David E.↗

Telerobotic Surgery: An Intelligent Systems Approach to Mitigate the Adverse Effects of Communication Delay

An extremely innovative approach has been presented, which is to have the surgeon operate through a simulator running in real-time enhanced with an intelligent controller component to enhance the safety and efficiency of a remotely conducted operation. The use of a simulator enables the surgeon to operate in a virtual environment free from the impediments of telecommunication delay. The simulator functions as a predictor and periodically the simulator state is corrected with truth data. Three major research areas must be explored in order to ensure achieving the objectives. They are: simulator as predictor, image processing, and intelligent control. Each is equally necessary for success of the project and each of these involves a significant intelligent component in it. These are diverse, interdisciplinary areas of investigation, thereby requiring a highly coordinated effort by all the members of our team, to ensure an integrated system. The following is a brief discussion of those areas. Simulator as a predictor: The delays encountered in remote robotic surgery will be greater than any encountered in human-machine systems analysis, with the possible exception of remote operations in space. Therefore, novel compensation techniques will be developed. Included will be the development of the real-time simulator, which is at the heart of our approach. The simulator will present real-time, stereoscopic images and artificial haptic stimuli to the surgeon. Image processing: Because of the delay and the possibility of insufficient bandwidth a high level of novel image processing is necessary. This image processing will include several innovative aspects, including image interpretation, video to graphical conversion, texture extraction, geometric processing, image compression and image generation at the surgeon station. Intelligent control: Since the approach we propose is in a sense predictor based, albeit a very sophisticated predictor, a controller, which not only optimizes end effector trajectory but also avoids error, is essential. We propose to investigate two different approaches to the controller design. One approach employs an optimal controller based on modern control theory; the other one involves soft computing techniques, i.e. fuzzy logic, neural networks, genetic algorithms and hybrids of these.

Cardullo, Frank M.↗

Solver and Turbulence Model Upgrades to OVERFLOW 2 for Unsteady and High-Speed Applications

An implicit unfactored SSOR algorithm has been added to the overset Navier-Stokes CFD code OVERFLOW 2 for unsteady and moving body applications. The HLLEM and HLLC third-order spatial upwind convective flux models have been added for high-speed flow applications. A generalized upwind transport equation has been added for solution of the two-equation turbulence models and the species equations. The generalized transport equation is solved using an unfactored SSOR implicit algorithm. Three hybrid RANS/DES turbulence models have been added for unsteady flow applications. Wall function boundary conditions that include compressibility and heat transfer effects have been also been added to OVERFLOW 2.

Nichols, Robert H.↗

Fracture Prediction of Epoxy Resin using Morse Bond Potential Embedded in GAFF using Molecular Dynamics Simulations

A generic method is developed to investigate the fracture behavior of an epoxy resin using atomistic molecular (MD) dynamics simulations. The epoxy system consisted of the stoichiometric mixture of tetra-/tri-functional epoxies and di-functional hardener molecules and was cured with a step-growth crosslinking algorithm. A hybrid force field (hFF) in which Morse bond function were added in second generation-general Amber Force Field (GAFF2) was used to capture bond breaking of the crosslinked epoxy system under uniaxial deformation. The Morse bond parameters for covalent bonds in the crosslinked backbone were fit to dissociation curves computed by CASPT2/6-311+G**. After the systems in various crosslink densities were obtained and equilibrated, the full length of stress-strain (𝜎-𝜀) curve was produced including initial elastic regime, yielding, plastic flow, strain hardening, and progressive failure. We found that the hFF was effective in studying the dissociation of crosslinked polymers and understanding the failure mechanism. In the results, the hFF delivered the same elastic property obtained from the unmodified force field GAFF. The stress-strain curve, however, began to be distinct in the plastic regime due to broken covalent bonds capable of altering the tensile behavior. Once the stress reached maximum, it progressively decreased until the ultimate failure (𝜎=0). Since hFF employed the existing GAFF functions with including a minimal change of its bond potential, this approach is easier to perform and computationally more efficient for unveiling the fracture behavior of polymer materials at the molecular level than other approaches with reactive force fields. We expect this approach will be utilized to accelerate the material-by-design process for thermosets by incorporate data from molecular models.

Changwoon Jang↗

Improving Satellite Global Chlorophyll a [alpha] Data Products Through Algorithm Refinement and Data Recovery

A recently developed algorithm to estimate surface ocean chlorophyll a concentrations (Chl in milligrams per cubic meter), namely, the ocean color index (OCI) algorithm, has been adopted by the U.S. National Aeronautics and Space Administration to apply to all satellite ocean color sensors to produce global Chl maps. The algorithm is a hybrid between a band‐difference color index algorithm for low‐Chl waters and the traditional band‐ratio algorithms (OCx) for higher‐Chl waters. In this study, the OCI algorithm is revisited for its algorithm coefficients and for its algorithm transition between color index and OCx using a merged data set of high‐performance liquid chromatography and fluorometric Chl. Results suggest that the new OCI algorithm (OCI2) leads to lower Chl estimates than the original OCI (OCI1) for Chl less than 0.05 milligrams per cubic meter, but smoother algorithm transition for Chl between 0.25 and 0.40 milligrams per cubic meter. Evaluation using in situ data suggests that similar to OCI1, OCI2 has significantly improved image quality and cross‐sensor consistency between SeaWiFS (Sea-viewing Wide Field-of-view Sensor), MODISA (Moderate Resolution Imaging Spectroradiometer on Aqua), and VIIRS (Visible Infrared Imaging Radiometer Suite) over the OCx algorithms for oligotrophic oceans. Mean cross‐sensor difference in monthly Chl data products over global oligotrophic oceans reduced from approximately 10 percent for OCx to 1-2 percent for OCI2. More importantly, data statistics suggest that the current straylight masking scheme used to generate global Chl maps can be relaxed from 7 by 5 to 3 by 3 pixels without losing data quality in either Chl or spectral remote sensing reflectance (R (sub rs) by lambda (sensor wavelength), per steradian (sr (sup −1)) for not just oligotrophic oceans but also more productive waters. Such a relaxed masking scheme yields an average relative increase of 39 percent in data quantity for global oceans, thus making it possible to reduce data product uncertainties and fill data gaps.

Hu, Chuanmin↗

Bidding Curve Design for Hybrid Power Plants with Uncertain Solar Forecast

This paper presents a novel bidding curve design algorithm tailored for hybrid power plants (HPPs) to participate in the wholesale electricity market. Utilizing forecasts for photovoltaic (PV) generation and available battery power, our algorithm strategically computes the bidding curve to maximize HPP profit while adeptly managing the inherent uncertainty associated with PV power generation. In addition, the introduction of the penalty cost in HPP bidding curves provides the system operator a tool to effectively manage the system-level uncertainty that caused by HPPs. Numerical analysis through Monte Carlo simulations confirms that our bidding curve methodology outperforms the benchmark across various scenarios.

bidding curve↗