Search NASA⌕ Search

SEARCH · Search NASA

Results for “eigenvalue”

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 631 records · Page 35

An investigative study of multispectral data compression for remotely-sensed images using vector quantization and difference-mapped shift-coding

A study is conducted to investigate the effects and advantages of data compression techniques on multispectral imagery data acquired by NASA's airborne scanners at the Stennis Space Center. The first technique used was vector quantization. The vector is defined in the multispectral imagery context as an array of pixels from the same location from each channel. The error obtained in substituting the reconstructed images for the original set is compared for different compression ratios. Also, the eigenvalues of the covariance matrix obtained from the reconstructed data set are compared with the eigenvalues of the original set. The effects of varying the size of the vector codebook on the quality of the compression and on subsequent classification are also presented. The output data from the Vector Quantization algorithm was further compressed by a lossless technique called Difference-mapped Shift-extended Huffman coding. The overall compression for 7 channels of data acquired by the Calibrated Airborne Multispectral Scanner (CAMS), with an RMS error of 15.8 pixels was 195:1 (0.41 bpp) and with an RMS error of 3.6 pixels was 18:1 (.447 bpp). The algorithms were implemented in software and interfaced with the help of dedicated image processing boards to an 80386 PC compatible computer. Modules were developed for the task of image compression and image analysis. Also, supporting software to perform image processing for visual display and interpretation of the compressed/classified images was developed.

Jaggi, S.↗

Evaluation of MARC for the analysis of rotating composite blades

The suitability of the MARC code for the analysis of rotating composite blades was evaluated using a four-task process. A nonlinear displacement analysis and subsequent eigenvalue analysis were performed on a rotating spring mass system to ensure that displacement-dependent centrifugal forces were accounted for in the eigenvalue analysis. Normal modes analyses were conducted on isotropic plates with various degrees of twist to evaluate MARC's ability to handle blade twist. Normal modes analyses were conducted on flat composite plates to validate the newly developed coupled COBSTRAN-MARC methodology. Finally, normal modes analyses were conducted on four composite propfan blades that were designed, analyzed, and fabricated at NASA Lewis Research Center. Results were compared with experimental data. The research documented herein presents MARC as a viable tool for the analysis of rotating composite blades.

Bartos, Karen F.↗

Analysis of virtual passive controllers for flexible space structures

The dynamics of flexible spacecraft are not usually well known before launch. This makes it important to develop controllers for such systems that can never be destabilized by perturbations in the structural model. Virtual passive controllers, or active vibration absorbers, possess this guaranteed stability property; they mimic a fictitious flexible structure attached to the true physical one. This report analyzes the properties of such controllers, and shows that disturbance absorption behavior can be naturally described in terms of a set of virtual zeros that they introduce into the closed-loop dynamics of the system. Based on this analysis, techniques are then derived for selecting the active vibration absorber internal parameters, i.e., the gain matrices of such controllers, so as to achieve specified control objectives. Finally, the effects on closed-loop stability of small delays in the feedback loop are investigated. Such delays would typically be introduced by a digital implementation of an active vibration absorber. It is shown that these delays only affect the real parts of the eigenvalues of a lightly-damped structure. Furthermore, it is only the high-frequency modes that are destabilized by delays; low-frequency modes are actually made more heavily damped. Eigenvalue perturbation methods are used to obtain accurate predictions of the critical delay at which a given system will become unstable; these methods also determine which mode is critical.

Williams, Trevor W.↗

Two photon annihilation operators and squeezed vacuum

Inverses of the harmonic oscillator creation and annihilation operators by their actions on the number states are introduced. Three of the two photon annihilation operators, viz., a(sup +/-1)a, aa(sup +/-1), and a(sup 2), have normalizable right eigenstates with nonvanishing eigenvalues. The eigenvalue equation of these operators are discussed and their normalized eigenstates are obtained. The Fock state representation in each case separates into two sets of states, one involving only the even number states while the other involving only the odd number states. It is shown that the even set of eigenstates of the operator a(sup +/-1)a is the customary squeezed vacuum S(sigma) O greater than.

Roy, Anil K.↗

Design of optimally smoothing multistage schemes for the Euler equations

A recently derived local preconditioning of the Euler equations is shown to be useful in developing multistage schemes suited for multigrid use. The effect of the preconditioning matrix on the spatial Euler operator is to equalize the characteristic speeds. When applied to the discretized Euler equations, the preconditioning has the effect of strongly clustering the operator's eigenvalues in the complex plane. This makes possible the development of explicit marching schemes that effectively damp most high-frequency Fourier modes, as desired in multigrid applications. The technique is the same as developed earlier for scalar convection schemes: placement of the zeros of the amplification factor of the multistage scheme in locations where eigenvalues corresponding to high-frequency modes abound.

Van Leer, Bram↗

A generalized Lyapunov theory for robust root clustering of linear state space models with real parameter uncertainty

The problem of analyzing and designing controllers for linear systems subject to real parameter uncertainty is considered. An elegant, unified theory for robust eigenvalue placement is presented for a class of D-regions defined by algebraic inequalities by extending the nominal matrix root clustering theory of Gutman and Jury (1981) to linear uncertain time systems. The author presents explicit conditions for matrix root clustering for different D-regions and establishes the relationship between the eigenvalue migration range and the parameter range. The bounds are all obtained by one-shot computation in the matrix domain and do not need any frequency sweeping or parameter gridding. The method uses the generalized Lyapunov theory for getting the bounds.

Yedavalli, R. K.↗

Full and reduced order observer based controller design for H2-optimization

The most general H2 control problem is considered. The authors derive necessary and sufficient conditions when the infimum is attained by state feedback. They do the same for the measurement feedback case where necessary and sufficient conditions are derived when the infimum is attained by proper dynamic compensator. Reduced-order compensators are investigated if some states are observable without noise. For all of these cases the freedom that the non-uniqueness of optimal compensators gives in assigning the closed-loop eigenvalues is discussed. The case when the infimum cannot be attained is investigated. A constructive algorithm is presented to find a minimizing sequence of stabilizing controllers and the freedom in the asymptotic locations of the closed-loop eigenvalues is discussed. This procedure is repeated for three different cases: static state feedback, full-order measurement feedback, and reduced-order measurement feedback.

Stoorvogel, Anton A.↗

Acceleration of convergence and spectrum transformation of implicit finite difference operators associated with Navier-Stokes equations

Implicit difference operator spectra are presently computed by applying eigensystem analysis techniques to finite-difference formulations of 2D Euler and Navier-Stokes equations, and attention is given to these iterative methods' convergence and stability characteristics by taking into account the effects of grid geometry, time-step, numerical viscosity, and boundary conditions. On the basis of the eigenvalue distributions for various flow configurations, the feasibility of applying such convergence-acceleration techniques as eigenvalue annihilation and relaxation is discussed. Spectrum-shifting is applied to NASA-Ames' ARC2D flow code, achieving a 20-33 percent efficiency.

Saleem, M.↗

A modified Chebyshev pseudospectral method with an O(N exp -1) time step restriction

The extreme eigenvalues of the Chebyshev pseudospectral differentiation operator are O(N exp 2) where N is the number of grid points. As a result of this, the allowable time step in an explicit time marching algorithm is O(N exp -2) which, in many cases, is much below the time step dictated by the physics of the partial differential equation. A new set of interpolating points is introduced such that the eigenvalues of the differentiation operator are O(N) and the allowable time step is O(N exp -1). The properties of the new algorithm are similar to those of the Fourier method. The new algorithm also provides a highly accurate solution for non-periodic boundary value problems.

Kosloff, Dan↗

Implicit treatment of diffusion terms in lower-upper algorithms

A method is presented which allows diffusion terms to be treated implicitly in the lower-upper (LU) algorithm (which is a commonly used method for solving 'compressible' Euler and Navier-Stokes equations) so that the algorithm's good stability properties will not be impaired. The new method generalizes the concept of LU factorization from that associated with the sign of eigenvalues to that associated with backward- and forward-difference operators without regard to eigenvalues. The method is verified in a turbulent boundary layer study.

Shih, T. I.-P.↗

Controls-structures integrated design optimization with shape variations

The shape design variables have been introduced into the set of design variables of the Controls-Structure Integrated (CSI) Design of space-structures. The importance of the shape variations in improving the design (obtained with only control and sizing variables) has been aptly illustrated. Two different types of design variables that describe the shape variations of the structure have been introduced. In the first case, the nodal coordinates have been considered as design variables. This has the inherent difficulty of having too many design variables. This not only is time consuming but also memory intensive and may not yield a manufacturable shape to the structure. The second approach has been introduced to overcome this difficulty. The structure is allowed to vary in a particular pre defined pattern. The coefficients of these patterns are considered as the shape design variables. The eigenvalue and eigenvector sensitivity equations with respect to these coefficient design variables have been developed and are used to approximate the eigenvalues and eigenvectors in a perturbed design.

Koganti, Gopichand↗

Sensitivity analysis of Lyapunov and Riccati equations with application to controls-structures integrated design

Controls-structure integrated design is a complicated multidisciplinary design optimization problem which involves the state equations pertaining to open-loop eigenvalues and control laws. In order to alleviate the intensity of the computation, this study uses the adjoint variable method to derive sensitivity equations for the eigenvalue, Liapunov, and Riccati equations. These individual sensitivity equations are then combined together to form the multidisciplinary sensitivity equations for the control structure integrated design problems. A set of linear sensitivity equations, proportional in number to the number of performance functions involved in the optimization process, are solved. This proposed approach may provide a great saving in computer resources. The validity of the newly developed sensitivity equations is verified by numerical examples.

Hou, Gene↗

On eigensystem assignment with dissipativity constraints

Stability of the closed-loop system is of vital importance when controller synthesis is being performed using a reduced order model of the open-loop plant. For passive systems such as flexible space structures, closed-loop stability is often ensured by low-authority dissipative controllers using collocated and compatible sensors and actuators. This paper considers the problem of eigensystem assignment for flexible structures using constant-gain output feedback, under the dissipativity constraints requiring that the gain matrices be nonnegative definite. A novel method is developed in which a sequential procedure is used to assign one complex-conjugate pair of closed-loop eigenvalues in each step. At each step, an iterative technique is employed for generating a nonnegative definite gain matrix that assigns a new pair while keeping the previously assigned pairs unchanged. This method can assign up to m closed-loop system eigenvalues, where m is the number of control inputs. A numerical example of damping enhancement for a large flexible structure is presented to demonstrate the approach.

Maghami, Peiman G.↗

Eigensensitivity analysis for space structures with applications in design optimization

An approximate structural eigenvalue/vector analysis technique which uses eigensensitivities in a truncated Taylor series expression is presented. It is shown that this technique can provide the computational efficiency urgently needed for large scale control-structure optimization problems. In addition, a unified formulation and solution approach for calculating eigenvalue and eigenvector derivatives of the real symmetric structural eigenvalue problem is presented.

Kenny, Sean P.↗

An efficient design sensitivity analysis of eigenvectors

Subspace iteration has been a major advance in solving large eigen problems when only a subset of eigen-pairs is required. The essence of this method is a transformation from displacement coordinates of an n-th order eigensystem to generalized coordinates of a smaller q-th order. The eigenvalue problem is then solved in the reduced space. The method was first developed by Clint and Jennings for real symmetric systems and was then called 'simultaneous iteration'. The success of the method prompted further research along this line and there have been many improved algorithms developed. This approach has been widely used by structural engineers for extracting the most useful natural frequencies and mode shapes of large-scale dynamic systems. This paper exploits into a new direction which is in the form of iterative process for simultaneously calculating eigenvector derivatives of many eigenvectors with respect to multi-variables. The method fully uses all the available information from preceding eigenvalue solution and, thus, effectively economizes computational efforts. It iterates through two equations derived from the first variation of the two fundamental equations used in subspace iteration method. There is no expensive large matrix decomposition required and the process converges to acceptable solution in a finite number of iterations. Therefore, the procedure increases its efficiency superiority over the others as the system size or the number of interested eigenvectors become larger and larger.

Ting, T.↗

Application of the target decomposition theorem to a polarimetric random media model

With advances in polarimetric radar measurements of land surfaces, the need for understanding the underlying scattering mechanisms and dominant target features has become the focus of many studies. In particular, the maximum use of the polarimetric information to identify and/or separate parameters related to the surface features such as vegetation thickness, structure, water content, and soil surface characteristics will enhance the possibility of using polarimetric radars for monitoring the earth's surface from space. In this paper, Cloude's decomposition theorem is applied to a polarimetric random media model to simulate the radar measurements of vegetated canopies. The vegetated canopies are modeled as a three layer discrete random medium with leaves and branches in the first layer, tree trunks in the second layer, and a half space of homogeneous ground with rough interface as the bottom layer. The distorted born approximation (DBA) has been used to compute full Mueller matrix of the canopy, using canonical dielectric objects such as thin discs and cylinders as leaves, branches, and trunks, respectively. The Mueller matrix and the derived covariance matrix contain information on the second order statistics of radar signals at various polarizations from the canopy. To decompose the covariance matrix to its constituent targets, the eigenvalues and eigenvectors of the covariance matrix are computed in terms of the physical parameters of the canopy. In addition, each eigenvector explicitly shows the scattering mechanisms such as odd and even reflections in the canopy. Cloude's decomposition theorem is applied using the Pauli spin matrices as a basis and an expression for the degree of disorder or the entropy for the vegetated surface is found. Then, the physical parameters estimated from in situ measurements are used in the random media to obtain realistic covariance matrices. As a result, the sensitivity of the eigenvalue spectrums and the coefficients resulting from the target decomposition theorem to the physical parameters of the canopy are examined and the possible use of Cloude's theorem to estimate vegetation and soil parameters is discussed.

Saatchi, Sasan S.↗

Issac, Jason Cherian ses in transonic flow

Flutter analysis of a two degree of freedom airfoil in compressible flow is performed using a state-space representation of the unsteady aerodynamic behavior. Indicial response functions are used to represent the normal force and moment response of the airfoil. The structural equations of motion of the airfoil with bending and torsional degrees of freedom are coupled to the unsteady air loads and the aeroelastic system so modelled is solved as an eigenvalue problem to determine the stability. The aeroelastic equations are also directly integrated with respect to time and the time-domain results compared with the results from the eigenanalysis. A good agreement is obtained. The derivatives of the flutter speed obtained from the eigenanalysis are calculated with respect to the mass and stiffness parameters by both analytical and finite-difference methods for various transonic Mach numbers. The experience gained from the two degree of freedom model is applied to study the sensitivity of the flutter response of a wing with respect to various shape parameters. The parameters being considered are as follows: (1) aspect ratio; (2) surface area of the wing; (3) taper ratio; and (4) sweep. The wing deflections are represented by Chebyshev polynomials. The compressible aerodynamic state-space model used for the airfoil section is extended to represent the unsteady aerodynamic forces on a generally laminated tapered skewed wing. The aeroelastic equations are solved as an eigenvalue problem to determine the flutter speed of the wing. The derivatives of the flutter speed with respect to the shape parameters are calculated by both analytical and finite difference methods.

Issac, Jason Cherion↗

Rapid solution of large-scale systems of equations

The analysis and design of complex aerospace structures requires the rapid solution of large systems of linear and nonlinear equations, eigenvalue extraction for buckling, vibration and flutter modes, structural optimization and design sensitivity calculation. Computers with multiple processors and vector capabilities can offer substantial computational advantages over traditional scalar computer for these analyses. These computers fall into two categories: shared memory computers and distributed memory computers. This presentation covers general-purpose, highly efficient algorithms for generation/assembly or element matrices, solution of systems of linear and nonlinear equations, eigenvalue and design sensitivity analysis and optimization. All algorithms are coded in FORTRAN for shared memory computers and many are adapted to distributed memory computers. The capability and numerical performance of these algorithms will be addressed.

Storaasli, Olaf O.↗