On an improved generalized inverse algorithm for linear inequalities
Iterative, two-class algorithm for linear inequalities
SEARCH · Engineering Papers
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.
Iterative, two-class algorithm for linear inequalities
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.
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.
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.
Abstract Not Provided
Abstract not provided.
Explore the source record for details and available documents.
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.
We present a unifying framework to study physical systems which exhibit topological quantum order (TQO). The major guiding principle behind our approach is that of symmetries and entanglement. These symmetries may be actual symmetries of the Hamiltonian characterizing the system, or emergent symmetries. To this end, we introduce the concept of low-dimensional Gauge-like symmetries (GLSs), and the physical conservation laws (including topological terms, fractionalization, and the absence of quasi-particle excitations) which emerge from them. We prove then sufficient conditions for TQO at both zero and finite temperatures. The physical engine for TQO are topological defects associated with the restoration of GLSs. These defects propagate freely through the system and enforce TQO. Our results are strongest for gapped systems with continuous GLSs. At zero temperature, selection rules associated with the GLSs enable us to systematically construct general states with TQO; these selection rules do not rely on the existence of a finite gap between the ground states to all other excited states. Indices associated with these symmetries correspond to different topological sectors. All currently known examples of TQO display GLSs. Other systems exhibiting such symmetries include Hamiltonians depicting orbital-dependent spin-exchange and Jahn-Teller effects in transition metal orbital compounds, short-range frustrated Klein spin models, and p+ip superconducting arrays. The symmetry based framework discussed herein allows us to go beyond standard topological field theories and systematically engineer new physical models with finite temperature TQO (both Abelian and non-Abelian). Furthermore, we analyze the insufficiency of entanglement entropy (we introduce SU(N) Klein models on small world networks to make the argument even sharper), spectral structures, maximal string correlators, and fractionalization in establishing TQO. We show that Kitaev's Toric code model and Wen's plaquette model are equivalent and reduce, by a duality mapping, to an Ising chain, demonstrating that despite the spectral gap in these systems the toric operator expectation values may vanish once thermal fluctuations are present. This illustrates the fact that the quantum states themselves in a particular (operator language) representation encode TQO and that the duality mappings, being non-local in the original representation, disentangle the order. We present a general algorithm for the construction of long-range string and brane orders in general systems with entangled ground states; this algorithm relies on general ground states selection rules and becomes of the broadest applicability in gapped systems in arbitrary dimensions. We exactly recast some known non-local string correlators in terms of local correlation functions. We discuss relations to problems in graph theory.
Tomography has made a radical impact on diverse fields ranging from the study of 3D atomic arrangements in matter to the study of human health in medicine. Despite its very diverse applications, the core of tomography remains the same, that is, a mathematical method must be implemented to reconstruct the 3D structure of an object from a number of 2D projections. Here, we present the mathematical implementation of a tomographic algorithm, termed GENeralized Fourier Iterative REconstruction (GENFIRE), for high-resolution 3D reconstruction from a limited number of 2D projections. GENFIRE first assembles a 3D Fourier grid with oversampling and then iterates between real and reciprocal space to search for a global solution that is concurrently consistent with the measured data and general physical constraints. The algorithm requires minimal human intervention and also incorporates angular refinement to reduce the tilt angle error. We demonstrate that GENFIRE can produce superior results relative to several other popular tomographic reconstruction techniques through numerical simulations and by experimentally reconstructing the 3D structure of a porous material and a frozen-hydrated marine cyanobacterium. As a result, equipped with a graphical user interface, GENFIRE is freely available from our website and is expected to find broad applications across different disciplines.
State-of-the-art atomic and optical clocks have the great potential to precisely test fundamental physical assumptions and enhance our understanding of nature. Their widespread applications require us to rigorously deduce the relativistic frequency shift in the framework of general relativity. One interesting question for clocks is tidal field effect which contains variously periodic variations. By introducing tidally deformed Earth, the general algorithms for clock and frequency comparisons are derived. We investigate the effects of external gravitational bodies and Earth’s tidal deformation on the ground- and space-based clocks. The orbital elements of satellite and locations of laboratory are introduced for corresponding clocks, in which the secular and long-period terms and short-period terms are subsequently presented. These effects called tidal clock effects produce the non-negligible contributions in the modern clock experiments and can be directly evaluated from our parameterized formulas. In addition, we also demonstrate for tidal clock effects the position and distance dependences, as well as periodicity. These tidal effects and dependences can provide valuable information for the clock comparison experiments.
The goal of this work is to develop a fast computed tomography (CT) reconstruction algorithm based on graphics processing units (GPU) that achieves significant improvement over traditional central processing unit (CPU) based implementations. The main challenge in developing a CT algorithm that is capable of handling very large datasets is parallelizing the algorithm in such a way that data transfer does not hinder performance of the reconstruction algorithm. General Purpose Graphics Processing (GPGPU) is a new technology that the Science and Technology (S&T) community is starting to adopt in many fields where CPU-based computing is the norm. GPGPU programming requires a new approach to algorithm development that utilizes massively multi-threaded environments. Multi-threaded algorithms in general are difficult to optimize since performance bottlenecks occur that are non-existent in single-threaded algorithms such as memory latencies. If an efficient GPU-based CT reconstruction algorithm can be developed; computational times could be improved by a factor of 20. Additionally, cost benefits will be realized as commodity graphics hardware could potentially replace expensive supercomputers and high-end workstations. This project will take advantage of the CUDA programming environment and attempt to parallelize the task in such a way that multiple slices of the reconstruction volume are computed simultaneously. This work will also take advantage of the GPU memory by utilizing asynchronous memory transfers, GPU texture memory, and (when possible) pinned host memory so that the memory transfer bottleneck inherent to GPGPU is amortized. Additionally, this work will take advantage of GPU-specific hardware (i.e. fast texture memory, pixel-pipelines, hardware interpolators, and varying memory hierarchy) that will allow for additional performance improvements.
We developed a general algorithm for online optimization of accelerator performance, i.e., online tuning, using the performance measure as the objective function. This method, named robust conjugate direction search (RCDS), combines the conjugate direction set approach of Powell's method with a robust line optimizer which considers the random noise in bracketing the minimum and uses parabolic fit of data points that uniformly sample the bracketed zone. Moreover, it is much more robust against noise than traditional algorithms and is therefore suitable for online application. Simulation and experimental studies have been carried out to demonstrate the strength of the new algorithm.
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.
The planar generalized Yee (PGY) algorithm is an extension of the generalized Yee-algorithm and.
We develop a general algorithm for the analysis the spectral stability of generalized multistage Runge–Kutta methods of various orders of accuracy as applied to the numerical integration with respect to time of an initial-boundary-value problem for the second-order parabolic equation. The expression for the function of spectral stability is obtained in two alternative forms: on the basis of matrix relations and in the determinant form. We study specific realizations of various generalized explicit Runge–Kutta methods and their spectral stability. It is shown that all explicit generalized Runge–Kutta methods possess the property of conditional spectral stability and the property of conditional monotonicity of the numerical solution in time whose violation leads to the appearance of false oscillations of the approximate solution. The stability function for these methods is polynomial. It is shown that the application of two-stage generalized explicit Runge–Kutta methods leads to the appearance of predictor-corrector-type schemes. In the case of nonstationary one-dimensional heat-conduction problem, on the basis of a one-stage generalized Runge–Kutta method, we obtain the classical two-layer conditionally stable explicit finite-difference scheme on a four-point template. It is demonstrated that the five-stage generalized Runge–Kutta–Merson method is characterized by the weakest condition of spectral stability as compared with all investigated explicit generalized Runge–Kutta methods.
We present our development of a series of efficient computation algorithms, generally usable to calculate light diffraction and particularly for speckle pattern simulation. We use mainly the scalar diffraction theory in the form of Rayleigh-Sommerfeld diffraction formula and its Fresnel approximation. Our algorithms are based on a special form of the convolution theorem and the Fast Fourier Transform. They are able to evaluate the diffraction formula much faster than by direct computation and we have circumvented the restrictions regarding the relative sizes of the input and output domains, met on commonly used procedures. Moreover, the input and output planes can be tilted each to other and the output domain can be off-axis shifted.
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.