Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “generalized 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 1,423 records · Page 79

Ground state energy and magnetization curve of a frustrated magnetic system from real-time evolution on a digital quantum processor

Models of interacting many-body quantum systems that may realize new exotic phases of matter, notably quantum spin liquids, are challenging to study using even state-of-the-art classical methods such as tensor network simulations. Quantum computing provides a promising route for overcoming these difficulties to find ground states, dynamics, and more. In this paper, we argue that recently developed hybrid quantum-classical algorithms based on real-time evolution are promising methods for solving a particularly important model in the search for spin liquids, the antiferromagnetic Heisenberg model on the two-dimensional kagome lattice. We show how to construct efficient quantum circuits to implement time evolution for the model and to evaluate key observables on the quantum computer, and we argue that the method has favorable scaling with increasing system size. We then restrict to a 12-spin star plaquette from the kagome lattice and a related 8-spin system, and we give an empirical demonstration on these small systems that the hybrid algorithms can efficiently find the ground state energy and the magnetization curve. For these demonstrations, we use four levels of approximation: exact state vectors, exact state vectors with statistical noise from sampling, noisy classical emulators, and (for the 8-spin system only) real quantum hardware, specifically the Quantinuum H1-1 processor; for the noisy simulations and hardware demonstration, we also employ error mitigation strategies based on the symmetries of the Hamiltonian. Our results strongly suggest that these hybrid algorithms present a promising direction for studying quantum spin liquids and more generally for resolving important unsolved problems in condensed matter theory and beyond.

97 MATHEMATICS AND COMPUTING↗

Phasor-Based Control for Scalable Integration of Variable Energy Resources

We propose an innovative framework termed phasor-based control (PBC) to facilitate the integration of heterogeneous and intermittent distributed energy resources (DER) on the electric grid. PBC presents a unified approach that is agnostic to optimization criteria and to the particular characteristics of participating resources. It is enabled by synchronized, high-precision voltage phasor measurements that allow stating control objectives in grid-specific, rather than resource-specific, terms. We present qualitative justification and examine the general feasibility of this control approach, including the behavior of candidate control algorithms in simulation. Initial results suggest that PBC has significant potential to support stable and resilient grid operations in the presence of arbitrarily high penetrations of DER.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Possibilities and Limitations of Kinematically Identifying Stars from Accreted Ultra-faint Dwarf Galaxies

Abstract The Milky Way has accreted many ultra-faint dwarf galaxies (UFDs), and stars from these galaxies can be found throughout our Galaxy today. Studying these stars provides insight into galaxy formation and early chemical enrichment, but identifying them is difficult. Clustering stellar dynamics in 4D phase space ( E , L z , J r , J z ) is one method of identifying accreted structure that is currently being utilized in the search for accreted UFDs. We produce 32 simulated stellar halos using particle tagging with the Caterpillar simulation suite and thoroughly test the abilities of different clustering algorithms to recover tidally disrupted UFD remnants. We perform over 10,000 clustering runs, testing seven clustering algorithms, roughly twenty hyperparameter choices per algorithm, and six different types of data sets each with up to 32 simulated samples. Of the seven algorithms, HDBSCAN most consistently balances UFD recovery rates and cluster realness rates. We find that, even in highly idealized cases, the vast majority of clusters found by clustering algorithms do not correspond to real accreted UFD remnants and we can generally only recover 6% of UFDs remnants at best. These results focus exclusively on groups of stars from UFDs, which have weak dynamic signatures compared to the background of other stars. The recoverable UFD remnants are those that accreted recently, z accretion ≲ 0.5. Based on these results, we make recommendations to help guide the search for dynamically linked clusters of UFD stars in observational data. We find that real clusters generally have higher median energy and J r , providing a way to help identify real versus fake clusters. We also recommend incorporating chemical tagging as a way to improve clustering results.

79 ASTRONOMY AND ASTROPHYSICS↗

Space shuttle digital flight control system

The space shuttle digital, fly by wire, flight control system presents an interesting challenge in avionics system design. In residence in each of four redundant general purpose computers at lift off are the guidance, navigation, and control algorithms for the entire flight. The mission is divided into several flight segments: first stage ascent, second stage ascent; abort to launch site, abort once around; on orbit operations, entry, terminal area energy management; and approach and landing. The FCS is complicated in that it must perform the functions to fly the shuttle as a boost vehicle, as a spacecraft, as a reentry vehicle, and as a conventional aircraft. The crew is provided with both manual and automatic modes of operations in all flight phases including touchdown and rollout.

Minott, G. M.↗

An iterative decoupling solution method for large scale Lyapunov equations

A great deal of attention has been given to the numerical solution of the Lyapunov equation. A useful classification of the variety of solution techniques are the groupings of direct, transformation, and iterative methods. The paper summarizes those methods that are at least partly favorable numerically, giving special attention to two criteria: exploitation of a general sparse system matrix structure and efficiency in resolving the governing linear matrix equation for different matrices. An iterative decoupling solution method is proposed as a promising approach for solving large-scale Lyapunov equation when the system matrix exhibits a general sparse structure. A Fortran computer program that realizes the iterative decoupling algorithm is also discussed.

Athay, T. M.↗

Incorporating spatial context into statistical classification of multidimensional image data

Compound decision theory is employed to develop a general statistical model for classifying image data using spatial context. The classification algorithm developed from this model exploits the tendency of certain ground-cover classes to occur more frequently in some spatial contexts than in others. A key input to this contextural classifier is a quantitative characterization of this tendency: the context function. Several methods for estimating the context function are explored, and two complementary methods are recommended. The contextural classifier is shown to produce substantial improvements in classification accuracy compared to the accuracy produced by a non-contextural uniform-priors maximum likelihood classifier when these methods of estimating the context function are used. An approximate algorithm, which cuts computational requirements by over one-half, is presented. The search for an optimal implementation is furthered by an exploration of the relative merits of using spectral classes or information classes for classification and/or context function estimation.

Bauer, M. E.↗

A review of modern approaches to fatigue reliability analysis and design

Metal fatigue is a principal mode of failure in components of mechanical systems. But fatigue design factors (e.g., stress, fatigue strength) are subject to considerable uncertainty. Therefore, relative to fatigue, reliability methods are appropriate for purposes of safety checking of designs, risk assessment, failure analysis, and development of code statements. Described herein are four methods which can be effectively employed for fatigue reliability analysis, (1) Monte Carlo methods, (2) the lognormal format, (3) the Weibull format, (4) the Rackwitz-Fiessler algorithm. Examples of the application of each are presented. In summary, no general reliability method can be recommended for all situations involving fatigue. The approach has to be tailored to the problem.

Wirsching, P. H.↗

Using spatial logic in classification of Landsat TM data

A strategy for spatial/spectral classification of Landsat TM data is presented. The strategy is founded upon 'spatial logic', a logic that seeks to emulate important aspects of visual image interpretation. The carefully structured classification process begins with spectral stratification of the data into water, vegetated and non-vegetated pixels. A region growing algorithm is then used to define 'fields' of similar land cover composition. Fields are characterized by cover composition, size and neighborhood characteristics. A supervised iterative contextual classification algorithm is developed to assign final land use/land cover labels. Maps are generalized using a spatial post-processing technique. Positive, though preliminary, results are presented.

Merchant, J. W.↗

Advanced three-dimensional dynamic analysis by boundary element methods

Advanced formulations of boundary element method for periodic, transient transform domain and transient time domain solution of three-dimensional solids have been implemented using a family of isoparametric boundary elements. The necessary numerical integration techniques as well as the various solution algorithms are described. The developed analysis has been incorporated in a fully general purpose computer program BEST3D which can handle up to 10 subregions. A number of numerical examples are presented to demonstrate the accuracy of the dynamic analyses.

Banerjee, P. K.↗

Separating Peaks in X-Ray Spectra

Deconvolution algorithm assists in analysis of x-ray spectra from scanning electron microscopes, electron microprobe analyzers, x-ray fluorescence spectrometers, and like. New algorithm automatically deconvolves x-ray spectrum, identifies locations of spectral peaks, and selects chemical elements most likely producing peaks. Technique based on similarities between zero- and second-order terms of Taylor-series expansions of Gaussian distribution and of damped sinusoid. Principal advantage of algorithm: no requirement to adjust weighting factors or other parameters when analyzing general x-ray spectra.

Nicolas, David↗

Unsteady transonic algorithm improvements for realistic aircraft applications

Improvements to a time-accurate approximate factorization (AF) algorithm have been implemented for steady and unsteady transonic analysis of realistic aircraft configurations. The algorithm improvements include: an Engquist-Osher (E-O) type-dependent switch to more accurately and efficiently treat regions of supersonic flow, extension of the E-O switch for second-order spatial accuracy in these regions, nonreflecting far field boundary conditions for more accurate unsteady applications, and several modifications which accelerate convergence to steady-state. Calculations are presented for several configurations to evaluate the algorithm modifications. The modifications have significantly improved the stability of the AF algorithm and hence the reliability of the CAP-TSD code in general.

Batina, John T.↗

An inverse kinematics algorithm for a highly redundant variable-geometry-truss manipulator

A new class of robotic arm consists of a periodic sequence of truss substructures, each of which has several variable-length members. Such variable-geometry-truss manipulator (VGTMs) are inherently highly redundant and promise a significant increase in dexterity over conventional anthropomorphic manipulators. This dexterity may be exploited for both obstacle avoidance and controlled deployment in complex workspaces. The inverse kinematics problem for such unorthodox manipulators, however, becomes complex because of the large number of degrees of freedom, and conventional solutions to the inverse kinematics problem become inefficient because of the high degree of redundancy. A solution is presented to this problem based on a spline-like reference curve for the manipulator's shape. Such an approach has a number of advantages: (1) direct, intuitive manipulation of shape; (2) reduced calculation time; and (3) direct control over the effective degree of redundancy of the manipulator. Furthermore, although the algorithm was developed primarily for variable-geometry-truss manipulators, it is general enough for application to a number of manipulator designs.

Naccarato, Frank↗

Simulation Test Of Descent Advisor

Report describes piloted-simulation test of Descent Advisor (DA), subsystem of larger automation system being developed to assist human air-traffic controllers and pilots. Focuses on results of piloted simulation, in which airline crews executed controller-issued descent advisories along standard curved-path arrival routes. Crews able to achieve arrival-time precision of plus or minus 20 seconds at metering fix. Analysis of errors generated in turns resulted in further enhancements of algorithm to increase accuracies of its predicted trajectories. Evaluations by pilots indicate general support for DA concept and provide specific recommendations for improvement.

Davis, Thomas J.↗

The symbolic computation and automatic analysis of trajectories

Research was generally done on computation of trajectories of dynamical systems, especially control systems. Algorithms were further developed for rewriting expressions involving differential operators. The differential operators involved arise in the local analysis of nonlinear control systems. An initial design was completed of the system architecture for software to analyze nonlinear control systems using data base computing.

Grossman, Robert↗

Stability analysis of spacecraft power systems

The problems in applying standard electric utility models, analyses, and algorithms to the study of the stability of spacecraft power conditioning and distribution systems are discussed. Both single-phase and three-phase systems are considered. Of particular concern are the load and generator models that are used in terrestrial power system studies, as well as the standard assumptions of load and topological balance that lead to the use of the positive sequence network. The standard assumptions regarding relative speeds of subsystem dynamic responses that are made in the classical transient stability algorithm, which forms the backbone of utility-based studies, are examined. The applicability of these assumptions to a spacecraft power system stability study is discussed in detail. In addition to the classical indirect method, the applicability of Liapunov's direct methods to the stability determination of spacecraft power systems is discussed. It is pointed out that while the proposed method uses a solution process similar to the classical algorithm, the models used for the sources, loads, and networks are, in general, more accurate. Some preliminary results are given for a linear-graph, state-variable-based modeling approach to the study of the stability of space-based power distribution networks.

Halpin, S. M.↗

Empirical comparison of heuristic load distribution in point-to-point multicomputer networks

The study compared several load placement algorithms using instrumented programs and synthetic program models. Salient characteristics of these program traces (total computation time, total number of messages sent, and average message time) span two orders of magnitude. Load distribution algorithms determine the initial placement for processes, a precursor to the more general problem of load redistribution. It is found that desirable workload distribution strategies will place new processes globally, rather than locally, to spread processes rapidly, but that local information should be used to refine global placement.

Grunwald, Dirk C.↗

Implicit treatment of diffusion terms in lower-upper algorithms

A method is presented which allows diffusion terms to be treated implicitly in the lower-upper (LU) algorithm (which is a commonly used method for solving 'compressible' Euler and Navier-Stokes equations) so that the algorithm's good stability properties will not be impaired. The new method generalizes the concept of LU factorization from that associated with the sign of eigenvalues to that associated with backward- and forward-difference operators without regard to eigenvalues. The method is verified in a turbulent boundary layer study.

Shih, T. I.-P.↗