Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “JORDAN FORM”

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 19 records

An algorithm for calculation of the Jordan canonical form of a matrix

Jordan canonical forms are used extensively in the literature on control systems. However, very few methods are available to compute them numerically. Most numerical methods compute a set of basis vectors in terms of which the given matrix is diagonalized when such a change of basis is possible. Here, a simple and efficient method is suggested for computing the Jordan canonical form and the corresponding transformation matrix. The method is based on the definition of a generalized eigenvector, and a natural extension of Gauss elimination techniques.

Sridhar, B.↗

On the use and computation of the Jordan canonical form in system theory

This paper investigates various aspects of the application of the Jordan canonical form of a matrix in system theory and develops a computational approach to determining the Jordan form for a given matrix. Applications include pole placement, controllability and observability studies, serving as an intermediate step in yielding other canonical forms, and theorem proving. The computational method developed in this paper is both simple and efficient. The method is based on the definition of a generalized eigenvector and a natural extension of Gauss elimination techniques. Examples are included for demonstration purposes.

Sridhar, B.↗

State-variable models of structures having rigid-body modes

In cases where the equations of motion of a structure having rigid-body freedom are cast in state-variable form, generalized state rigid-body modes may be needed. It is possible to find a linearly-independent set of generalized vectors which transform an n x n matrix into the almost-diagonal Jordan form. Attention is presently given to equations governing these generalized eigenvectors, together with illustrative examples of the damped and undamped structure cases.

Craig, Roy R., Jr.↗

Numerically efficient algorithm for model development of high-order systems

A technique for estimating transfer functions in partial fraction expansion form from frequency response data for a high-order system is presented. The problem formulation avoids many of the numerical difficulties associated with high-order polynomials and has the advantage of having the option to fix the camping and frequency of a mode, if known, during the estimation process. The resulting transfer function(s) may be converted to Jordan-Form time domain equations directly. During the implementation of this technique, a frequency and amplitude normalizing window was developed that maximized the efficiency of the optimization algorithm. The combination of estimating the transfer function in factored form, the ability to fix preciously determined parameters and the effectiveness of the normalizing window led to a progressive approach to synthesizing transfer functions from frequency response data for high-order systems.

Parada, L. O.↗

Gust alleviation using direct turbulence measurements

The research reported upon in this paper describes an effective method of gust alleviation using direct measurements of atmospheric turbulence to drive the aircraft control surfaces in a way that attempts to directly counter or cancel those forces and moments produced on the aircraft by gusts. The method yields a feedforward or open loop control law, simple to mechanize and relatively insensitive to changes in flight condition. When applied directly, the resulting control law effectively gust-alleviates in the low frequency phugoid and short period range but has a tendency to amplify structural mode vehicle motions due to the phase lag of the actuators. A method of design based upon the use of a diagonal or Jordan form of the equations of motion enables the designer to avoid this problem of structural mode excitation.

Rynaski, E. G.↗

Population Control of Self-Replicating Systems: Option C

From the conception and development of the theory of self-replicating automata by John von Neumann, others have expanded on his theories. In 1980, Georg von Tiesenhausen and Wesley A. Darbro developed a report which is a "first' in presenting the theories in a conceptualized engineering setting. In that report several options involving self-replicating systems are presented. One of the options allows each primary to generate n replicas, one in each sequential time frame after its own generation. Each replica is limited to a maximum of m ancestors. This study involves determining the state vector of the replicas in an efficient manner. The problem is cast in matrix notation, where F = fij is a non-diagonalizable matrix. Any element fij represents the number of elements of type j = (c,d) in time frame k+1 generated from type i = (a,b) in time frame k. It is then shown that the state vector is: bar F(k)=bar F (non-zero) X F sub K = bar F (non-zero) xmx J sub kx m sub-1 where J is a matrix in Jordan form having the same eigenvalues as F. M is a matrix composed of the eigenvectors and the generalized eigenvectors of F.

Mccord, R. L.↗

Solving quasi-free and quadratic Lindblad master equations for open fermionic and bosonic systems

The dynamics of Markovian open quantum systems are described by Lindblad master equations. For fermionic and bosonic systems that are quasi-free, i.e. with Hamiltonians that are quadratic in the ladder operators and Lindblad operators that are linear in the ladder operators, we derive the equation of motion for the covariance matrix. This determines the evolution of Gaussian initial states and the steady states, which are also Gaussian. Using ladder super-operators (a.k.a. third quantization), here we show how the Liouvillian can be transformed to a many-body Jordan normal form which also reveals the full many-body spectrum. Extending previous work by Prosen and Seligman, we treat fermionic and bosonic systems on equal footing with Majorana operators, shorten and complete some derivations, also address the odd-parity sector for fermions, give a criterion for the existence of bosonic steady states, cover non-diagonalizable Liouvillians also for bosons, and include quadratic systems. In extension of the quasi-free open systems, quadratic open systems comprise additional Hermitian Lindblad operators that are quadratic in the ladder operators. While Gaussian states may then evolve into non-Gaussian states, the Liouvillian can still be transformed to a useful block-triangular form, and the equations of motion for k-point Green’s functions form a closed hierarchy. Based on this formalism, results on criticality and dissipative phase transitions in such models are discussed in a companion paper.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Relaxation methods in fluid mechanics

The present work considers the iterative solution of a coupled set of difference equations and examines methods that carry successive approximates to a state that is invariant with further iteration and independent of the initial guess. Methods are studied with regard to their efficiency and economy of computer resources. The basic principles of classical relaxation are set forth, with attention confined to linear elliptic equations. This discussion involves the evaluation of the spectral radius that is the magnitude of the eigenvalue with largest modulus. The subject of relaxation is then related to the study of ordinary differential equations and hyperbolic partial differential equations. Problems that occur when linearly dependent eigenvectors appear in the relaxation matrix are discussed, leading to multiply connected eigenvalues in the Jordan canonical form. Finally, a brief survey of relaxation methods used in aerodynamics is given.

Lomax, H.↗

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.↗

Towards a classification of bifurcations in Vlasov equations

Here, we propose a classification of bifurcations of Vlasov equations, based on the strength of the resonance between the unstable mode and the continuous spectrum on the imaginary axis. We then identify and characterize a new type of generic bifurcation where this resonance is weak, but the unstable mode couples with a stable mode and a Casimir invariant of the system to form a size-3 Jordan block. We derive a three-dimensional reduced noncanonical Hamiltonian system describing this bifurcation. Comparison of the reduced dynamics with direct numerical simulations on a test case gives excellent agreement. We finally discuss the relevance of this bifurcation to specific physical situations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Mueller-Lyer decrement: practice or prolonged inspection?

Noting the similarity between the illusion decrement and selective adaptation paradigms, Long has challenged the view that illusion decrement effects reflect a strategic--as opposed to a structural--underlying mechanism, and has called for further research on this issue. To investigate the confound between prolonged free inspection and repeated trials in the standard decrement procedure, the effects of three inspection conditions (continuous, intermittent, and immediate) on the magnitude of the overestimation Mueller-Lyer illusion have been assessed under two levels of trials (a total of two or six judgments). Significant illusion decline was found only under conditions of repeated trials, with either continuous or intermittent inspection. These findings do not support the predictions of purely structural theories (including neural adaptation and efferent readiness theories), according to which degree of decrement should be determined solely by viewing time. Instead, the data demonstrate that illusion decrement is a product of practice, providing converging evidence for the view of decrement as involving a cognitive 'recalibration' or learning process.

Form Perception↗

B56$δ$ long-disordered arms form a dynamic PP2A regulation interface coupled with global allostery and Jordan’s syndrome mutations

Intrinsically disordered regions (IDR) and short linear motifs (SLiMs) play pivotal roles in the intricate signaling networks governed by phosphatases and kinases. B56δ (encoded by PPP2R5D) is a regulatory subunit of protein phosphatase 2A (PP2A) with long IDRs that harbor a substrate-mimicking SLiM and multiple phosphorylation sites. De novo missense mutations in PPP2R5D cause intellectual disabilities (ID), macrocephaly, Parkinsonism, and a broad range of neurological symptoms. Our single-particle cryo-EM structures of the PP2A-B56δ holoenzyme reveal that the long, disordered arms at the B56δ termini fold against each other and the holoenzyme core. This architecture suppresses both the phosphatase active site and the substrate-binding protein groove, thereby stabilizing the enzyme in a closed latent form with dual autoinhibition. The resulting interface spans over 190 Å and harbors unfavorable contacts, activation phosphorylation sites, and nearly all residues with ID-associated mutations. Our studies suggest that this dynamic interface is coupled to an allosteric network responsive to phosphorylation and altered globally by mutations. Furthermore, we found that ID mutations increase the holoenzyme activity and perturb the phosphorylation rates, and the severe variants significantly increase the mitotic duration and error rates compared to the normal variant.

59 BASIC BIOLOGICAL SCIENCES↗

Shared versus distributed memory multiprocessors

The question of whether multiprocessors should have shared or distributed memory has attracted a great deal of attention. Some researchers argue strongly for building distributed memory machines, while others argue just as strongly for programming shared memory multiprocessors. A great deal of research is underway on both types of parallel systems. Special emphasis is placed on systems with a very large number of processors for computation intensive tasks and considers research and implementation trends. It appears that the two types of systems will likely converge to a common form for large scale multiprocessors.

Jordan, Harry F.↗