Search NASA⌕ Search

SEARCH · Search NASA

Results for “Eigenvalue problems”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
NASA NTRS1992

Application of vector-valued rational approximations to the matrix eigenvalue problem and connections with Krylov subspace methods

Let F(z) be a vectored-valued function F: C approaches C sup N, which is analytic at z=0 and meromorphic in a neighborhood of z=0, and let its Maclaurin series be given. We use vector-valued rational approximation procedures for F(z) that are based on its Maclaurin series in conjunction with power iterations to develop bona fide generalizations of the power method for an arbitrary N X N matrix that may be diagonalizable or not. These generalizations can be used to obtain simultaneously several of the largest distinct eigenvalues and the corresponding invariant subspaces, and present a detailed convergence theory for them. In addition, it is shown that the generalized power methods of this work are equivalent to some Krylov subspace methods, among them the methods of Arnoldi and Lanczos. Thus, the theory provides a set of completely new results and constructions for these Krylov subspace methods. This theory suggests at the same time a new mode of usage for these Krylov subspace methods that were observed to possess computational advantages over their common mode of usage.

Sidi, Avram↗
NASA NTRS1973

An extension of the QZ algorithm for solving the generalized matrix eigenvalue problem

This algorithm is an extension of Moler and Stewart's QZ algorithm with some added features for saving time and operations. Also, some additional properties of the QR algorithm which were not practical to implement in the QZ algorithm can be generalized with the combination shift QZ algorithm. Numerous test cases are presented to give practical application tests for algorithm. Based on results, this algorithm should be preferred over existing algorithms which attempt to solve the class of generalized eigenproblems where both matrices are singular or nearly singular.

Ward, R. C.↗
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 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↗
NASA NTRS1985

A method for determining acoustic-liner admittance in ducts with sheared flow in two-cross-sectional directions

A method is developed for determining the acoustic admittance of a test liner installed in the wall of a grazing flow impedance tube. The mean flow is permitted flow gradients in both cross-sectional directions of the tube. The unknown admittance value is obtained by solving an eigenvalue problem. This eigenvalue problem results from the application of the finite-element method to the partial differential equation and boundary conditions governing the acoustic field. The credibility of the method is established by comparing results with exact solutions obtained for a constant mean-flow profile and with previous results for cases involving shear in only one cross-sectional direction. Excellent comparisons are obtained in both cases. The analysis is used in conjunction with a limited amount of experimental data and shows that the flow must be accurately modeled in order to determine the acoustic-liner properties.

Watson, W. R.↗