An improved generalized inverse algorithm for linear inequalities and its applications
Iterative, two-class algorithm for linear inequalities
Geary, L. C.↗
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.
On an improved generalized inverse algorithm for linear inequalities
Iterative, two-class algorithm for linear inequalities
Source record↗
Issues in the development of a general design algorithm for reliable failure detection
The design of residual-generation processes is briefly discussed, the goal being to develop a methodology for designing robust processes of this type. It is noted that analytical redundancy forms the basis for residual-generation, representing the relationships between the outputs of sensors and inputs of actuators via the dynamics of the system. It is because of this relationship that sensor outputs (even those of dissimilar sensors and at different times) can, in effect, be compared to ascertain whether they are consistent with normal system behavior. The residuals can be seen as constituting the discrepancy between the output resulting from such comparisons; they should display noise-like characteristics only in the normal mode. Failures in the system would lead to a discrepancy between the observed and expected behavior of the sensor outputs and hence to abnormal characteristics (failure signatures) in the residual.
Chow, E. Y.↗
General purpose algorithms for characterization of slow and fast phase nystagmus
In the overall aim for a better understanding of the vestibular and optokinetic systems and their roles in space motion sickness, the eye movement responses to various dynamic stimuli are measured. The vestibulo-ocular reflex (VOR) and the optokinetic response, as the eye movement responses are known, consist of slow phase and fast phase nystagmus. The specific objective is to develop software programs necessary to characterize the vestibulo-ocular and optokinetic responses by distinguishing between the two phases of nystagmus. The overall program is to handle large volumes of highly variable data with minimum operator interaction. The programs include digital filters, differentiation, identification of fast phases, and reconstruction of the slow phase with a least squares fit such that sinusoidal or psuedorandom data may be processed with accurate results. The resultant waveform, slow phase velocity eye movements, serves as input data to the spectral analysis programs previously developed for NASA to analyze nystagmus responses to pseudorandom angular velocity inputs.
Lessard, Charles S.↗
A class of fast staircase algorithms for generalized state-space systems
Several methods are presented for defining generalized state space models (GSSM), with emphasis on 'fast' techniques for transforming GSSMs to condensed state space models (SSM). The fast forms are configured to yield invariant transfer functions. Details of the decomposition process are summarized in terms of the determination of eigenvalues which are separated within staircase matrices. Applications of the techniques are illustrated through implementation of a unimodular transformation which does not affect the finite eigenvalues, by demonstrating deadbeat control of a GSSM, which the definition of a reduced observer of a GSSM, and by embedding a polynomial matrix into a unimodular matrix.
Beelen, T.↗
Time-domain analysis of planar microstrip devices using a generalized Yee-algorithm based on unstructured grids
The generalized Yee-algorithm is presented for the temporal full-wave analysis of planar microstrip devices. This algorithm has the significant advantage over the traditional Yee-algorithm in that it is based on unstructured and irregular grids. The robustness of the generalized Yee-algorithm is that structures that contain curved conductors or complex three-dimensional geometries can be more accurately, and much more conveniently modeled using standard automatic grid generation techniques. This generalized Yee-algorithm is based on the the time-marching solution of the discrete form of Maxwell's equations in their integral form. To this end, the electric and magnetic fields are discretized over a dual, irregular, and unstructured grid. The primary grid is assumed to be composed of general fitted polyhedra distributed throughout the volume. The secondary grid (or dual grid) is built up of the closed polyhedra whose edges connect the centroid's of adjacent primary cells, penetrating shared faces. Faraday's law and Ampere's law are used to update the fields normal to the primary and secondary grid faces, respectively. Subsequently, a correction scheme is introduced to project the normal fields onto the grid edges. It is shown that this scheme is stable, maintains second-order accuracy, and preserves the divergenceless nature of the flux densities. Finally, for computational efficiency the algorithm is structured as a series of sparse matrix-vector multiplications. Based on this scheme, the generalized Yee-algorithm has been implemented on vector and parallel high performance computers in a highly efficient manner.
Gedney, Stephen D.↗
Reliable algorithm for modal decomposition
This paper describes a reliable, general algorithm for modal decomposition in real arithmetic and its use in analyzing and synthesizing control logic for linear dynamic systems. The numerical difficulties are described associated with computing the Jordan canonical form when the system has repeated, or nearly repeated, eigenvalues. A new algorithm is described that satisfactorily solves these numerical difficulties. The relation and extension to related numerical analysis research are discussed to clarify the reliability of the techniques. Finally, its implementation as a practical modal decomposition method for efficiently computing the matrix exponential, transfer functions, and frequency response is also described.
Walker, Robert A.↗
A Parallel Planar Generalized Yee-Algorithm for the Analysis of Microwave Circuit Devices
The planar generalized Yee (PGY) algorithm is an extension of the generalized Yee-algorithm and.
Microwave Circuit Devices↗
Mixture densities, maximum likelihood, and the EM algorithm
The problem of estimating the parameters which determine a mixture density is reviewed as well as maximum likelihood estimation for it. A particular iterative procedure for numerically approximating maximum likelihood estimates for mixture density problems is considered. This EM algorithm, is a specialization to the mixture density context of a general algorithm of the same name used to approximate maximum likelihood estimates for incomplete data problems. The formulation and theoretical and practical properties of the EM algorithm for mixture densities are discussed focussing in particular on mixtures of densities from exponential families.
Redner, R. A.↗
Improved algorithms for mapping pipelined and parallel computations
Recent work on the problem of mapping pipelined or parallel computations onto linear array, shared memory, and host-satellite systems is extended. It is shown how these problems can be solved even more efficiently when computation module execution times are bounded from below, intermodule communication times are bounded from above, and the processors satisfy certain homogeneity constraints. The improved algorithms have significantly lower time and space complexities than the more general algorithms: in one case, an O(nm3) time algorithm for mapping m modules onto n processors is replaced with an O(nm log m) time algorithm, and the space requirements are reduced from O(nm2) to O(m). Run-time complexity is reduced further with parallel mapping algorithms based on these improvements, which run on the architectures for which they create mappings.
Nicol, David M.↗
A parameter-estimation subroutine package
Estimation subroutine package comprises fast, efficient, and simple least-squares data-processing algorithms for use in orbit determination and related analyses. Very reliable and general algorithms have been documented. Package contains collection of streamlined subroutines that can be used to solve large variety of parameter-estimation and filtering problems. Special routines are included for problems with colored process noise and covariance (factor) mapping.
Bierman, G.↗
Improvement of Aerosol Optical Depth Retrieval from MODIS Spectral Reflectance over the Global Ocean Using New Aerosol Models Archived from AERONET Inversion Data and Tri-axial Ellipsoidal Dust Database
New over-ocean aerosol models are developed by integrating the inversion data from the Aerosol Robotic Network (AERONET) sun/sky radiometers with a database for the optical properties of tri-axial ellipsoid particles. The new aerosol models allow more accurate retrieval of aerosol optical depth (AOD) from the Moderate Resolution Imaging Spectroradiometer (MODIS) in the case of high AOD (AOD greater than 0.3). The aerosol models are categorized by using the fine-mode fraction (FMF) at 550 nm and the singlescattering albedo (SSA) at 440 nm from the AERONET inversion data to include a variety of aerosol types found around the globe. For each aerosol model, the changes in the aerosol optical properties (AOPs) as functions of AOD are considered to better represent aerosol characteristics. Comparisons of AODs between AERONET and MODIS for the period from 2003 to 2010 show that the use of the new aerosol models enhances the AOD accuracy with a Pearson coefficient of 0.93 and a regression slope of 0.99 compared to 0.92 and 0.85 calculated using the MODIS Collection 5 data. Moreover, the percentage of data within an expected error of +/-(0.03 + 0.05xAOD) is increased from 62 percent to 64 percent for overall data and from 39 percent to 51 percent for AOD greater than 0.3. Errors in the retrieved AOD are further characterized with respect to the Angstrom exponent (AE), scattering angle, SSA, and air mass factor (AMF). Due to more realistic AOPs assumptions, the new algorithm generally reduces systematic errors in the retrieved AODs compared with the current operational algorithm. In particular, the underestimation of fine-dominated AOD and the scattering angle dependence of dust-dominated AOD are significantly mitigated as results of the new algorithm's improved treatment of aerosol size distribution and dust particle nonsphericity.
aerosol optical depth↗
A General Event Location Algorithm with Applications to Eclispe and Station Line-of-Sight
A general-purpose algorithm for the detection and location of orbital events is developed. The proposed algorithm reduces the problem to a global root-finding problem by mapping events of interest (such as eclipses, station access events, etc.) to continuous, differentiable event functions. A stepping algorithm and a bracketing algorithm are used to detect and locate the roots. Examples of event functions and the stepping/bracketing algorithms are discussed, along with results indicating performance and accuracy in comparison to commercial tools across a variety of trajectories.
Parker, Joel J. K.↗
A General Event Location Algorithm with Applications to Eclipse and Station Line-of-Sight
A general-purpose algorithm for the detection and location of orbital events is developed. The proposed algorithm reduces the problem to a global root-finding problem by mapping events of interest (such as eclipses, station access events, etc.) to continuous, differentiable event functions. A stepping algorithm and a bracketing algorithm are used to detect and locate the roots. Examples of event functions and the stepping/bracketing algorithms are discussed, along with results indicating performance and accuracy in comparison to commercial tools across a variety of trajectories.
Parker, Joel J. K.↗
An Evaluation of a Flight Deck Interval Management Algorithm Including Delayed Target Trajectories
NASA's first Air Traffic Management (ATM) Technology Demonstration (ATD-1) was created to facilitate the transition of mature air traffic management technologies from the laboratory to operational use. The technologies selected for demonstration are the Traffic Management Advisor with Terminal Metering (TMA-TM), which provides precise timebased scheduling in the terminal airspace; Controller Managed Spacing (CMS), which provides controllers with decision support tools enabling precise schedule conformance; and Interval Management (IM), which consists of flight deck automation that enables aircraft to achieve or maintain precise in-trail spacing. During high demand operations, TMA-TM may produce a schedule and corresponding aircraft trajectories that include delay to ensure that a particular aircraft will be properly spaced from other aircraft at each schedule waypoint. These delayed trajectories are not communicated to the automation onboard the aircraft, forcing the IM aircraft to use the published speeds to estimate the target aircraft's estimated time of arrival. As a result, the aircraft performing IM operations may follow an aircraft whose TMA-TM generated trajectories have substantial speed deviations from the speeds expected by the spacing algorithm. Previous spacing algorithms were not designed to handle this magnitude of uncertainty. A simulation was conducted to examine a modified spacing algorithm with the ability to follow aircraft flying delayed trajectories. The simulation investigated the use of the new spacing algorithm with various delayed speed profiles and wind conditions, as well as several other variables designed to simulate real-life variability. The results and conclusions of this study indicate that the new spacing algorithm generally exhibits good performance; however, some types of target aircraft speed profiles can cause the spacing algorithm to command less than optimal speed control behavior.
Swieringa, Kurt A.↗
Single-shot Quantum Signal Processing Interferometry
Quantum systems of infinite dimension, such as bosonic oscillators, provide vast resources for quantum sensing. Yet, a general theory on how to manipulate such bosonic modes for sensing beyond parameter estimation is unknown. We present a general algorithmic framework, quantum signal processing interferometry (QSPI), for quantum sensing at the fundamental limits of quantum mechanics by generalizing Ramsey-type interferometry. Our QSPI sensing protocol relies on performing nonlinear polynomial transformations on the oscillator's quadrature operators by generalizing quantum signal processing (QSP) from qubits to hybrid qubit-oscillator systems. We use our QSPI sensing framework to make efficient binary decisions on a displacement channel in the single-shot limit. Theoretical analysis suggests the sensing accuracy, given a single-shot qubit measurement, scales inversely with the sensing time or circuit depth of the algorithm. We further concatenate a series of such binary decisions to perform parameter estimation in a bit-by-bit fashion. Numerical simulations are performed to support these statements. Our QSPI protocol offers a unified framework for quantum sensing using continuous-variable bosonic systems beyond parameter estimation and establishes a promising avenue toward efficient and scalable quantum control and quantum sensing schemes beyond the NISQ era.
Physics↗
An intrinsically n-dimensional generalized flux vector splitting implicit finite element Euler algorithm
A generalized flux-vector splitting implicit Galerkin finite-element algorithm for the Euler equations in curvilinear coordinates for ideal and reacting gases is derived. For an arbitrary equation of state, the curvilinear-coordinate flux vector is split in kinematic and kinetic components, and the associated jacobian matrix eigenvalues explicitly depend on the metric data. After directional semidiscretization, the terminal ordinary differential-equation system is solved via a nonlinearly stable implicit Runge-Kutta scheme in concert with an accurate tensor matrix product factorization. The results for selected two-dimensional supersonic and axisymmetric hypersonic flows validate the algorithm and verify its robustness for curvilinear-coordinate computations. The evolution towards a steady state is achieved for large Courant numbers without indication of numerical instabilities.
Iannelli, G. S.↗
An extension of the QZ algorithm for solving the generalized matrix eigenvalue problem
This algorithm is an extension of Moler and Stewart's QZ algorithm with some added features for saving time and operations. Also, some additional properties of the QR algorithm which were not practical to implement in the QZ algorithm can be generalized with the combination shift QZ algorithm. Numerous test cases are presented to give practical application tests for algorithm. Based on results, this algorithm should be preferred over existing algorithms which attempt to solve the class of generalized eigenproblems where both matrices are singular or nearly singular.
Ward, R. C.↗