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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
NASA NTRS1986

Stability of semidiscrete approximations for hyperbolic initial-boundary-value problems: An eigenvalue analysis

A hyperbolic initial-boundary-value problem can be approximated by a system of ordinary differential equations (ODEs) by replacing the spatial derivatives by finite-difference approximations. The resulting system of ODEs is called a semidiscrete approximation. A complication is the fact that more boundary conditions are required for the spatially discrete approximation than are specified for the partial differential equation. Consequently, additional numerical boundary conditions are required and improper treatment of these additional conditions can lead to instability. For a linear initial-boundary-value problem (IBVP) with homogeneous analytical boundary conditions, the semidiscrete approximation results in a system of ODEs of the form du/dt = Au whose solution can be written as u(t) = exp(At)u(O). Lax-Richtmyer stability requires that the matrix norm of exp(At) be uniformly bounded for O less than or = t less than or = T independent of the spatial mesh size. Although the classical Lax-Richtmyer stability definition involves a conventional vector norm, there is no known algebraic test for the uniform boundedness of the matrix norm of exp(At) for hyperbolic IBVPs. An alternative but more complicated stability definition is used in the theory developed by Gustafsson, Kreiss, and Sundstrom (GKS). The two methods are compared.

Warming, Robert F.↗
NASA NTRS1988

Parallel computer methods for eigenvalue extraction

A new numerical algorithm for the solution of large-order eigenproblems typically encountered in linear elastic finite element systems is presented. The architecture of parallel processing is used in the algorithm to achieve increased speed and efficiency of calculations. The algorithm is based on the frontal technique for the solution of linear simultaneous equations and the modified subspace eigenanalysis method for the solution of the eigenproblem. The advantages of this new algorithm in parallel computer architecture are discussed.

Akl, Fred↗
NASA NTRS1987

Linear quadratic regulators with eigenvalue placement in a horizontal strip

A method for optimally shifting the imaginary parts of the open-loop poles of a multivariable control system to the desirable closed-loop locations is presented. The optimal solution with respect to a quadratic performance index is obtained by solving a linear matrix Liapunov equation.

Shieh, Leang S.↗
NASA NTRS1988

A spectral collocation solution to the compressible stability eigenvalue problem

A newly developed spectral compressible linear stability code (SPECLS) (staggered pressure mesh) is presented for analysis of shear flow stability, and applied to high speed boundary layers and free shear flows. The formulation utilizes the first application of a staggered mesh for a compressible flow analysis by a spectral technique. An order of magnitude less number of points is needed for equivalent accuracy of growth rates compared to those calculated by a finite difference formulation. Supersonic disturbances which are found to have oscillatory structures were resolved by a spectral multi-domain discretization, which requires a factor of three fewer points than the single domain spectral stability code. It is indicated, as expected, that stability of mixing layers is enhanced by viscosity and increasing Mach number. The mean flow involves a jet being injected into a quiescent gas. Higher temperatures of the injected gas is also found to enhance stability characteristics of the free shear layer.

Macaraeg, Michele G.↗
NASA NTRS1989

Parallel Eigenvalue extraction

A new numerical algorithm for the solution of large-order eigenproblems typically encountered in linear elastic finite element systems is presented. The architecture of parallel processing is utilized in the algorithm to achieve increased speed and efficiency of calculations. The algorithm is based on the frontal technique for the solution of linear simultaneous equations and the modified subspace eigenanalysis method for the solution of the eigenproblem. Assembly, elimination and back-substitution of degrees of freedom are performed concurrently, using a number of fronts. All fronts converge to and diverge from a predefined global front during elimination and back-substitution, respectively. In the meantime, reduction of the stiffness and mass matrices required by the modified subspace method can be completed during the convergence/divergence cycle and an estimate of the required eigenpairs obtained. Successive cycles of convergence and divergence are repeated until the desired accuracy of calculations is achieved. The advantages of this new algorithm in parallel computer architecture are discussed.

Akl, Fred A.↗
NASA NTRS1990

Eigenvalue computations with the QUAD4 consistent-mass matrix

The NASTRAN user has the option of using either a lumped-mass matrix or a consistent- (coupled-) mass matrix with the QUAD4 shell finite element. At the Sixteenth NASTRAN Users' Colloquium (1988), Melvyn Marcus and associates of the David Taylor Research Center summarized a study comparing the results of the QUAD4 element with results of other NASTRAN shell elements for a cylindrical-shell modal analysis. Results of this study, in which both the lumped-and consistent-mass matrix formulations were used, implied that the consistent-mass matrix yielded poor results. In an effort to further evaluate the consistent-mass matrix, a study was performed using both a cylindrical-shell geometry and a flat-plate geometry. Modal parameters were extracted for several modes for both geometries leading to some significant conclusions. First, there do not appear to be any fundamental errors associated with the consistent-mass matrix. However, its accuracy is quite different for the two different geometries studied. The consistent-mass matrix yields better results for the flat-plate geometry and the lumped-mass matrix seems to be the better choice for cylindrical-shell geometries.

Butler, Thomas A.↗
NASA NTRS1991

Sequential design of linear quadratic state regulators with prescribed eigenvalues and specified relative stability

This paper considers the problem of optimal regulator design of linear multivariable systems with prescribed pole locations and/or poles corresponding to specified relative stability. A sequential method based on the frequency-domain optimality condition is proposed for achieving the desired pole assignment and determination of the corresponding quadratic performance index. This design method enables the retention of some stable open-loop poles and the associated eigenvectors in the closed-loop system. An illustrative example is provided to demonstrate the effectiveness of the proposed method.

Ganesan, Sekar↗
NASA NTRS1990

Design of linear quadratic regulators with eigenvalue placement in a specified region

Two linear quadratic regulators are developed for placing the closed-loop poles of linear multivariable continuous-time systems within the common region of an open sector, bounded by lines inclined at +/- pi/2k (for a specified integer k not less than 1) from the negative real axis, and the left-hand side of a line parallel to the imaginary axis in the complex s-plane, and simultaneously minimizing a quadratic performance index. The design procedure mainly involves the solution of either Liapunov equations or Riccati equations. The general expression for finding the lower bound of a constant gain gamma is also developed.

Shieh, Leang-San↗
NASA NTRS1993

Using parallel banded linear system solvers in generalized eigenvalue problems

Subspace iteration is a reliable and cost effective method for solving positive definite banded symmetric generalized eigenproblems, especially in the case of large scale problems. This paper discusses an algorithm that makes use of two parallel banded solvers in subspace iteration. A shift is introduced to decompose the banded linear systems into relatively independent subsystems and to accelerate the iterations. With this shift, an eigenproblem is mapped efficiently into the memories of a multiprocessor and a high speed-up is obtained for parallel implementations. An optimal shift is a shift that balances total computation and communication costs. Under certain conditions, we show how to estimate an optimal shift analytically using the decay rate for the inverse of a banded matrix, and how to improve this estimate. Computational results on iPSC/2 and iPSC/860 multiprocessors are presented.

Zhang, Hong↗