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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

All sources NASA NTRS DOE OSTI

NASA NTRS1990

Partitioning sparse matrices with eigenvectors of graphs

The problem of computing a small vertex separator in a graph arises in the context of computing a good ordering for the parallel factorization of sparse, symmetric matrices. An algebraic approach for computing vertex separators is considered in this paper. It is shown that lower bounds on separator sizes can be obtained in terms of the eigenvalues of the Laplacian matrix associated with a graph. The Laplacian eigenvectors of grid graphs can be computed from Kronecker products involving the eigenvectors of path graphs, and these eigenvectors can be used to compute good separators in grid graphs. A heuristic algorithm is designed to compute a vertex separator in a general graph by first computing an edge separator in the graph from an eigenvector of the Laplacian matrix, and then using a maximum matching in a subgraph to compute the vertex separator. Results on the quality of the separators computed by the spectral algorithm are presented, and these are compared with separators obtained from other algorithms for computing separators. Finally, the time required to compute the Laplacian eigenvector is reported, and the accuracy with which the eigenvector must be computed to obtain good separators is considered. The spectral algorithm has the advantage that it can be implemented on a medium-size multiprocessor in a straightforward manner.

Pothen, Alex↗

NASA NTRS1975

Numerical methods for evaluating the derivatives of eigenvalues and eigenvectors

Two numerical methods are presented for computing the derivatives of eigenvalues and eigenvectors which do not require complete solution of the eigenvalue problem if only a few derivatives are sought. The 'iterative' method may be used to find the first derivative of one or all of the eigenvectors together with the second derivative of their eigenvalues in a self-adjoint system. If the left- and right-hand eigenvectors are known, the first derivative of the eigenvector corresponding to the largest eigenvalue and the second derivative of the largest eigenvalue may be obtained for a nonself-adjoint system. The 'algebraic' method may be used to find all orders of the derivatives, provided they exist, without requiring the left-hand eigenvectors.

Rudisill, C. S.↗

NASA NTRS1987

On the eigenvalue and eigenvector derivatives of a general matrix

The existence of differentiable eigenvalues and eigenvectors for a general matrix is addressed. The eigenspace which contains differentiable eigenvectors is determined and computed by using the concept of subspace intersection in conjunction with the singular value decomposition algorithm. The differentiable eigenvectors associated with repeated eigenvalues should be simultaneously the eigenvectors of the general matrix and its corresponding sensitivity matrix. Furthermore, the derivatives for differentiable eigenvectors associated with repeated eigenvalues can be computed using higher order derivatives of the matrix, whereas the corresponding eigenvalue derivatives are the eigenvalues of the sensitivity matrix.

Juang, Jer-Nan↗

NASA NTRS1988

On the eigenvalue and eigenvector derivatives of a non-defective matrix

A novel approach is introduced to address the problem of existence of differentiable eigenvectors for a nondefective matrix which may have repeated eigenvalues. The existence of eigenvector derivatives for a unique set of continuous eigenvectors corresponding to a repeated eigenvalue is rigorously established for nondefective and analytic matrices. A numerically implementable method is then developed to compute the differentiable eigenvectors associated with repeated eigenvalues. The solutions of eigenvalue and eigenvector derivatives for repeated eigenvalues are then derived. An example is given to illustrate the validity of formulations developed in this paper.

Juang, Jer-Nan↗

NASA NTRS1974

Derivatives of eigenvalues and eigenvectors for a general matrix

Expressions are obtained for the derivatives of the eigenvalues and eigenvectors which are expressions of only one left-hand and one right-hand eigenvector. The approach described makes use of a Choleski decomposition or some other decomposition method. The method may be extended to find any order of derivative of the eigenvalue and eigenvector. The expressions obtained for finding the derivatives of eigenvalues and eigenvectors for nonself-adjoint systems may be applied to self-adjoint systems.

Rudisill, C. S.↗

NASA NTRS2019

Observations on the Computation of Eigenvalue and Eigenvector Jacobians

Many scientific and engineering problems benefit from analytic expressions for eigenvalue and eigenvector derivatives with respect to the elements of the parent matrix. While there exists extensive literature on the calculation of these derivatives, which take the form of Jacobian matrices, there are a variety of deficiencies that have yet to be addressed — including the need for both left and right eigenvectors, limitations on the matrix structure, and issues with complex eigenvalues and eigenvectors. This work addresses these deficiencies by proposing a new analytic solution for the eigenvalue and eigenvector derivatives. The resulting analytic Jacobian matrices are numerically efficient to compute and are valid for the general complex case. It is further shown that this new general result collapses to previously known relations for the special cases of real symmetric matrices and real diagonal matrices. Finally, the new Jacobian expressions are validated using forward finite differencing and performance is compared with another technique.

Jacobian↗

NASA NTRS1979

Eigenvalues and eigenvectors for hybrid coordinate equations of motion for flexible spacecraft

The eigenvalues and eigenvectors of a system of linear time-invariant equations describing the attitude motion of flexible spacecraft in terms of hybrid coordinates are characterized in terms of literal expressions by using peculiar properties of the system parameter matrices. For the undamped case the eigenvalues are localized in terms of inertial matrices and modal parameters. A procedure for calculating the eigenvectors is proposed whereby the eigenproblem associated with the original system of dimension (2N + 6) is reduced to that of a symmetric and positive definite matrix of dimension N with the zero-damping assumption. The eigenvectors for systems of large dimension are obtained explicitly in terms of a 3x1 matrix whose elements are available from a system of three algebraic equations, which is provided.

Ohkami, Y.↗

NASA NTRS1983

Discrete model improvement by eigenvector updating

An eigenvector updating method is proposed to fit modal test data. The calculated eigenvectors are updated by coinciding some of them with the corresponding measured eigenvectors as a result of an orthogonal transformation. The advantage of the method is the applicability to large complex structures without necessity of recomputation of the eigendata.

Zak, M.↗

NASA NTRS1991

Eigenvalue and eigenvector sensitivity and approximate analysis for repeated eigenvalue problems

A set of computationally efficient equations for eigenvalue and eigenvector sensitivity analysis are derived, and a method for eigenvalue and eigenvector approximate analysis in the presence of repeated eigenvalues is presented. The method developed for approximate analysis involves a reparamaterization of the multivariable structural eigenvalue problem in terms of a single positive-valued parameter. The resulting equations yield first-order approximations of changes in both the eigenvalues and eigenvectors associated with the repeated eigenvalue problem. Examples are given to demonstrate the application of such equations for sensitivity and approximate analysis.

Hou, Gene J. W.↗

NASA NTRS1990

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

NASA NTRS1996

Lateral-Directional Eigenvector Flying Qualities Guidelines for High Performance Aircraft

This report presents the development of lateral-directional flying qualities guidelines with application to eigenspace (eigenstructure) assignment methods. These guidelines will assist designers in choosing eigenvectors to achieve desired closed-loop flying qualities or performing trade-offs between flying qualities and other important design requirements, such as achieving realizable gain magnitudes or desired system robustness. This has been accomplished by developing relationships between the system's eigenvectors and the roll rate and sideslip transfer functions. Using these relationships, along with constraints imposed by system dynamics, key eigenvector elements are identified and guidelines for choosing values of these elements to yield desirable flying qualities have been developed. Two guidelines are developed - one for low roll-to-sideslip ratio and one for moderate-to-high roll-to-sideslip ratio. These flying qualities guidelines are based upon the Military Standard lateral-directional coupling criteria for high performance aircraft - the roll rate oscillation criteria and the sideslip excursion criteria. Example guidelines are generated for a moderate-to-large, an intermediate, and low value of roll-to-sideslip ratio.

Davidson, John B.↗

NASA NTRS2006

The Application of Principal Component Analysis Using Fixed Eigenvectors to the Infrared Thermographic Inspection of the Space Shuttle Thermal Protection System

The Nondestructive Evaluation Sciences Branch at NASA s Langley Research Center has been actively involved in the development of thermographic inspection techniques for more than 15 years. Since the Space Shuttle Columbia accident, NASA has focused on the improvement of advanced NDE techniques for the Reinforced Carbon-Carbon (RCC) panels that comprise the orbiter s wing leading edge. Various nondestructive inspection techniques have been used in the examination of the RCC, but thermography has emerged as an effective inspection alternative to more traditional methods. Thermography is a non-contact inspection method as compared to ultrasonic techniques which typically require the use of a coupling medium between the transducer and material. Like radiographic techniques, thermography can be used to inspect large areas, but has the advantage of minimal safety concerns and the ability for single-sided measurements. Principal Component Analysis (PCA) has been shown effective for reducing thermographic NDE data. A typical implementation of PCA is when the eigenvectors are generated from the data set being analyzed. Although it is a powerful tool for enhancing the visibility of defects in thermal data, PCA can be computationally intense and time consuming when applied to the large data sets typical in thermography. Additionally, PCA can experience problems when very large defects are present (defects that dominate the field-of-view), since the calculation of the eigenvectors is now governed by the presence of the defect, not the good material. To increase the processing speed and to minimize the negative effects of large defects, an alternative method of PCA is being pursued when a fixed set of eigenvectors is used to process the thermal data from the RCC materials. These eigen vectors can be generated either from an analytic model of the thermal response of the material under examination, or from a large cross section of experimental data. This paper will provide the details of the analytic model; an overview of the PCA process; as well as a quantitative signal-to-noise comparison of the results of performing both embodiments of PCA on thermographic data from various RCC specimens. Details of a system that has been developed to allow insitu inspection of a majority of shuttle RCC components will be presented along with the acceptance test results for this system. Additionally, the results of applying this technology to the Space Shuttle Discovery after its return from flight will be presented.

Cramer, K. Elliott↗

NASA NTRS2011

Fixed Eigenvector Analysis of Thermographic NDE Data

Principal Component Analysis (PCA) has been shown effective for reducing thermographic NDE data. This paper will discuss an alternative method of analysis that has been developed where a predetermined set of eigenvectors is used to process the thermal data from both reinforced carbon-carbon (RCC) and graphiteepoxy honeycomb materials. These eigenvectors can be generated either from an analytic model of the thermal response of the material system under examination, or from a large set of experimental data. This paper provides the details of the analytic model, an overview of the PCA process, as well as a quantitative signal-to-noise comparison of the results of performing both conventional PCA and fixed eigenvector analysis on thermographic data from two specimens, one Reinforced Carbon-Carbon with flat bottom holes and the second a sandwich construction with graphite-epoxy face sheets and aluminum honeycomb core.

Cramer, K. Elliott↗

NASA NTRS2017

Thermal Inspection of a Composite Fuselage Section Using a Fixed Eigenvector Principal Component Analysis Method

A composite fuselage aircraft forward section was inspected with flash thermography. The fuselage section is 24 feet long and approximately 8 feet in diameter. The structure is primarily configured with a composite sandwich structure of carbon fiber face sheets with a Nomex(Trademark) honeycomb core. The outer surface area was inspected. The thermal data consisted of 477 data sets totaling in size of over 227 Gigabytes. Principal component analysis (PCA) was used to process the data sets for substructure and defect detection. A fixed eigenvector approach using a global covariance matrix was used and compared to a varying eigenvector approach. The fixed eigenvector approach was demonstrated to be a practical analysis method for the detection and interpretation of various defects such as paint thickness variation, possible water intrusion damage, and delamination damage. In addition, inspection considerations are discussed including coordinate system layout, manipulation of the fuselage section, and the manual scanning technique used for full coverage.

Zalameda, Joseph N.↗

NASA NTRS1978

Signature extraction of ocean pollutants by eigenvector transformation of remote spectra

Spectral signatures of suspended matter in the ocean are being extracted through characteristic vector analysis of remote ocean color data collected with MOCS (Multichannel Ocean Color Sensor). Spectral signatures appear to be obtainable through analyses of 'linear' clusters that appear on scatter diagrams associated with eigenvectors. Signatures associated with acid waste, sewage sludge, oil, and algae are presented. The application of vector analysis to two acid waste dumps overflown two years apart is examined in some detail. The relationships between eigenvectors and spectral signatures for these examples are analyzed. These cases demonstrate the value of characteristic vector analysis in remotely identifying pollutants in the ocean and in determining the consistency of their spectral signatures.

Grew, G. W.↗

NASA NTRS1981

Eigenvector determination by iterative optical methods

Three power algorithms are considered by which an iterative optical processor can be used to compute the eigenvalues and eigenvectors of a matrix. The algorithms are appropriate for three applications: (1) calculating the largest eigenvalue; (2) calculating the eigenvalues in order of decreasingly dominant eigenvalues; and (3) calculating the eigenvector whose eigenvalue is closest to a given value.

Vijaya Kumar, B. V. K.↗

NASA NTRS1989

Eigenvector derivatives of repeated eigenvalues using singular value decomposition

An explicit formula is obtained for the first-order eigenvector derivative that corresponds to the eigenvector of a repeated eigenvalue, in the case of the nonself-adjoint eigenvalue problem. This method applies to the class of nondefective problems whose first eigenvalue derivatives of the repeated eigenvalues are distinct. A singular-value decomposition approach is used to compute four requisite bases for eigenspaces, as well as to keep track of the dimensions of state variables and the conditioning of the state equations.

Lim, Kyong B.↗

NASA NTRS1992

A subspace iteration for eigenvector derivatives

An iterative procedure for calculating eigenvector derivatives has been developed based on the subspace iteration concept. The basic formulation is derived directly from the first variation of the resulting equations of subspace iteration for solving eigenvalue problems. Since the basic formulation conserves the convergence properties of the original subspace iteration for eigen-problems, an overrelaxation scheme similar to Bathe's approach is employed to accelerate the subspace iteration process for calculating eigenvector derivatives.

Ting, T.↗