Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Eigenvalues”

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 1,603 records · Page 89

Control design for future agile fighters

The CRAFT control design methodology is presented. CRAFT stands for the design objectives addressed, namely, Control power, Robustness, Agility, and Flying Qualities Tradeoffs. The approach combines eigenspace assignment, which allows for direct specification of eigenvalues and eigenvectors, and a graphical approach for representing control design metrics that captures numerous design goals in one composite illustration. The methodology makes use of control design metrics from four design objective areas, namely, control power, robustness, agility, and flying qualities. An example of the CRAFT methodology as well as associated design issues are presented.

Murphy, Patrick C.↗

Probabilistic methods for rotordynamics analysis

This paper summarizes the development of the methods and a computer program to compute the probability of instability of dynamic systems that can be represented by a system of second-order ordinary linear differential equations. Two instability criteria based upon the eigenvalues or Routh-Hurwitz test functions are investigated. Computational methods based on a fast probability integration concept and an efficient adaptive importance sampling method are proposed to perform efficient probabilistic analysis. A numerical example is provided to demonstrate the methods.

Wu, Y.-T.↗

Multigrid calculation of three-dimensional viscous cascade flows

A three-dimensional code for viscous cascade flow prediction has been developed. The space discretization uses a cell-centered scheme with eigenvalue scaling to weigh the artificial dissipation terms. Computational efficiency of a four-stage Runge-Kutta scheme is enhanced by using variable coefficients, implicit residual smoothing, and a full-multigrid method. The Baldwin-Lomax eddy-viscosity model is used for turbulence closure. A zonal, nonperiodic grid is used to minimize mesh distortion in and downstream of the throat region. Applications are presented for an annular vane with and without end wall contouring, and for a large-scale linear cascade. The calculation is validated by comparing with experiments and by studying grid dependency.

Arnone, A.↗

Minimum-size design of regulation systems and the application to Space Station

A method is proposed to determine the sizes of the regulator and observer and to design the feedback and Kalman gain matrices for the reduced system. The sizes determined are minimum in the sense of satisfying the specified eigenvalue limits when the interaction between the regulator and the observer can be neglected. The resulting sizes will depend on the properties of the original system and the desired response. If the interaction between the regulator and the observer becomes substantial, more modes in the observer should be included, or other methods should be used for reducing the observation spillover or control spillover.

Reddy, A. S. S. R.↗

Solving Large Sparse Symmetric Eigenproblems

LANZ program implements sophisticated algorithm based on simple Lanczos method for solving generalized eigenvalue problem. Uses dynamic shifting to improve efficiency and reliability of basic Lanczos algorithm. Written in FORTRAN 77 and C language.

Jones, Mark T.↗

Robust Assignment Of Eigensystems For Flexible Structures

Improved method for placement of eigenvalues and eigenvectors of closed-loop control system by use of either state or output feedback. Applied to reduced-order finite-element mathematical model of NASA's MAST truss beam structure. Model represents deployer/retractor assembly, inertial properties of Space Shuttle, and rigid platforms for allocation of sensors and actuators. Algorithm formulated in real arithmetic for efficient implementation. Choice of open-loop eigenvector matrix and its closest unitary matrix believed suitable for generating well-conditioned eigensystem with small control gains. Implication of this approach is that element of iterative search for "optimal" unitary matrix appears unnecessary in practice for many test problems.

Juang, Jer-Nan↗

A restricted signature normal form for Hermitian matrices, quasi-spectral decompositions, and applications

In recent years, a number of results on the relationships between the inertias of Hermitian matrices and the inertias of their principal submatrices appeared in the literature. We study restricted congruence transformation of Hermitian matrices M which, at the same time, induce a congruence transformation of a given principal submatrix A of M. Such transformations lead to concept of the restricted signature normal form of M. In particular, by means of this normal form, we obtain short proofs of most of the known inertia theorems and also derive some new results of this type. For some applications, a special class of almost unitary restricted congruence transformations turns out to be useful. We show that, with such transformations, M can be reduced to a quasi-diagonal form which, in particular, displays the eigenvalues of A. Finally, applications of this quasi-spectral decomposition to generalize inverses and Hermitian matrix pencils are discussed.

Freund, Roland W.↗

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

The nonsymmetric Lanczos method can be used to compute eigenvalues of large sparse non-Hermitian matrices or to solve large sparse non-Hermitian linear systems. However, the original Lanczos algorithm is susceptible to possible breakdowns and potential instabilities. We present an implementation of a look-ahead version of the Lanczos algorithm which overcomes these problems by skipping over those steps in which a breakdown or near-breakdown would occur in the standard process. The proposed algorithm can handle look-ahead steps of any length and is not restricted to steps of length 2, as earlier implementations are. Also, our implementation has the feature that it requires roughly the same number of inner products as the standard Lanczos process without look-ahead.

Freund, Roland W.↗

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

Overview of Krylov subspace methods with applications to control problems

An overview of projection methods based on Krylov subspaces are given with emphasis on their application to solving matrix equations that arise in control problems. The main idea of Krylov subspace methods is to generate a basis of the Krylov subspace Span and seek an approximate solution the the original problem from this subspace. Thus, the original matrix problem of size N is approximated by one of dimension m typically much smaller than N. Krylov subspace methods have been very successful in solving linear systems and eigenvalue problems and are now just becoming popular for solving nonlinear equations. It is shown how they can be used to solve partial pole placement problems, Sylvester's equation, and Lyapunov's equation.

Saad, Youcef↗

Multigrid calculation of three-dimensional viscous cascade flows

A 3-D code for viscous cascade flow prediction was developed. The space discretization uses a cell-centered scheme with eigenvalue scaling to weigh the artificial dissipation terms. Computational efficiency of a four stage Runge-Kutta scheme is enhanced by using variable coefficients, implicit residual smoothing, and a full multigrid method. The Baldwin-Lomax eddy viscosity model is used for turbulence closure. A zonal, nonperiodic grid is used to minimize mesh distortion in and downstream of the throat region. Applications are presented for an annular vane with and without end wall contouring, and for a large scale linear cascade. The calculation is validated by comparing with experiments and by studying grid dependency.

Arnone, A.↗

Numerical methods in Markov chain modeling

Several methods for computing stationary probability distributions of Markov chains are described and compared. The main linear algebra problem consists of computing an eigenvector of a sparse, usually nonsymmetric, matrix associated with a known eigenvalue. It can also be cast as a problem of solving a homogeneous singular linear system. Several methods based on combinations of Krylov subspace techniques are presented. The performance of these methods on some realistic problems are compared.

Philippe, Bernard↗

The stability of numerical boundary treatments for compact high-order finite-difference schemes

The stability characteristics of various compact fourth and sixth order spatial operators are assessed using the theory of Gustafsson, Kreiss and Sundstrom (G-K-S) for the semi-discrete Initial Boundary Value Problem (IBVP). These results are then generalized to the fully discrete case using a recently developed theory of Kreiss. In all cases, favorable comparisons are obtained between the G-K-S theory, eigenvalue determination, and numerical simulation. The conventional definition of stability is then sharpened to include only those spatial discretizations that are asymptotically stable. It is shown that many of the higher order schemes which are G-K-S stable are not asymptotically stable. A series of compact fourth and sixth order schemes, which are both asymptotically and G-K-S stable for the scalar case, are then developed.

Carpenter, Mark H.↗

Projection methods for the numerical solution of Markov chain models

Projection methods for computing stationary probability distributions for Markov chain models are presented. A general projection method is a method which seeks an approximation from a subspace of small dimension to the original problem. Thus, the original matrix problem of size N is approximated by one of dimension m, typically much smaller than N. A particularly successful class of methods based on this principle is that of Krylov subspace methods which utilize subspaces of the form span(v,av,...,A(exp m-1)v). These methods are effective in solving linear systems and eigenvalue problems (Lanczos, Arnoldi,...) as well as nonlinear equations. They can be combined with more traditional iterative methods such as successive overrelaxation, symmetric successive overrelaxation, or with incomplete factorization methods to enhance convergence.

Saad, Youcef↗

Proper orthogonal decomposition based turbulence modeling

The proper orthogonal decomposition is utilized to provide one mode estimates of various turbulence quantities in the near-wall region of the turbulent boundary layer. The experimental data of Herzog (1986) and the direct numerical simulation (DNS) results of Zang (1991) proved the two-point correlation tensor. The correlation tensor is then used as the kernel in the integral eigenvalue problem from which the proper orthogonal modes are obtained. The one mode estimates of the turbulent kinetic energy, dissipation, and triple moments all exhibit the proper asymtotic behavior near the wall. As a validation test, a model for the triple moments is developed and its near-wall behavior is studied. This information can then be used to obtain an estimate of the damping function near the wall, which is then compared to known existing behavior. Since this is an initial investigation, the streamwise and spanwise dependence is surpressed and only the wall normal direction (y+) behavior of various turbulence statistics near the wall is studied. Before examining one mode estimates of the triple moments and the dissipation (on which the model is based), various second order moments are examined. If these do not exhibit the proper behavior near the wall (as discussed by Speziale et al 1990) it does not seem reasonable to expect the one mode estimate of the triple moment and dissipation to have the right behavior. Only the results obtained using the experimental data of Herzog are discussed since the results from the simulations of Zang exhibit similar behavior as discussed above.

Glauser, Mark N.↗

Determination of Rotordynamic Coefficients for Labyrinth Seals and Application to Rotordynamic Design Calculations

In today's rotordynamic calculations, the input parameters for a finite element analysis (FEA) determine very much the reliability of eigenvalue and eigenmode predictions. While modeling of an elastic structure by means of beam elements etc. is relatively straightforward to perform and the input data for journal bearings are usually known exactly enough, the determination of stiffness and damping for labyrinth seals is still the subject of many investigations. Therefore, the rotordynamic influence of labyrinths is often not included in FEA for rotating machinery because of a lack of computer programs to calculate these parameters. This circumstance can give rise to severe vibration problems especially for high performance turbines or compressors, resulting in remarkable economic losses. The forces generated in labyrinths can be described for small motions around the seal center with a linearized force-motion relationship. Several years ago, we started with the development of computer codes for the determination of rotordynamic seal coefficients. Our different approaches to evaluate the dynamic fluid forces generated by turbulent, compressible seal flow are introduced.

Weiser, P.↗

The Rocketdyne Multifunction Tester. Part 2: Operation of a Radial Magnetic Bearing as an Excitation Source

The operation of the magnetic bearing used as an excitation source in the Rocketdyne Multifunction Tester is described. The tester is scheduled for operation during the summer of 1990. The magnetic bearing can be used in two control modes: (1) open loop mode, in which the magnetic bearing operates as a force actuator; and (2) closed loop mode, in which the magnetic bearing provides shaft support. Either control mode can be used to excite the shaft; however, response of the shaft in the two control modes is different due to the alteration of the eigenvalues by closed loop mode operation. A rotordynamic model is developed to predict the frequency response of the tester due to excitation in either control mode. Closed loop mode excitation is shown to be similar to the excitation produced by a rotating eccentricity in a conventional bearing. Predicted frequency response of the tester in the two control modes is compared, and the maximum response is shown to be the same for the two control modes when synchronous unbalance loading is not considered. The analysis shows that the response of this tester is adequate for the extraction of rotordynamic stiffness, damping, and inertia coefficients over a wide range of test article stiffnesses.

Hawkins, L. A.↗

Technical notes and correspondence: Stochastic robustness of linear time-invariant control systems

A simple numerical procedure for estimating the stochastic robustness of a linear time-invariant system is described. Monte Carlo evaluations of the system's eigenvalues allows the probability of instability and the related stochastic root locus to be estimated. This analysis approach treats not only Gaussian parameter uncertainties but non-Gaussian cases, including uncertain-but-bounded variation. Confidence intervals for the scalar probability of instability address computational issues inherent in Monte Carlo simulation. Trivial extensions of the procedure admit consideration of alternate discriminants; thus, the probabilities that stipulated degrees of instability will be exceeded or that closed-loop roots will leave desirable regions can also be estimated. Results are particularly amenable to graphical presentation.

Stengel, Robert F.↗