A Testbed for Electrified Aircraft Propulsion Control Systems Verification
Explore the source record for details and available documents.
HyPER↗
SEARCH · Engineering Papers
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.
Implicit Preconditioning for Explicit Multigrid Solvers on Cut-Cell Cartesian Meshes
This work assesses the effectiveness of linearized implicit Euler preconditioning for multigrid solvers using an unpreconditioned, Jacobian-free Newton Krylov method to converge the linear system of equations. Multigrid convergence rates improve to approximately 0.75 across the cases tested including a Mach 2 supersonic wedge, transonic NACA 0012 airfoil, and ONERA M6 wing. While larger Krylov subspaces increase the convergence rate, they also increase the computational cost, such that 4-8 Krylov vectors often offers the fastest turnaround. Further reductions in computational cost are achieved with a sequential hybrid preconditioner that begins with the explicit multigrid solver before transitioning to the preconditioned algorithm later on. In addition, a novel implementation of dual time stepping is extended to include both common BDF methods as well as high-order implicit Runge-Kutta schemes. This particular formulation, which uses A −1 preconditioning, is amenable to matrix-free solvers, and the L-stable methods are especially suited for meshes with arbitrarily small cut-cells. Asymptotic order of convergence is demonstrated for BDF1, BDF2, SDIRK2, and 3rd-order Radau IIA time integration with unsteady 2D vortex simulations.
ARMD↗
Few measurement shots challenge generalization in learning to classify entanglement
The ability to extract general laws from a few known examples depends on the complexity of the problem and on the amount of training data. In the quantum setting, the learner's generalization performance is further challenged by the destructive nature of quantum measurements that, together with the no-cloning theorem, limits the amount of information that can be extracted from each training sample. In this paper we focus on hybrid quantum learning techniques where classical machine-learning methods are paired with quantum algorithms and show that, in some settings, the uncertainty coming from a few measurement shots can be the dominant source of errors. We identify an instance of this possibly general issue by focusing on the classification of maximally entangled vs. separable states, showing that this toy problem becomes challenging for learners unaware of entanglement theory. Finally, we introduce an estimator based on classical shadows that performs better in the big data, few copy regime. Our results show that the naive application of classical machine-learning methods to the quantum setting is problematic, and that a better theoretical foundation of quantum learning is required.
97 MATHEMATICS AND COMPUTING↗
On the spectral stability of time integration algorithms for a class of constrained dynamics problems
Incomplete field formulations have recently been the subject of intense research because of their potential in coupled analysis of independently modeled substructures, adaptive refinement, domain decomposition, and parallel processing. This paper discusses the design and analysis of time-integration algorithms for these formulations and emphasizes the treatment of their inter-subdomain constraint equations. These constraints are shown to introduce a destabilizing effect in the dynamic system that can be analyzed by investigating the behavior of the time-integration algorithm at infinite and zero frequencies. Three different approaches for constructing penalty-free unconditionally stable second-order accurate solution procedures for this class of hybrid formulations are presented, discussed and illustrated with numerical examples. The theoretical results presented in this paper also apply to a large family of nonlinear multibody dynamics formulations. Some of the algorithms outlined herein are important alternatives to the popular technique consisting of transforming differential/algebraic equations into ordinary differential equations via the introduction of a stabilization term that depends on arbitrary constants and that influences the computed so1ution.
Farhat, Charbel↗
Estimating Eigenenergies from Quantum Dynamics: A Unified Noise-Resilient Measurement-Driven Approach
Ground state energy estimation in physical, chemical, and materials sciences is one of the most promising applications of quantum computing. In this work, we introduce a new hybrid approach that finds the eigenenergies by collecting real-time measurements and post-processing them using the machinery of dynamic mode decomposition (DMD). From the perspective of quantum dynamics, we establish that our approach can be formally understood as a stable variational method on the function space of observables available from a quantum many-body system. We also provide strong theoretical and numerical evidence that our method converges rapidly even in the presence of a large degree of perturbative noise, and show that the method bears an isomorphism to robust matrix factorization methods developed independently across various scientific communities. Our numerical benchmarks on spin and molecular systems demonstrate an accelerated convergence and a favorable resource reduction over state-of-the-art algorithms. The DMD-centric strategy can systematically mitigate noise and stands out as a leading hybrid quantum-classical eigensolver.
Shen, Yizhi↗
GeoNEX: A Cloud Gateway for Near Real-time Processing of Geostationary Satellite Products
The emergence of a new generation of geostationary satellite sensors provides land andatmosphere monitoring capabilities similar to MODIS and VIIRS with far greater temporal resolution (5-15 minutes). However, processing such large volume, highly dynamic datasets requires computing capabilities that (1) better support data access and knowledge discovery for scientists; (2) provide resources to enable real-time processing for emergency response (wildfire, smoke, dust, etc.); and (3) provide reliable and scalable services for the broader user community. This paper presents an implementation of GeoNEX (Geostationary NASA-NOAA Earth Exchange) services that integrate scientific algorithms with Amazon Web Services (AWS) to provide near realtime monitoring (~5 minute latency) capability in a hybrid cloud-computing environment. It offers a user-friendly, manageable and extendable interface and benefits from the scalability provided by Amazon Web Services. Four use cases are presented to illustrate how to (1) search and access geostationary data; (2) configure computing infrastructure to enable near real-time processing; (3) disseminate and utilize research results, visualizations, and animations to concurrent users; and (4) use a Jupyter Notebook-like interface for data exploration and rapid prototyping. As an example of (3), the Wildfire Automated Biomass Burning Algorithm (WF_ABBA) was implemented on GOES-16 and -17 data to produce an active fire map every 5 minutes over the conterminous US. Details of the implementation strategies, architectures, and challenges of the use cases are discussed.
GeoNEX↗
Solving finite element equations on concurrent computers
This paper discusses the development of a concurrent algorithm for the solution of systems of equations arising in finite element applications. The approach is based on a hybrid of direct elimination method and preconditioned conjugate iteration. Two different preconditioners are used; diagonal scaling and a concurrent implementation of incomplete LU factorization. First, an automatic procedure is used to partition the finite element mesh into sub-structures. The particular mesh partition is chosen to minimize an estimate of the cost for evaluating the solution using this algorithm on a concurrent computer. These procedures are implemented in a finite element program on the JPL/CalTech MARK III hypercube computer. An overview of the structure of this program is presented. The performance of the solution method is demonstrated with the aid of a number of numerical test runs, and its advantages for concurrent implementations are discussed. Efficiency and speed-up factors over sequential machines for the numerical examples are highlighted.
Nour-Omid, B.↗
Application of FARM to an IES scenario within the FORCE ecosystem
The FARM (Feasible Actuator Range Modifier) software module is a component of the RAVEN-based FORCE framework for analysis of Integrated Energy Systems (IES). FARM supports the HERON software module in the evaluation of the optimal dispatch by evaluating feasible set-points for the different IES unit components. Set-points are required to satisfy limits on both production variables (i.e., the variables to be optimized such as the electrical power, the hydrogen production rate, etc.) and process variables tied to the service life of equipment (e.g., steam flowrate, vessel pressure, turbine firing temperature, etc.). This problem is addressed by adopting a two-stage approach. First, the HERON power dispatcher determines set-points that meet the constraints on the former variables (e.g., power levels and power ramp rate limits). These constraints are called explicit constraints. Then, FARM adjusts these set-points to ensure the respect of the limits on the latter variables given the knowledge of the system physics acquired through machine learning algorithms. These constraints are called implicit constraints. From this standpoint, FARM constitutes a bridge between the HERON power dispatcher that adopts a simplified description of the IES unit (low-resolution physics) and the HYBRID high-fidelity models (high-resolution physics). The original version of the FARM software module (FARM-Alpha) was released by Argonne National Laboratory in January 2021. In the latest version of the code released in July 2022 (FARM-Delta), the Reference Governor (RG) algorithm was upgraded to a Multi-Input Multi-Output version from its original Single-Input Single-Output form. The RG algorithm acts to enforce constraints. With this improvement an IES unit is now treated as a single dynamic system from the standpoint of control. The crosstalk among components in an IES unit is now fully considered thereby ensuring a true optimization is obtained for those units that have multiple set-points. In this report, the capabilities of FARM-Delta operating within the FORCE ecosystem are demonstrated for an IES test case. The specific configuration of IES unit for this case was selected by the IES team with consultation from the Advanced Reactor IES Expert Group. A full TEA analysis that invoked HERON, HYBRID, FARM, and RAVEN was performed and serves to demonstrate how the latest modification to FARM algorithms (i.e., state variable selection, state-space matrices derivation, set-point verification) can shape setpoints that might otherwise compromise the health of equipment through accelerated wear and tear. In this specific test case, it was demonstrated that these algorithms ensure a more efficient utilization of steam resources to be shared by two different subsystems, namely Balance of Plant (BOP) and High-Temperature Steam Electrolysis (HTSE). Finally, some code improvements that can further enhance the user-friendliness are suggested.
97 MATHEMATICS AND COMPUTING↗
Hybrid deep learning architecture for general disruption prediction across tokamaks
In this paper, we present a new deep learning disruption prediction algorithm based on important findings from explorative data analysis which effectively allows knowledge transfer from existing devices to new ones, thereby predicting disruptions using very limited disruptive data from the new devices. Here, the explorative data analysis conducted via unsupervised clustering techniques confirms that time-sequence data are much better separators of disruptive and non-disruptive behavior than the instantaneous plasma state data with further advantageous implications for a sequence-based predictor. Based on such important findings, we have designed a new algorithm for multi-machine disruption prediction that achieves high predictive accuracy on the C-Mod (AUC=0.801), DIII-D (AUC=0.947) and EAST (AUC=0.973) tokamaks with limited hyperparameter tuning. Through numerical experiments, we show that boosted accuracy (AUC=0.959) is achieved on EAST predictions by including in the training only 20 disruptive discharges, thousands of non-disruptive discharges from EAST, and combining this with more than a thousand discharges from DIII-D and C-Mod. The improvement of predictive ability obtained by combining disruptive data from other devices is found to be true for all permutations of the three devices. Furthermore, by comparing the predictive performance of each individual numerical experiment, we find that non-disruptive data are machine-specific while disruptive data from multiple devices contain device-independent knowledge that can be used to inform predictions for disruptions occurring on a new device.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
Hybrid deep learning architecture for general disruption prediction across tokamaks
In this paper, we present a new deep learning disruption prediction algorithm based on important findings from explorative data analysis which effectively allows knowledge transfer from existing devices to new ones, thereby predicting disruptions using very limited disruptive data from the new devices. The explorative data analysis conducted via unsupervised clustering techniques confirms that time-sequence data are much better separators of disruptive and non-disruptive behavior than the instantaneous plasma state data with further advantageous implications for a sequence-based predictor. Based on such important findings, we have designed a new algorithm for multi-machine disruption prediction that achieves high predictive accuracy on the C-Mod (AUC=0.801), DIII-D (AUC=0.947) and EAST (AUC=0.973). tokamaks with limited hyperparameter tuning. Through numerical experiments, we show that boosted accuracy (AUC=0.959) is achieved on EAST predictions by including in the training only 20 disruptive discharges, thousands of non-disruptive discharges from EAST, and combining this with more than a thousand discharges from DIII-D and C-Mod. The improvement of predictive ability obtained by combining disruptive data from other devices is found to be true for all permutations of the three devices. Furthermore, by comparing the predictive performance of each individual numerical experiment, we find that non-disruptive data are machine-specific while disruptive data from multiple devices contain device-independent knowledge that can be used to inform predictions for disruptions occurring on a new device.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
Hybrid Glacier Inventory, Gravimetry and Altimetry (HIGA) Mass Balance Product for Greenland and the Canadian Arctic
We present a novel inversion algorithm that generates a mass balance field that is simultaneously consistent with independent observations of glacier inventory derived from optical imagery, cryosphere-attributed mass trends derived from satellite gravimetry, and ice surface elevation trends derived from airborne and satellite altimetry. We use this algorithm to assess mass balance across Greenland and the Canadian Arctic over the Sep-2003 to Oct- 2009 period at 26 kilometers resolution. We evaluate local algorithm-inferred mass balance against forty in situ point observations. This evaluation yields a root mean squared error (RMSE) of 0.15 mWE/a ( 0.15 meters (water equivalent) per annum), and highlights a paucity of in situ observations from regions of high dynamic mass loss and peripheral glaciers. We assess mass losses of 212 plus or minus 67 Gigatons per annum to the Greenland ice sheet proper, 38 Gigatons per annum to peripheral glaciers in Greenland, and 42 Gigatons per annum to glaciers in the Canadian Arctic. These magnitudes of mass loss are dependent on the gravimetry-derived spherical harmonic mass trend we invert. We spatially partition the transient glacier continuity equation by differencing algorithm inferred mass balance from modeled surface mass balance, in order to solve the horizontal divergence of ice flux as a residual. This residual ice dynamic field infers flux divergence (or submergent flow) in the ice sheet accumulation area and at tidewater margins, and flux convergence (or emergent flow) in land-terminating ablation areas, which is consistent with continuum mechanics theory.
Altimetry↗
A Trajectory-Tracking Algorithm for the LSMS Family of Cable-Driven Cranes
The Lightweight Surface Manipulation System, or LSMS, is a family of scalable long-reach cable-actuated manipulators. The design of the LSMS has a high payload ratio for efficient operations on planetary surfaces like the Moon or Mars. The LSMS has nonlinear, coupled, and hybrid dynamics. The engineering decisions that led to these challenging dynamics make this structure light and efficient. This paper proposes a novel trajectory tracking algorithm for these cranes that facilitates precise autonomous and teleoperated operations. This algorithm enables these robots to follow complex trajectories that avoid obstacles and pickup regolith in a construction site.
trajectory tracking↗
On the integration of reinforcement learning and approximate reasoning for control
The author discusses the importance of strengthening the knowledge representation characteristic of reinforcement learning techniques using methods such as approximate reasoning. The ARIC (approximate reasoning-based intelligent control) architecture is an example of such a hybrid approach in which the fuzzy control rules are modified (fine-tuned) using reinforcement learning. ARIC also demonstrates that it is possible to start with an approximately correct control knowledge base and learn to refine this knowledge through further experience. On the other hand, techniques such as the TD (temporal difference) algorithm and Q-learning establish stronger theoretical foundations for their use in adaptive control and also in stability analysis of hybrid reinforcement learning and approximate reasoning-based controllers.
Berenji, Hamid R.↗
A Trajectory Tracking Algorithm for the LSMS Family of Cable-Driven Crane
The Lightweight Surface Manipulation System, or LSMS, is a family of scalable long-reach cable-actuated manipulators. The design of the LSMS has a high payload ratio for efficient operations on planetary surfaces like the Moon or Mars. The LSMS has nonlinear, coupled, and hybrid dynamics. The engineering decisions that led to these challenging dynamics make this structure light and efficient. This paper proposes a novel trajectory tracking algorithm for these cranes that facilitates precise autonomous and teleoperated operations. This algorithm enables these robots to follow complex trajectories that avoid obstacles and pickup regolith in a construction site.
lunar operations↗
Bridging paradigms: Designing for HPC-Quantum convergence
Here, this paper presents a comprehensive software stack architecture for integrating quantum computing (QC) capabilities with High-Performance Computing (HPC) environments. While quantum computers show promise as specialized accelerators for scientific computing, their effective integration with classical HPC systems presents significant technical challenges. We propose a hardware-agnostic software framework that supports both current noisy intermediate-scale quantum devices and future fault-tolerant quantum computers, while maintaining compatibility with existing HPC workflows. The architecture includes a quantum gateway interface, standardized APIs for resource management, and robust scheduling mechanisms to handle both simultaneous and interleaved quantum–classical workloads. Key innovations include: (1) a unified resource management system that efficiently coordinates quantum and classical resources, (2) a flexible quantum programming interface that abstracts hardware-specific details, (3) A Quantum Platform Manager API that simplifies the integration of various quantum hardware systems, and (4) a comprehensive tool chain for quantum circuit optimization and execution. We demonstrate our architecture through implementation of quantum–classical algorithms, including the variational quantum linear solver, showcasing the framework’s ability to handle complex hybrid workflows while maximizing resource utilization. This work provides a foundational blueprint for integrating QC capabilities into existing HPC infrastructures, addressing critical challenges in resource management, job scheduling, and efficient data movement between classical and quantum resources.
97 MATHEMATICS AND COMPUTING↗
Scalable and accurate multi-GPU-based image reconstruction of large-scale ptychography data
Abstract While the advances in synchrotron light sources, together with the development of focusing optics and detectors, allow nanoscale ptychographic imaging of materials and biological specimens, the corresponding experiments can yield terabyte-scale volumes of data that can impose a heavy burden on the computing platform. Although graphics processing units (GPUs) provide high performance for such large-scale ptychography datasets, a single GPU is typically insufficient for analysis and reconstruction. Several works have considered leveraging multiple GPUs to accelerate the ptychographic reconstruction. However, most of these works utilize only the Message Passing Interface to handle the communications between GPUs. This approach poses inefficiency for a hardware configuration that has multiple GPUs in a single node, especially while reconstructing a single large projection, since it provides no optimizations to handle the heterogeneous GPU interconnections containing both low-speed (e.g., PCIe) and high-speed links (e.g., NVLink). In this paper, we provide an optimized intranode multi-GPU implementation that can efficiently solve large-scale ptychographic reconstruction problems. We focus on the maximum likelihood reconstruction problem using a conjugate gradient (CG) method for the solution and propose a novel hybrid parallelization model to address the performance bottlenecks in the CG solver. Accordingly, we have developed a tool, called PtyGer ( Pty chographic G PU(multipl e )-based r econstruction), implementing our hybrid parallelization model design. A comprehensive evaluation verifies that PtyGer can fully preserve the original algorithm’s accuracy while achieving outstanding intranode GPU scalability.
97 MATHEMATICS AND COMPUTING↗
Bayesian averaging for ground state masses of atomic nuclei in a Machine Learning approach
We present global predictions of the ground state mass of atomic nuclei based on a novel Machine Learning algorithm. We combine precision nuclear experimental measurements together with theoretical predictions of unmeasured nuclei. This hybrid data set is used to train a probabilistic neural network. In addition to training on this data, a physics-based loss function is employed to help refine the solutions. The resultant Bayesian averaged predictions have excellent performance compared to the testing set and come with well-quantified uncertainties which are critical for contemporary scientific applications. We assess extrapolations of the model’s predictions and estimate the growth of uncertainties in the region far from measurements.
74 ATOMIC AND MOLECULAR PHYSICS↗
Viterbi/algebraic hybrid decoder
Decoder computer program is hybrid between optimal Viterbi and optimal algebraic decoders. Tests have shown that hybrid decoder outperforms any strictly Viterbi or strictly algebraic decoder and effectively handles compound channels. Algorithm developed uses syndrome-detecting logic to direct two decoders to assume decoding load alternately, depending on real-time channel characteristics.
Boyd, R. W.↗