Search NASA⌕ Search

SEARCH · Search NASA

Results for “EIGENVECTOR”

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 73 records · Page 4

An O(N squared) method for computing the eigensystem of N by N symmetric tridiagonal matrices by the divide and conquer approach

An efficient method is proposed to solve the eigenproblem of N by N Symmetric Tridiagonal (ST) matrices. Unlike the standard eigensolvers which necessitate O(N cubed) operations to compute the eigenvectors of such ST matrices, the proposed method computes both the eigenvalues and eigenvectors with only O(N squared) operations. The method is based on serial implementation of the recently introduced Divide and Conquer (DC) algorithm. It exploits the fact that by O(N squared) of DC operations, one can compute the eigenvalues of N by N ST matrix and a finite number of pairs of successive rows of its eigenvector matrix. The rest of the eigenvectors--all of them or one at a time--are computed by linear three-term recurrence relations. Numerical examples are presented which demonstrate the superiority of the proposed method by saving an order of magnitude in execution time at the expense of sacrificing a few orders of accuracy.

Gill, Doron↗

Robust eigensystem assignment for second-order estimators

An approach for the robust eigensystem assignment of flexible structures using full state or output feedback is developed. Using the second-order dynamic equations, the approach can assign the eigenvalues of the system via velocity and displacement feedbacks, or acceleration and velocity feedbacks. The eigenvalues and eigenvectors of the system are assigned, via the second-order eigenvalue problem for the structural system, in two steps. First, an orthonormal basis spanning the attainable closed-loop eigenvector space corresponding to each desired closed-loop eigenvalue is generated using the Singular Value or QR decompositions. Second, a sequential procedure is used to choose a set of closed-loop eigenvectors that are as close as possible to the column space of a well-conditioned target matrix. Among the possible choices of the target matrix, the closest unitary matrix to the open-loop eigenvector matrix appears to be a suitable choice. A numerical example is given to illustrate the proposed algorithm.

Juang, Jer-Nan↗

Robust eigensystem assignment for second-order dynamic systems

A novel approach for the robust eigensystem assignment of flexible structures using full state or output feedback is developed. Using the second-order dynamic equations, the approach can assign the eigenvalues of the system via velocity and displacement feedbacks, or acceleration and velocity feedbacks. The eigenvalues and eigenvectors of the system are assigned, via the second-order eigenvalue problem for the structural system, in two steps. First, an orthonormal basis spanning the attainable closed-loop eigenvector space corresponding to each desired closed-loop eigenvalue is generated using the Singular Value or QR decompositions. Second, a sequential procedure is used to choose a set of closed-loop eigenvectors that are as close as possible to the column space of a well-conditioned target matrix. Among the possible choices of the target matrix, the closest unitary matrix to the open-loop eigenvector matrix appears to be a suitable choice. A numerical example is given to illustrate the proposed algorithm.

Juang, Jer-Nan↗

Gain weighted eigenspace assignment

This report presents the development of the gain weighted eigenspace assignment methodology. This provides a designer with a systematic methodology for trading off eigenvector placement versus gain magnitudes, while still maintaining desired closed-loop eigenvalue locations. This is accomplished by forming a cost function composed of a scalar measure of error between desired and achievable eigenvectors and a scalar measure of gain magnitude, determining analytical expressions for the gradients, and solving for the optimal solution by numerical iteration. For this development the scalar measure of gain magnitude is chosen to be a weighted sum of the squares of all the individual elements of the feedback gain matrix. An example is presented to demonstrate the method. In this example, solutions yielding achievable eigenvectors close to the desired eigenvectors are obtained with significant reductions in gain magnitude compared to a solution obtained using a previously developed eigenspace (eigenstructure) assignment method.

Davidson, John B.↗

The Topology of Symmetric Tensor Fields

Combinatorial topology, also known as "rubber sheet geometry", has extensive applications in geometry and analysis, many of which result from connections with the theory of differential equations. A link between topology and differential equations is vector fields. Recent developments in scientific visualization have shown that vector fields also play an important role in the analysis of second-order tensor fields. A second-order tensor field can be transformed into its eigensystem, namely, eigenvalues and their associated eigenvectors without loss of information content. Eigenvectors behave in a similar fashion to ordinary vectors with even simpler topological structures due to their sign indeterminacy. Incorporating information about eigenvectors and eigenvalues in a display technique known as hyperstreamlines reveals the structure of a tensor field. The simplify and often complex tensor field and to capture its important features, the tensor is decomposed into an isotopic tensor and a deviator. A tensor field and its deviator share the same set of eigenvectors, and therefore they have a similar topological structure. A a deviator determines the properties of a tensor field, while the isotopic part provides a uniform bias. Degenerate points are basic constituents of tensor fields. In 2-D tensor fields, there are only two types of degenerate points; while in 3-D, the degenerate points can be characterized in a Q'-R' plane. Compressible and incompressible flows share similar topological feature due to the similarity of their deviators. In the case of the deformation tensor, the singularities of its deviator represent the area of vortex core in the field. In turbulent flows, the similarities and differences of the topology of the deformation and the Reynolds stress tensors reveal that the basic addie-viscosity assuptions have their validity in turbulence modeling under certain conditions.

Levin, Yingmei↗

Elastic Model Transitions: A Hybrid Approach Utilizing Quadratic Inequality Constrained Least Squares (LSQI) and Direct Shape Mapping (DSM)

A method for transitioning linear time invariant (LTI) models in time varying simulation is proposed that utilizes a hybrid approach for determining physical displacements by augmenting the original quadratically constrained least squares (LSQI) algorithm with Direct Shape Mapping (DSM) and modifying the energy constraints. The approach presented is applicable to simulation of the elastic behavior of launch vehicles and other structures that utilize discrete LTI finite element model (FEM) derived mode sets (eigenvalues and eigenvectors) that are propagated throughout time. The time invariant nature of the elastic data presents a problem of how to properly transition elastic states from the prior to the new model while preserving motion across the transition and ensuring there is no truncation or excitation of the system. A previous approach utilizes a LSQI algorithm with an energy constraint to effect smooth transitions between eigenvector sets with no requirement that the models be of similar dimension or have any correlation. This approach assumes energy is conserved across the transition, which results in significant non-physical transients due to changing quasi-steady state energy between mode sets, a phenomenon seen when utilizing a truncated mode set. The computational burden of simulating a full mode set is significant so a subset of modes is often selected to reduce run time. As a result of this truncation, energy between mode sets may not be constant and solutions across transitions could produce non-physical transients. In an effort to abate these transients an improved methodology was developed based on the aforementioned approach, but this new approach can handle significant changes in energy across mode set transitions. It is proposed that physical velocities due to elastic behavior be solved for using the LSQI algorithm, but solve for displacements using a two-step process that independently addresses the quasi-steady-state and non-steady-state contributions to the elastic displacement. For structures subject to large external forces, such as thrust or atmospheric drag, it is imperative to capture these forces when solving for elastic displacement. To simplify the mathematical formulation, assumptions are made regarding mass matrix normalization, constant external forcing, and constant viscous damping. These simplifications allow for direct solutions to the quasi-steady-state displacements through a process titled Direct Shape Mapping. DSM solves for the displacements using the eigenvalues of the elastic modes and the external forcing and returns a set of elastic displacements dictated by the eigenvectors of the post-transition mode set. For the non-steady-state contributions to displacement we formulate a LSQI problem that is constrained by energy of the non-steady state terms. The contributions from the quasi-steady-state and non-steady state solutions are then combined to obtain the physical displacements associated with the new set of eigenvectors. Results for the LSQI-DSM approach show significant reduction/complete removal of transients across mode set transitions while maintaining elastic motion from the prior state. For time propagation applications employing discrete elastic models that need to be transitioned in time and where running with full a full mode set is not feasible, the method developed offers a practical solution to simulating vehicle elasticity.

Hannan, Mike R.↗

Principal component analysis of solar flares in the soft X-ray flux

The paper considers principal component analysis of solar flares in the soft X-ray flux, a technique for extracting the salient features from a mass of data. The method applies particularly to the analysis of nonstationary ensembles, and its computations require the evaluation of eigenvalues of matrices. The Eispack matrix eigen system routines were used to analyze full-disk proportional-counter data from the X-ray event analyzer which was part of the Skylab experiment. Empirical orthogonal functions were derived for events in the soft X-ray spectrum between 2.5 and 20 A during different time periods, indicating that about 90% of the cumulative power of each analyzed flare is contained in the largest eigenvector. The first two largest eigenvectors are sufficient for an empirical curve fit through the raw data and a characterization of solar flares in the soft X-ray flux, and power spectra of two largest eigenvectors reveal a reported periodicity of about 5 min.

Teuber, D. L.↗

Accelerating an iterative process by explicit annihilation

A slowly convergent stationary iterative process can be accelerated by explicitly annihilating (i.e., eliminating) the dominant eigenvector component of the error. The dominant eigenvalue or complex pair of eigenvalues can be estimated from the solution during the iteration. The corresponding eigenvector or complex pair of eigenvectors can then be annihilated by applying an explicit Richardson process over the basic iterative method. This can be done entirely in real arithmetic by analytically combining the complex conjugate annihilation steps. The technique is applied to an implicit algorithm for the calculation of two dimensional steady transonic flow over a circular cylinder using the equations of compressible inviscid gas dynamics. This demonstrates the use of explicit annihilation on a nonlinear problem.

Jespersen, D. C.↗

Optimal Landsat transforms for forest applications

Eleven transformations of data from four Landsat MSS channels were investigated to find if any of the transforms accentuated the separability of natural vegetation classes in regions of varying topographical relief. Attention was given to the divergence analysis and classification accuracy of information content of the eleven transforms and four channels. A useful scaling function was observed with the second eigenvector being the denominator in the divergence values obtained. The second eigenvector was found to reduce the effects of shadowing and differential illumination of vegetation signatures, thereby enhancing the divergence values. The highest accuracies in crop identification were provided by the averages of channels 4, 6, and 7 divided by the second eigenvector.

Logan, T. L.↗

Accelerating an iterative process by explicit annihilation

A slowly convergent stationary iterative process can be accelerated by explicitly annihilating (i.e., eliminating) the dominant eigenvector component of the error. The dominant eigenvalue or complex pair of eigenvalues can be estimated from the solution during the iteration. The corresponding eigenvector or complex pair of eigenvectors can then be annihilated by applying an explicit Richardson process over the basic iterative method. This can be done entirely in real arithmetic by analytically combining the complex conjugate annihilation steps. The technique is applied to an implicit algorithm for the calculation of two dimensional steady transonic flow over a circular cylinder using the equations of compressible inviscid gas dynamics. This demonstrates the use of explicit annihilation on a nonlinear problem.

Jespersen, D. C.↗

Interactive software for spectral assignment

A new interactive computer software package for eigenvalue/eigenvector assignment using constant state feedback is described. The package consists of ten subprograms, each associated with a specific design objective, accessible from a main control program. Using this package, primary design objectives of assigning eigenvalues and approximating eigenvectors are first achieved. Then secondary design objectives, including modification of specific eigenvector components, reduction in specified elements of the feedback gain matrix, and reduction in eigensystem sensitivity to changes in plant parameters, are addressed. These secondary objectives are achieved by a systematic modification of the assigned eigenvectors in a small region about the initial assignment. In addition, the program implements the use of spectral assignment procedures with reduced-order system models. Program modes are described and illustrated by numerical examples.

Mielke, R. R.↗

Flutter suppression using eigenspace freedoms to meet requirements

A constrained optimization methodology has been developed which allows specific use of eigensystem freedoms to meet design requirements. A subset of the available eigenvector freedoms was employed. The eigenvector freedoms associated with a particular closed-loop eigenvalue are coefficients of basis vectors which span the subspace in which that closed-loop vector must lie. Design requirements are included as a vector of inequality constraints. The procedure was successfully applied to develop an unscheduled controller which stabilizes symmetric flutter of an aeroelastic vehicle to a dynamic pressure 44 percent above the open-loop flutter point. The design process proceeded from full-state feedback to the inclusion of a full-order observer to the selection of an eighth-order controller which preserved the full-state sensitivity characteristics. Only a subset of the design freedoms was utilized (i.e., assuming full-state feedback only four out of 26 eigenvectors were used, and no variations were made in the closed-loop eigenvalues). Utilization of additional eigensystem freedoms could further improve the controller.

Adams, William M., Jr.↗

Robust eigenvalue/eigenvector selection in linear state feedback systems

Design procedures are developed to select both eigenvalues and eigenvectors to improve system robustness. A robustness metric based on the determinant of the normalized eigenvector matrix defined. It is shown that this metric significantly speeds up the convergence of robust eigenvector solutions close to the optimal. A procedure to blend multiple inputs to improve achievable system robustness in the lower dimensional pseudo control space has also been derived.

Srinathkumar, S.↗

Robust eigenstructure assignment by a projection method - Applications using multiple optimization criteria

A methodology for robust eigenstructure assignment for multivariable feedback systems is presented. The algorithm is based upon a pole placement technique using projections onto subspaces of admissible eigenvectors. New ideas are introduced to generate target (desired) sets of unitary eigenvectors and determine optimal feasible eigenvectors in a least-square sense. Useful connections are established between the pole-placement by independent modal space control and the method introduced in this paper. A multicriterion optimization algorithm is also presented, which takes efficient advantage of the present eigenstructure assignment method. These developments show significant improvement over an earlier version of this algorithm in both computational cost and accuracy. This optimization process appears to be numerically robust and suitable for high-dimensional multicriterion optimizations; it is especially attractive for computer-aided design of control systems.

Rew, D. W.↗

A recent case study in system identification

Results of a recent study of a ten-bay truss structure at the NASA Langley Research Center are reported. First, the conditioning of complex eigenvectors derived by the ERA method is discussed. Results of parameter estimation using the SSID (Structural System Identification) code are then presented. Based on the results of the study, it is concluded that (1) parameter estimation based on modal data should include eigenvectors as well as eigenvalues; (2) the eigenvectors should be orthogonalized when orthogonality is poor due to closely spaced modes; and (3) the parameters used in the estimation should enable the model to match the data.

Hasselman, T. K.↗

Monte Carlo simulation of errors in the anisotropy of magnetic susceptibility - A second-rank symmetric tensor

Monte Carlo perturbations of synthetic tensors to evaluate the Hext/Jelinek elliptical confidence regions for anisotropy of magnetic susceptibility (AMS) eigenvectors are used. When the perturbations are 33 percent of the minimum anisotropy, both the shapes and probability densities of the resulting eigenvector distributions agree with the elliptical distributions predicted by the Hext/Jelinek equations. When the perturbation size is increased to 100 percent of the minimum eigenvalue difference, the major axis of the 95 percent confidence ellipse underestimates the observed eigenvector dispersion by about 10 deg. The observed distributions of the principal susceptibilities (eigenvalues) are close to being normal, with standard errors that agree well with the calculated Hext/Jelinek errors. The Hext/Jelinek ellipses are also able to describe the AMS dispersions due to instrumental noise and provide reasonable limits for the AMS dispersions observed in two Hawaiian basaltic dikes. It is concluded that the Hext/Jelinek method provides a satisfactory description of the errors in AMS data and should be a standard part of any AMS data analysis.

Lienert, Barry R.↗

Eigenvalue/Eigenvector derivatives for SAVI Gimbalflex nonlinear transient response analysis

An eigenvector expansion method is utilized to predict eigenvalue and eigenvector derivatives due to geometric reconfiguration of a Gimbalflex fine-pointing/vibration isolation system called SAVI (Space Active Vibration Isolation). The eigenvector expansion method used is a modification of the classical method and allows for rigid body roots. Using the resulting modal derivatives, free-free nonlinear equations of motion are developed with Lagrange's Method. These equations represent a nonlinear plant model to be used in conjunction with a control system transient response simulation.

Orr, M. F., Jr.↗

Evolution of the shock front and turbulence structures in the shock/turbulence interaction

The interaction of a weak shock front with isotropic turbulence has been investigated using Direct Numerical Simulation (DNS). Two problems were considered: the ability of the field equation (the equation for a propagating surface) to model the shock; and a quantitative study of the evolution of turbulence structure using the database generated by Lee et al. Field equation model predictions for front shape have been compared with DNS results; good agreement is found for shock wave interaction with 2D turbulence and for a single steady vorticity wave. In the interaction of 3D isotropic turbulence with a normal shock, strong alignment of vorticity with the intermediate eigenvector of the rate of strain tensor (S(sup *)(sub ij) = S(sub ij) - (1/3)(delta(sub ij))(S(sub kk))) is seen to develop upstream of the shock and to be further amplified on passage through the shock. Vorticity tends to align at 90 deg to the largest eigenvector, but there is no preferred alignment with the smallest eigenvector. Upstream of the shock, the alignments continue to develop even after the velocity derivative skewness saturates. There is a significant tendency, which increases with time throughout the computational domain, for velocity to align with vorticity. The alignment between velocity and vorticity is strongest in eddy regions and weakest in convergence regions.

Kevlahan, N.↗