Search NASA⌕ Search

SEARCH · Search NASA

Results for “eigenvalue method”

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 361 records · Page 20
All sourcesNASA NTRSDOE OSTI
NASA NTRS1985

Parameter identification in distributed systems

This paper describes a method for the identification of the parameters entering into the equations of motion of distributed systems. Because the motion of distributed systems is described in terms of partial differential equations, these parameters are in general continuous functions of the spatial variables. For vibrating systems, these parameters ordinarily represent the mass, stiffness and damping distributions. In this paper, these distributions are expanded in terms of finite series of known functions of the spatial variables multiplied by undetermined coefficients. It is assumed that the nature of the equations of motion is known and that a limited number of eigenvalues and eigenfunctions is identified in advance. Use is then made of the least squares method, in conjunction with the eigenfunctions' orthogonality, to compute the undetermined coefficients, thus identifying the system distributed parameters. A method for the identification of the eigensolution is also presented. The procedure for the identification of the eigensolution and of the system parameters is demonstrated via a numerical example.

Baruh, H.↗
NASA NTRS1987

Computational procedures for evaluating the sensitivity derivatives of vibration frequencies and Eigenmodes of framed structures

Computational procedures are presented for evaluating the sensitivity derivatives of the vibration frequencies and eigenmodes of framed structures. Both a displacement and a mixed formulation are used. The two key elements of the computational procedure are: (a) Use of dynamic reduction techniques to substantially reduce the number of degrees of freedom; and (b) Application of iterative techniques to improve the accuracy of the derivatives of the eigenmodes. The two reduction techniques considered are the static condensation and a generalized dynamic reduction technique. Error norms are introduced to assess the accuracy of the eigenvalue and eigenvector derivatives obtained by the reduction techniques. The effectiveness of the methods presented is demonstrated by three numerical examples.

Fetterman, Timothy L.↗
NASA NTRS1989

Quotient-difference type generalizations of the power method and their analysis

The recursion relations that were proposed by W. F. Ford and A. Sidi (Appl. Numer. Math, 4 (1988), pp. 477-489) for implementing vector extrapolation methods are used for devising generalizations of the power method for linear operators. These generalizations are shown to produce approximations to largest eigenvalues of a linear operator under certain conditions. They are similar in form to the quotient-difference algorithm and share similar convergence properties with the latter. These convergence properties also resemble those obtained for the basic LR and QR algorithms. Finally, it is shown that the convergence rate produced by one fo these generalizations is twice as fast for normal operators as it is for nonnormal operators.

Sidi, Avram↗
NASA NTRS1990

On the instabilities of supersonic mixing layers - A high-Mach-number asymptotic theory

The stability of a family of tanh mixing layers is studied at large Mach numbers using perturbation methods. It is found that the eigenfunction develops a multilayered structure, and the eigenvalue is obtained by solving a simplified version of the Rayleigh equation (with homogeneous boundary conditions) in one of these layers which lies in either of the external streams. This analysis leads to a simple hypersonic similarity law which explains how spatial and temporal phase speeds and growth rates scale with Mach number and temperature ratio. Comparisons are made with numerical results, and it is found that this similarity law provides a good qualitative guide for the behavior of the instability at high Mach numbers. In addition to this asymptotic theory, some fully numerical results are also presented (with no limitation on the Mach number) in order to explain the origin of the hypersonic modes (through mode splitting) and to discuss the role of oblique modes over a very wide range of Mach number and temperature ratio.

Balsa, Thomas F.↗
NASA NTRSDate not supplied

SLS Integrated Modal Test Uncertainty Quantification using the Hybrid Parametric Variation Method

Uncertainty in structural loading during launch is a significant concern in the development of spacecraft and launch vehicles. Small variations in launch vehicle and payload mode shapes and their interaction can result in significant variation in system loads. In many cases involving large aerospace systems it is difficult, not economical, or impossible to perform a system modal test. However, it is still vital to obtain test results that can be compared with analytical predictions to validate models. Instead, the “Building Block Approach” is used in which system components are tested individually. Component models are correlated and updated to agree as best they can with test results. The Space Launch System consists of a number of components that are assembled into a launch vehicle. Finite element models of the components are developed, reduced to Hurty/Craig-Bampton models and assembled to represent different phases of flight. The only opportunity to obtain modal test data from an assembled Space Launch System will be during the Integrated Modal Test. There is always uncertainty in every model, which flows into uncertainty in predicted system results. Uncertainty Quantification is used to determine statistical bounds on prediction accuracy based on model uncertainty. For the Space Launch System, model uncertainty is at the Hurty/Craig-Bampton component level. Uncertainty in the Hurty/Craig-Bampton components is quantified using the hybrid parametric variation approach that combines parametric and nonparametric uncertainty. Uncertainty in model form is one of the biggest contributors to uncertainty in complex built-up structures. This type of uncertainty cannot be represented by variations infinite element model input parameters and thus cannot be included in a parametric approach. However, model-form uncertainty can be modeled using a nonparametric approach based on random matrix theory. The hybrid parametric variation method requires the selection of dispersion values for the Hurty/Craig-Bampton fixed-interface eigenvalues, and the Hurty/Craig-Bampton stiffness matrices. Component test/analysis frequency error is used to identify the fixed-interface eigenvalue dispersions, while test/analysis cross-orthogonality is used to identify stiffness dispersion values. The hybrid parametric variation uncertainty quantification approach is applied to the Space Launch System Integrated Modal Test configuration. Monte Carlo analysis is performed, and statistics are determined for modal correlation metrics, frequency response from Integrated Modal Test shakers to selected accelerometers, as well as other metrics for determining how well target modes are excited and identified. If the predicted uncertainty envelopes future Integrated Modal Test results, then there will be increased confidence in the utility of the component-based hybrid parametric variation uncertainty quantification approach.

Uncertainty Quantification↗
NASA NTRS1990

An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices, part 2

It is shown how the look-ahead Lanczos process (combined with a quasi-minimal residual QMR) approach) can be used to develop a robust black box solver for large sparse non-Hermitian linear systems. Details of an implementation of the resulting QMR algorithm are presented. It is demonstrated that the QMR method is closely related to the biconjugate gradient (BCG) algorithm; however, unlike BCG, the QMR algorithm has smooth convergence curves and good numerical properties. We report numerical experiments with our implementation of the look-ahead Lanczos algorithm, both for eigenvalue problem and linear systems. Also, program listings of FORTRAN implementations of the look-ahead algorithm and the QMR method are included.

Freund, Roland W.↗
NASA NTRS1985

Probabilistic finite elements for transient analysis in nonlinear continua

The probabilistic finite element method (PFEM), which is a combination of finite element methods and second-moment analysis, is formulated for linear and nonlinear continua with inhomogeneous random fields. Analogous to the discretization of the displacement field in finite element methods, the random field is also discretized. The formulation is simplified by transforming the correlated variables to a set of uncorrelated variables through an eigenvalue orthogonalization. Furthermore, it is shown that a reduced set of the uncorrelated variables is sufficient for the second-moment analysis. Based on the linear formulation of the PFEM, the method is then extended to transient analysis in nonlinear continua. The accuracy and efficiency of the method is demonstrated by application to a one-dimensional, elastic/plastic wave propagation problem. The moments calculated compare favorably with those obtained by Monte Carlo simulation. Also, the procedure is amenable to implementation in deterministic FEM based computer programs.

Liu, W. K.↗
NASA NTRS1992

Rational approximations from power series of vector-valued meromorphic functions

Let F(z) be a vector-valued function, F: C yields C(sup N), which is analytic at z = 0 and meromorphic in a neighborhood of z = 0, and let its Maclaurin series be given. In this work we developed vector-valued rational approximation procedures for F(z) by applying vector extrapolation methods to the sequence of partial sums of its Maclaurin series. We analyzed some of the algebraic and analytic properties of the rational approximations thus obtained, and showed that they were akin to Pade approximations. In particular, we proved a Koenig type theorem concerning their poles and a de Montessus type theorem concerning their uniform convergence. We showed how optical approximations to multiple poles and to Laurent expansions about these poles can be constructed. Extensions of the procedures above and the accompanying theoretical results to functions defined in arbitrary linear spaces was also considered. One of the most interesting and immediate applications of the results of this work is to the matrix eigenvalue problem. In a forthcoming paper we exploited the developments of the present work to devise bona fide generalizations of the classical power method that are especially suitable for very large and sparse matrices. These generalizations can be used to approximate simultaneously several of the largest distinct eigenvalues and corresponding eigenvectors and invariant subspaces of arbitrary matrices which may or may not be diagonalizable, and are very closely related with known Krylov subspace methods.

Sidi, Avram↗
NASA NTRS1999

How to Estimate Attitude from Vector Observations

The most robust estimators minimizing Wahba's loss function are Davenport's q method and the Singular Value Decomposition (SVD) method. The q method is faster than the SVD method with three or more measurements. The other algorithms are less robust since they solve the characteristic polynomial equation to find the maximum eigenvalue of Davenport's K matrix. They are only preferable when speed or processor power is an important consideration. Of these, Fast Optimal Attitude Matrix (FOAM) is the most robust and faster than the q method. Robustness is only an issue for measurements with widely differing accuracies, so the fastest algorithms, Quaternion ESTimator (QUEST), EStimator of the Optimal Quaternion (ESOQ), and ESOQ2, are well suited to star sensor applications.

Markley, F. Landis↗
NASA NTRS1986

Landsat D Thematic Mapper image dimensionality reduction and geometric correction accuracy

To characterize and quantify the performance of the Landsat thematic mapper (TM), techniques for dimensionality reduction by linear transformation have been studied and evaluated and the accuracy of the correction of geometric errors in TM images analyzed. Theoretical evaluations and comparisons for existing methods for the design of linear transformation for dimensionality reduction are presented. These methods include the discrete Karhunen Loeve (KL) expansion, Multiple Discriminant Analysis (MDA), Thematic Mapper (TM)-Tasseled Cap Linear Transformation and Singular Value Decomposition (SVD). A unified approach to these design problems is presented in which each method involves optimizing an objective function with respect to the linear transformation matrix. From these studies, four modified methods are proposed. They are referred to as the Space Variant Linear Transformation, the KL Transform-MDA hybrid method, and the First and Second Version of the Weighted MDA method. The modifications involve the assignment of weights to classes to achieve improvements in the class conditional probability of error for classes with high weights. Experimental evaluations of the existing and proposed methods have been performed using the six reflective bands of the TM data. It is shown that in terms of probability of classification error and the percentage of the cumulative eigenvalues, the six reflective bands of the TM data require only a three dimensional feature space. It is shown experimentally as well that for the proposed methods, the classes with high weights have improvements in class conditional probability of error estimates as expected.

Ford, G. E.↗
NASA NTRS1966

Matrix methods and automation in structural engineering

The partial differential equations of motion of shell structures subject to arbitrary loads may be extremely difficult or even impossible to solve. Since the digital computer is now an available tool for the structural engineer, current research has been directed toward methods which involve matrix formulation of large systems of algebraic equations and matrix solutions for discrete elements rather than the solution of the partial differential equations. These methods require rapid and accurate computer solutions. Recognizing the accuracy problems inherent in working with large matrices, a comprehensive survey of available computer programs was performed for large matrix inversion and for eigenvalue and eigenvector solutions under a Research Grant from the National Aeronautics and Space Administration and the techniques are developed in this paper for using these programs most efficiently for structural applications. The contents of the paper include: automation of matrix compilation, methods of very large matrix inversion and solution of simultaneous equation, and techniques for finding eigenvalues and vectors. In addition, a finite element stiffness matrix approach developed at the Denver Research Institute for both plates and shells subject to arbitrary dynamic loads is described as it was instrumented with complete automation on the digital computer.

Anita S West↗
NASA NTRS1972

Hydrogen atom in intense magnetic field.

The structure of a hydrogen atom situated in an intense magnetic field is investigaged. Three approaches are employed. An elementary Bohr picture establishes a crucial magnetic field strength, H sub a approximately equal to 5 x 10 to the 9th G. Fields in excess of H sub a are intense in that they are able to modify the characteristic atomic scales of length and binding energy. A second approach solves the Schrodinger equation by a combination of variational methods and perturbation theory. It yields analytic expressions for the wave functions and energy eigenvalues. A third approach determines the energy eigenvalues by reducing the Schrodinger equation to a one-dimensional wave equation, which is then solved numerically. Energy eigenvalues are tabulated for field strengths of 2 x 10 to the 10th G and 2 x 10 to the 12th G. It is found that at 2 x 10 to the 12th G the lowest energy eigenvalue is changed from -13.6 to about -180 eV in agreement with previous variational computations.

Canuto, V.↗
NASA NTRS1980

A dynamic analysis of the motion of a low-wing general aviation aircraft about its calculated equilibrium flat spin mode

The properties of the flat spin mode of a general aviation configuration have been studied through analysis of rotary balance data, numerical simulation, and analytical study of the equilibrium state. The equilibrium state is predicted well from rotary balance data. The variations of yawing moment and pitching moment as functions of sideslip have been shown to be of great importance in obtaining accurate modeling. These dependencies are not presently available with sufficient accuracy from previous tests or theories. The stability of the flat spin mode has been examined extensively using numerical linearization, classical perturbation methods, and reduced order modeling. The stability exhibited by the time histories and the eigenvalue analyses is shown to be strongly dependent on certain static cross derivatives and more so on the dynamic derivatives. Explicit stability criteria are obtained from the reduced order models.

Tischler, M. B.↗
NASA NTRS1981

A study of the modal truncation error in the component mode analysis of a dual-rotor system

In the component mode synthesis method, the equation of motion in the generalized coordinates is built upon the undamped eigenvalue data of the component structures. Error is inevitable when truncated modes are used. In this paper, two modal truncation schemes were evaluated with regard to the critical speed, stability, and unbalance response of a two-spool gas turbine engine. The numbers of modes required to yield acceptable accuracy in these cases were determined. Guidelines for modal truncation were derived from these results.

Li, D. F.↗
NASA NTRS1985

A sequential linear optimization approach for controller design

A linear optimization approach with a simple real arithmetic algorithm is presented for reliable controller design and vibration suppression of flexible structures. Using first order sensitivity of the system eigenvalues with respect to the design parameters in conjunction with a continuation procedure, the method converts a nonlinear optimization problem into a maximization problem with linear inequality constraints. The method of linear programming is then applied to solve the converted linear optimization problem. The general efficiency of the linear programming approach allows the method to handle structural optimization problems with a large number of inequality constraints on the design vector. The method is demonstrated using a truss beam finite element model for the optimal sizing and placement of active/passive-structural members for damping augmentation. Results using both the sequential linear optimization approach and nonlinear optimization are presented and compared. The insensitivity to initial conditions of the linear optimization approach is also demonstrated.

Horta, L. G.↗
NASA NTRS1987

Optimal control of large space structures via generalized inverse matrix

Independent Modal Space Control (IMSC) is a control scheme that decouples the space structure into n independent second-order subsystems according to n controlled modes and controls each mode independently. It is well-known that the IMSC eliminates control and observation spillover caused when the conventional coupled modal control scheme is employed. The independent control of each mode requires that the number of actuators be equal to the number of modelled modes, which is very high for a faithful modeling of large space structures. A control scheme is proposed that allows one to use a reduced number of actuators to control all modeled modes suboptimally. In particular, the method of generalized inverse matrices is employed to implement the actuators such that the eigenvalues of the closed-loop system are as closed as possible to those specified by the optimal IMSC. Computer simulation of the proposed control scheme on a simply supported beam is given.

Nguyen, Charles C.↗
NASA NTRS1988

Solving large sparse eigenvalue problems on supercomputers

An important problem in scientific computing consists in finding a few eigenvalues and corresponding eigenvectors of a very large and sparse matrix. The most popular methods to solve these problems are based on projection techniques on appropriate subspaces. The main attraction of these methods is that they only require the use of the matrix in the form of matrix by vector multiplications. The implementations on supercomputers of two such methods for symmetric matrices, namely Lanczos' method and Davidson's method are compared. Since one of the most important operations in these two methods is the multiplication of vectors by the sparse matrix, methods of performing this operation efficiently are discussed. The advantages and the disadvantages of each method are compared and implementation aspects are discussed. Numerical experiments on a one processor CRAY 2 and CRAY X-MP are reported. Possible parallel implementations are also discussed.

Philippe, Bernard↗