Search NASA⌕ Search

SEARCH · Search NASA

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 199 records · Page 11

Complex generalized minimal residual algorithm for iterative solution of quantum-mechanical reactive scattering equations

Complex dense matrices corresponding to the D + H2 and O + HD reactions were solved using a complex generalized minimal residual (GMRes) algorithm described by Saad and Schultz (1986) and Saad (1990). To provide a test case with a different structure, the H + H2 system was also considered. It is shown that the computational effort for solutions with the GMRes algorithm depends on the dimension of the linear system, the total energy of the scattering problem, and the accuracy criterion. In several cases with dimensions in the range 1110-5632, the GMRes algorithm outperformed the LAPACK direct solver, with speedups for the linear equation solution as large as a factor of 23.

Chatfield, David C.↗

A New Proposal Generalized Predictive Control Algorithm With Polynomial Reference Tracking Applied for Sodium Fast Reactors

This paper proposes a generalized predictive control (GPC) with constraints and orthonormal Laguerre functions using the simplified model of the primary system (reactor core and intermediate heat exchanger (IHX)) of a prototypical sodium fast reactor (SFR). This paper develops a multiple-input multiple-output (MIMO) GPC with input constraints able to track polynomial references of any degree applied in coolant temperature difference across the core and fractional power. The manipulated variables of the GPC-SFR are the reactivity and the sodium flow rate of the primary and secondary pipes. Moreover, orthonormal Laguerre functions and step down condition number techniques were also applied to avoid the numerical ill-conditioning issue in quadratic programming of large systems. Thus, a GPC type-2 was designed to control fractional power, coolant temperature difference across the core and sodium tank temperature of the SFR primary system when temperature references change according to a linear ramp after reaching their steady-state operation, sustaining 100% power operation on the reactor. In order to analyze the load tracking capability of the GPC-SFR type-2, the load following from 100% fractional power (FP) to 60% FP at 0.8% FP/min rate is simulated. Constraints on the rate of coolant temperature difference across the core and reactivity were applied for the design safety. For comparison criteria, this paper compares the GPC-SFR type-2 with the GPC-SFR type-1, i.e., standard model predictive control (MPC), to verify the viability and superior performance of the proposal regarding: (a) ramp-tracking capability of temperature and load; (b) the rejections of a reactivity disturbance of -1 cent and a secondary sodium inlet temperature disturbance of +10°F; and (c) a simulation with uncertainty in reactor design. The simulations show that the GPC-SFR type-2 overcome the GPC-SFR type-1 robustness and performance.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Neutron source reconstruction using a generalized expectation–maximization algorithm on one-dimensional neutron images from the Z facility

Magnetized Liner Inertial Fusion experiments have been performed at the Z facility at Sandia National Laboratories. These experiments use deuterium fuel, which produces 2.45 MeV neutrons on reaching thermonuclear conditions. To study the spatial structure of neutron production, the one-dimensional imager of neutrons diagnostic was fielded to record axial resolved neutron images. In this diagnostic, neutrons passing through a rolled edge aperture form an image on a CR-39-based solid state nuclear track detector. In this report we present a modified generalized expectation–maximization algorithm to reconstruct an axial neutron emission profile of the stagnated fusion plasma. We validate the approach by comparing the reconstructed neutron emission profile to an x-ray emission profile provided by a time-integrated pinhole camera.

47 OTHER INSTRUMENTATION↗

Low synchronization Gram–Schmidt and generalized minimal residual algorithms

The Gram–Schmidt process uses orthogonal projection to construct the A = QR factorization of a matrix. When Q has linearly independent columns, the operator P = I - Q(QTQ)-1QT defines an orthogonal projection onto Q⊥. In finite precision, Q loses orthogonality as the factorization progresses. A family of approximate projections is derived with the form P = I - QTQT, with correction matrix T. When T = (QTQ)-1, and T is triangular, it is postulated that the best achievable orthogonality is $\mathcal{O}(ε)\mathcal{K}(A)$. We present new variants of modified (MGS) and classical Gram–Schmidt algorithms that require one global reduction step. An interesting form of the projector leads to a compact WY representation for MGS. In particular, the inverse compact WY MGS algorithm is equivalent to a lower triangular solve. Our main contribution is to introduce a backward normalization lag into the compact WY representation, resulting in a $\mathcal{O}(ε)\mathcal{K}[r_0, AV_m])$ stable Generalized Minimal Residual Method (GMRES) algorithm that requires only one global reduce per iteration. Finally, further improvements in performance are achieved by accelerating GMRES on GPUs.

97 MATHEMATICS AND COMPUTING↗

Analytic and algorithmic aspects of generalized harmonic sums and polylogarithms

In recent three-loop calculations of massive Feynman integrals within Quantum Chromodynamics (QCD) and, e.g., in recent combinatorial problems the so-called generalized harmonic sums (in short S-sums) arise. They are characterized by rational (or real) numerator weights also different from ±1. In this article we explore the algorithmic and analytic properties of these sums systematically. We work out the Mellin and inverse Mellin transform which connects the sums under consideration with the associated Poincaré iterated integrals, also called generalized harmonic polylogarithms. In this regard, we obtain explicit analytic continuations by means of asymptotic expansions of the S-sums which started to occur frequently in current QCD calculations. In addition, we derive algebraic and structural relations, like differentiation with respect to the external summation index and different multi-argument relations, for the compactification of S-sum expressions. Finally, we calculate algebraic relations for infinite S-sums, or equivalently for generalized harmonic polylogarithms evaluated at special values. The corresponding algorithms and relations are encoded in the computer algebra package HarmonicSums.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Reaction rates for a generalized reaction-diffusion master equation

It has been established that there is an inherent limit to the accuracy of the reaction-diffusion master equation. Specifically, there exists a fundamental lower bound on the mesh size, below which the accuracy deteriorates as the mesh is refined further. In this paper we extend the standard reaction-diffusion master equation to allow molecules occupying neighboring voxels to react, in contrast to the traditional approach in which molecules react only when occupying the same voxel. We derive reaction rates, in two dimensions as well as three dimensions, to obtain an optimal match to the more fine-grained Smoluchowski model, and show in two numerical examples that the extended algorithm is accurate for a wide range of mesh sizes, allowing us to simulate systems that are intractable with the standard reaction-diffusion master equation. In addition, we show that for mesh sizes above the fundamental lower limit of the standard algorithm, the generalized algorithm reduces to the standard algorithm. We derive a lower limit for the generalized algorithm which, in both two dimensions and three dimensions, is on the order of the reaction radius of a reacting pair of molecules.

74 ATOMIC AND MOLECULAR PHYSICS↗

Application of two-point implicit central-difference methods to hyperbolic systems

This paper presents a general solution algorithm for the set of difference equations that arise when two-point central differences are used to approximate the flux difference terms in systems of hyperbolic differential equations. The general algorithm eliminates the weak points associated with the nonstandard algorithm reported by Wornom and Hafez (1986). The disadvantages of their algorithm relate to its implementation. It consists of separate algorithms for subsonic, supersonic, sonic and shock cells, applied individually, which presents a major bookkeeping problem when multiple sonic and shock cells are present. The general algorithm eliminates this problem and introduces an improved shock treatment which produces shocks with at most one interior shock point.

Wornom, Stephen F.↗

Application Of A Control Algorithm To Vertical-Up Welding

Report describes application of generalized control algorithm for automatic robotic arc welding in vertical-up configuration. Applicable to variety of welding processes, previously applied to welding in downhand configuration. Generalized algorithm and application to downhand welding described in "Method for Automatic Downhand Welding" (MFS-27209).

Fernandez, Kenneth R.↗

Control Effector Unsaturation Modification to the Cascading Generalized Inverse Control Allocation Algorithm

Control allocation has sufficiently progressed such that it is used in front-line fighter aircraft such as the F-18Superhornet and the F-35 Joint Strike Fighter. Published literature shows the F-35 utilizes Nonlinear Dynamic Inversion in conjunction with an Effector Blender that incorporates the Cascading Generalized Inverse control allocation algorithm. While the Cascading Generalized Inverse algorithm is one of the premier generalized inverse methods, it does suffer from three deficiencies. In particular, it suffers from an inability to achieve some desired outcomes, it intermittently provides non-optimal solutions and generally fails to preserve moment direction near maximal achievable moments. An effector unsaturation method based on a Scalar Difference Quadratic was first introduced and implemented on the iterative Prediction Method control allocation algorithm which was shown to consistently achieve optimal (weighted) control allocation solutions throughout the entire Attainable Moment Set while preserving desired moment direction. In this paper, the shortcomings of the Cascading Generalized Inverse algorithm are addressed by augmenting the baseline algorithm with Scalar Difference Quadratic unsaturation identification and location at each iteration. Numerical case studies demonstrate that the Modified Cascading Generalized Inverse algorithm resolves the aforementioned deficiencies.

Michael J Acheson↗

An algorithm for a general class of routing problems derived from Huygens' principle

If a set of N points or nodes with a nonnegative cost associated with each ordered pair is known, it is desired to find a path from one given node to another given node which minimizes the cost sum. An algorithm is presented which yields a global minimum solution after at most N - 1 iterations or on a typical large third-generation computer, after 1 hour of computation time for a 10,000-node problem. The rapid-access data storage capacity demanded by the algorithm is approximately 3N words for costs read in from slow-access storage or 2N words for calculable costs. The time-storage requirements of the algorithm known to the authors. When the problem is viewed as a discretized optimal control problem, after N-1 iterations, an optimal control or node transition is established for each of the N nodes or states; thus, the algorithm can be applied to situations were there may be errors in the control that necessitate a closed loop control that necessitate a closed loop control philosophy.

Avis, L. M.↗

A charge-density-based general cation insertion algorithm for generating new Li-ion cathode materials

Future lithium (Li) energy storage technologies, in particular solid-state configurations with a Li metal anode, opens up the possibility of using cathode materials that do not necessarily contain Li in its as-made state. To accelerate the discovery and design of such materials, we develop a general, chemically, and structurally agnostic methodology for identifying the optimal Li sites in any crystalline material. For a given crystal structure, we attempt multiple Li insertions at symmetrically in-equivalent positions by analyzing the electronic charge density obtained from first-principles density functional theory. In this report, we demonstrate the effectiveness of this procedure in successfully identifying the positions of the Li ion in well-known cathode materials using only the empty host (charged) material as guidance. Furthermore, applying the algorithm to over 2000 candidate cathode empty host materials we obtain statistics of Li site preferences to guide future developments of novel Li-ion cathode materials, particularly for solid-state applications.

25 ENERGY STORAGE↗

Improved shape-signature and matching methods for model-based robotic vision

Researchers describe new techniques for curve matching and model-based object recognition, which are based on the notion of shape-signature. The signature which researchers use is an approximation of pointwise curvature. Described here is curve matching algorithm which generalizes a previous algorithm which was developed using this signature, allowing improvement and generalization of a previous model-based object recognition scheme. The results and the experiments described relate to 2-D images. However, natural extensions to the 3-D case exist and are being developed.

Schwartz, J. T.↗

A Graph Based Backtracking Algorithm for Solving General CSPs

Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complete task in general, tractable classes of CSPs have been identified based on the structure of the underlying constraint graphs. Much effort has been spent on exploiting structural properties of the constraint graph to improve the efficiency of finding a solution. These efforts contributed to development of a class of CSP solving algorithms called decomposition algorithms. The strength of CSP decomposition is that its worst-case complexity depends on the structural properties of the constraint graph and is usually better than the worst-case complexity of search methods. Its practical application is limited, however, since it cannot be applied if the CSP is not decomposable. In this paper, we propose a graph based backtracking algorithm called omega-CDBT, which shares merits and overcomes the weaknesses of both decomposition and search approaches.

Pang, Wanlin↗

Evaluation of a generalized least squares algorithm for infrasound beamforming with coherent background noise

Infrasonic signals of interest can occur during periods with persistent, coherent, background noise, which may be natural or anthropogenic. For high signal-to-noise (SNR) ratio transient signals, an ‘overprinting’ of the coherent background may occur, and the signal may still be detected. However, this approach fails for low SNR signals of interest, which may be obscured by coherent noise. An infrasound beamforming method based on generalized least squares (GLS) is investigated for detecting transient signals of interest in the presence of coherent and incoherent background noise. This approach relies on an estimate of the noise covariance, captured in a covariance matrix, to effectively null contributions to the array response from noisy directions of arrival. Synthetic array data is used to investigate the performance of the GLS beamformer compared to the Bartlett beamformer when coherent and incoherent backgrounds are present. Additionally, the effects of array element number and relative strength of the interfering signal on the GLS estimates is investigated. GLS empirical area under the curve estimates suggest that the beamformer can recover coherent power for a signal of interest lower in amplitude than the coherent background, but this effectiveness degrades more quickly with SNR for a four element array compared to a six or eight element infrasound array. Finally, infrasound from the Forensic Surface Experiment, a bolide signal observed at IMS array I37NO, and a volcanic signal recorded at the Alaska Volcano Observatory array ADKI are used to evaluate GLS performance on recorded data. A ten minute window was used to capture the background noise, and the coherent background signal was nulled in all three examples.

58 GEOSCIENCES↗

An Optimizing Space Data-Communications Scheduling Method and Algorithm with Interference Mitigation, Generalized for a Broad Class of Optimization Problems

NASA's space data-communications infrastructure-the Space Network and the Ground Network-provide scheduled (as well as some limited types of unscheduled) data-communications services to user spacecraft. The Space Network operates several orbiting geostationary platforms (the Tracking and Data Relay Satellite System (TDRSS)), each with its own servicedelivery antennas onboard. The Ground Network operates service-delivery antennas at ground stations located around the world. Together, these networks enable data transfer between user spacecraft and their mission control centers on Earth. Scheduling data-communications events for spacecraft that use the NASA communications infrastructure-the relay satellites and the ground stations-can be accomplished today with software having an operational heritage dating from the 1980s or earlier. An implementation of the scheduling methods and algorithms disclosed and formally specified herein will produce globally optimized schedules with not only optimized service delivery by the space data-communications infrastructure but also optimized satisfaction of all user requirements and prescribed constraints, including radio frequency interference (RFI) constraints. Evolutionary algorithms, a class of probabilistic strategies for searching large solution spaces, is the essential technology invoked and exploited in this disclosure. Also disclosed are secondary methods and algorithms for optimizing the execution efficiency of the schedule-generation algorithms themselves. The scheduling methods and algorithms as presented are adaptable to accommodate the complexity of scheduling the civilian and/or military data-communications infrastructure within the expected range of future users and space- or ground-based service-delivery assets. Finally, the problem itself, and the methods and algorithms, are generalized and specified formally. The generalized methods and algorithms are applicable to a very broad class of combinatorial-optimization problems that encompasses, among many others, the problem of generating optimal space-data communications schedules.

ground stations↗

LAWS simulation: Sampling strategies and wind computation algorithms

In general, work has continued on developing and evaluating algorithms designed to manage the Laser Atmospheric Wind Sounder (LAWS) lidar pulses and to compute the horizontal wind vectors from the line-of-sight (LOS) measurements. These efforts fall into three categories: Improvements to the shot management and multi-pair algorithms (SMA/MPA); observing system simulation experiments; and ground-based simulations of LAWS.

Emmitt, G. D. A.↗

Evaluation of several navigation algorithms for application to general aviation

Using data obtained in flight, three position determining algorithms for use by general aviation aircraft were evaluated representing increasing software requirements. These were a DME only, DME/air data and blended DME/air data. Although each step represented additional software with resultant increase in position accuracy, all could be performed on a programmable electronic desk calculator. Results from the computation of aircraft position using the three algorithms are presented. The algorithms employed can be extended to accept VOR, TACAN bearing, ADF, or other NAVAID Data. To obtain the flight data an experimental system was configured and flown on a general aviation aircraft. Principal hardware elements (all with low-cost potential) were a programmable calculator, a single DME receiver (multiplexed for multiple DME use) and a low-cost air speed sensor (shed-vortex principle). The flight test demonstrated satisfactory performance of these principal elements.

Conrad, B.↗

Multiphysics simulation of corona discharge induced ionic wind

Ionic wind devices or electrostatic fluid accelerators are becoming of increasing interest as tools for thermal management, in particular for semiconductor devices. In this work, we present a numerical model for predicting the performance of such devices; its main benefit is the ability to accurately predict the amount of charge injected from the corona electrode. Our multiphysics numerical model consists of a highly nonlinear, strongly coupled set of partial differential equations including the Navier-Stokes equations for fluid flow, Poisson's equation for electrostatic potential, charge continuity, and heat transfer equations. To solve this system we employ a staggered solution algorithm that generalizes Gummel's algorithm for charge transport in semiconductors. Predictions of our simulations are verified and validated by comparison with experimental measurements of integral physical quantities, which are shown to closely match.

36 MATERIALS SCIENCE↗